Deux noms tangoutes dans une legende tibetaine

Revue d’Etudes Tibétaines Number 13, February 200

Review of Zhang Jichuan 张济川 2009 藏语词族研究 Zangyu cizu yanjiu (A study on word families in Tibetan), Beijing: Shehui kexue wenxian chubanshe.

International audienceReview of Zhang Jichuan 200

Bulking II: Classifications of Cellular Automata

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc) providing several formal tools allowing to classify cellular automata

The origin of the reflexive prefix in Rgyalrong languages

International audienceIn the Sino-Tibetan family, reflexivity is either not expressed on the verb as in Chinese or Tibetan or expressed by means of a ‘middle' marker as in Dulong or Kiranti languages. Among the morphologically rich languages of this family, only Rgyalrong languages have distinct and unambiguous reflexive and reciprocal markers on the verb. This paper shows that the reflexive prefix in Rgyalrong languages has two possible origins. It could come from a fusion of the third person singular marker and the root meaning ‘self' or alternatively come from the free third person pronoun. Both hypotheses are compatible with our understanding of Rgyalrong historical phonology

2D multi-objective placement algorithm for free-form components

This article presents a generic method to solve 2D multi-objective placement problem for free-form components. The proposed method is a relaxed placement technique combined with an hybrid algorithm based on a genetic algorithm and a separation algorithm. The genetic algorithm is used as a global optimizer and is in charge of efficiently exploring the search space. The separation algorithm is used to legalize solutions proposed by the global optimizer, so that placement constraints are satisfied. A test case illustrates the application of the proposed method. Extensions for solving the 3D problem are given at the end of the article.Comment: ASME 2009 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, San Diego : United States (2009