on a beaucoup parlé du petit prince de saint-exupéry. on l’a commenté et l’a traduit. en iran, les critiques écrites sur cet ouvrage ne sont pas nombreuses, mais les paratextes du petit prince paraissent être, à ce titre, particulièrement significatifs. loin d’essayer de commenter, certains de nos écrivains ont écrit une continuation à l’histoire du petit prince. nous pouvons parler d'hypertext...

DC-SIGN CD68 cells Martin C. W. Chan, Nelson Lee, Paul K. S. Chan, Ka-Fai To, Rity Y. K. Wong, Carmen O. K. Law, Karry L. K. Ngai, Joseph J. Y. Sung Department of Microbiology, Prince of Wales Hospital, The Chinese University of Hong Kong, Hong Kong, China. Division of Infectious Diseases, Department of Medicine and Therapeutics, Prince of Wales Hospital, The Chinese University of Hong Kong, Ho...

The Correspondence model of base-reduplicant identity (McCarthy & Prince 1995, to appear) makes the prediction that any kind of segmental phonological process may result in any of these situations through ranking of phonological constraints with faithfulness constraints on the input and output and the basereduplicant relationship. Normal application arises when base-reduplicant faithfulness con...

A problem which arises in the theory of the error-driven ranking model of the acquisition of phonotactics is that the faithfulness constraints need to be promoted but should not be promoted too high. This paper motivates this technical problem and shows how to tune the promotion component of the re-ranking rule so as to keep the faithfulness constraints at bay. Sections 1-2 introduce the algori...

A frequently noted property of reduplication is that the reduplicant is generally a contiguous substring of the base (e.g. Marantz 1982; McCarthy and Prince 1986, 1995; Lamontagne 1996). For example, Lamontagne (1996) identifies [[ABC]R[ABCDE...]B] as a 'typical reduplication pattern', and [[ACD]R[ABCDE...]B] as 'atypical'. In optimality theory, this property is enforced by the "no skipping" cl...

This paper solves a pursuit–evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied ‘Cops and Robbers Game’, the prince has no knowledge of the position of the princess; he may, however, visit any single room he wishes on each day. We characterize the graphs for which the prin...

The lightweight cryptographic algorithm Prince is an intensively studied cipher in the last 3 years. In order to enhance the cryptanalysis efforts and to encourage the design of practical attacks against the algorithm, the designers organized the Prince Challenge. In this paper we introduce two integral attacks on 5-round and 6-round reduced Prince. The attacks, based on a 4.5 rounds integral d...

We investigate two attacks on the PRINCE block cipher in the most realistic scenario, when the attacker only has a minimal amount of known plaintext available. The first attack is called Accelerated Exhaustive Search, and is able to recover the key for up to the full 12-round PRINCE with a complexity slightly lower than the security claim given by the designers. The second attack is a meet-in-t...