Search

The article presents information about unicode, which are known to be the universal character set. Computers have become an indispensable part of one's life. Until recently, the outdated key character set standard, ASCII was in use. This character set has numerous limitations such as because of its constraint to include only seven of the eight bits in the byte, there is no room in ASCII to expand beyond the characters needed for the English language. Thus, in order to respond to the needs of international customer base, unicode character set is developed. The universal character set has numerous advantage because of the large number of characters that these languages share due to their common origins. These codes have found out a new way to encode languages for computer manipulation. These encoding allows over one million characters to be defined. Such codes covers not only currently used languages but also ancient languages that are studied by historians and scholars. These single character set have many advantages for all languages are particularly evident in libraries where works occur in different scripts.

This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of end host multicast (EMcast) when the traffic load becomes heavy in a multigroup network with real-time flows constrained by (σ, ρ) regulators. The control algorithm is implemented at the overlay networks and provides more regulations through a novel (σ, ρ, λ) regulator at each group end host who suffers from heavy input traffic. To our knowledge, it is the first work to incorporate traffic regulators into the end host multicast to control heavy traffic output. Our further contributions include a theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold ρ* such that for a given set of K groups, when the average rate of traffic entering the group end hosts ρ¯ > ρ*, the ratio of the worst-case multicast delay bound of the proposed (σ, ρ, λ) regulator over the traditional (σ, ρ) regulator is O((Multiple line equation(s) cannot be represented in ASCII text)) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations. [ABSTRACT FROM AUTHOR]

In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with |y| ≥ 4 nor cubes xxx. We show that 'cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where '4' is replaced by any integer. This results in an interesting and subtle hierarchy. [ABSTRACT FROM AUTHOR]