Graphic hybridization of modern French vocabulary

The article is devoted to the analysis of American borrowings in French of the 21st century. Americanisms in French keep their graphic form and change French orthography, its principles and system. All spheres of social being are borrowing from American English. In the field of food the French vocabulary has borrowed from American English snack-bar, brunch, fast-food, pop-corn, hot-dog, cocktail, coca-cola. In some words the orthography is simple, based on phonetical principles. In the case of bar, fast, pop, corn, dog, coca, cola there is no problems to write or to read these words. But other substantives have brought specific orthograms (ck, un, op, h, ail) and modify the French graphic inventory: snack, brunch, food, hot, cocktail. The cultural sphere has received many units from American English: hip-hop, rock-and-roll, rock`n`roll, hard rock, heavy metal, jazz rock, punk rock, grunge. Some americanisms enrich French graphic with digrams ck, ea, zz, un or aphonograms (h), apostrophe (rock`n`roll) etc. Borrowed americanisms with English orthography can create homophone series in french: crack (cocaine) – crac! (crac!) – crack (crack) – crack (favorite trotter) – craque, craques, craquent (verb "to crack") – craque (fib) – krach (crash failure) – krak (castle). Barrowed orthograms complicate French graphic. They have no new phonems but add superfluous graphems in French inventory. Etymological orthograms reproduce the linguocultural traditions of language. They shape the high graphostyle of language and please young people who loves to use Anglicisms and Americanisms with authentic orthography. Graphic features of English loan-words result into hybridization of French vocabulary, complicate orthography, extend the linguocultural domain and insure the ethnosociolinguistical loyalty of both languages and cultures.

Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks

<p>A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was given by the authors in 1990.</p><p>In this paper we determine the number of rounds of communication that are required, in the worst case, by a protocol which 1-solves a given 1-solvable task T for <em>n</em> processors. We define the radius R(T) of T, and show that if R(T) is finite, then this number is Theta (log_n R(T)) ; more precisely, we give a lower bound of log_(n-1) R(T), and an upper bound of 2+|log_(n-1)R(T)| . The upper bound implies, for example, that each of the following tasks: renaming, order preserving renaming and binary monotone consensus can be solved in the presence of one fault in 3 rounds of communications. All previous protocols that 1-solved these tasks required Omega(n) rounds. The result is also generalized to tasks whose radii are not bounded, e.g., the approximate consensus and its variants.</p>