Generative word alignment models, such as IBM Models, are restricted to oneto-many alignment, and cannot explicitly represent many-to-many relationships in a bilingual text. The problem is partially solved either by introducing heuristics or by agreement constraints such that two directional word alignments agree with each other. In this paper, we focus on the posterior regularization framework...

RÉSUMÉ. Nous étudions dans cet article le comportement de plusieurs modèles de rétropertinence en mettant en avant leurs principales caractéristiques. Ceci nous conduit à introduire une nouvelle contrainte pour les modèles de rétro-pertinence, contrainte liée à la fréquence documentaire (DF) des mots. Nous analysons ensuite, d’un point de vue théorique, différents modèles de rétro-pertinence pa...

This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large d...

The contribution of this paper is twofold. We present a new method for feasible cellular frequency assignment, a hard combinatorial optimization problem from telecommunications. Frequency assignment problems arise when a cellular radio network has to be established. Given a number of base stations, the goal is to assign each a number of frequencies, subject to given interference restrictions. W...

As a major structural dynamic criterion in designing thin shells, the fundamental frequency is maximized for a specified total structural mass. The general optimization problem of metallic conical shell structures with clamped / free ends has been treated formally among all other types of boundary conditions. Both stiffened and unstiffened constructions are examined with the effective design va...

We study the problem of automatic frequency assignment for cellular telephone systems. The frequency assignment problem is viewed as the problem to minimize the unsatisfied soft constraints in a constraint satisfaction problem (CSP) over a finite domain of frequencies involving co-channel, adjacent channel, and co-site constraints. The soft constraints are automatically derived from signal stre...

The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One original contribution is to provide a geometrical interpretation of these rules that can be used by a generic sweep pruning algorithm. Finally one practical interest of the paper is to describe an implementation of the number of distinct values constr...

We address the issue of how information flows within the written word production system by examining written object-naming latencies. We report 4 experiments in which we manipulate variables assumed to have their primary impact at the level of object recognition (e.g., quality of visual presentation of pictured objects), at the level of semantic processing (contextual constraint), and at the le...