Since the initial version of the IEEE 802.11 standard in 1997, wireless LAN technology has seen great deal of advancement and excitement in the key areas of higher throughput, increased range, and enhanced robustness and reliability. This is enabling higher quality of viewing experience and for multimedia in homes and an increase in efficiency and team collaboration in enterprises.

Even after going through a successful adoption and deployment of four generations of WLAN technology, there is still much to be excited about in wireless networks. The fifth WLAN generation offering of gigabit throughput is closing on the performance gap between the wired and wireless environments promising the “freedom of wires” for homes and enterprises.

This remarkable advancement is achieved through the use of various advanced signal processing techniques such as: spatial division multiplexing (SDM), space-time block coding (STBC), diversity techniques and transmitter beam-forming (TxBF). In addition, there are provisions for advanced coding such as low-density parity check (LDPC), various MAC efficiency measures, and enhanced channelization techniques for a practical deployment of an ultra-reliable Wi-Fi solution in a home or an enterprise.

A new age of handheld mobile devices and multimedia applications, such as HD video streaming to high resolution devices, is driving the need for new class of reliable Wi-Fi to meet the ever increasing stringent requirements of the media-intensive applications. Innovations in the WLAN technology is making the “All-wireless Home and Enterprise” become a reality.

Such innovations of new generation of multimedia-grade full-11n / 11ac chipsets incorporate the unique combination of smart 4x4 MIMO processing and dynamic TxBF that will enable multiple concurrent full HD 1080presolution for the best possible quality of viewing experience with an unmatched throughput, a greater coverage and a superior reliability. It is because of such innovations, the WLAN challenges are turning into the viewing opportunities that were never experienced before in residential applications.

Suppose we have a sentence in some natural language. What knowledge and skills are needed in order to understand its meaning? First of all, we obviously should know the meanings of all the words of this sentence and the way these words are connected. This type of knowledge is provided by the explanatory dictionary of the given language and its grammar. However this is far from being sufficient. Another important task is combining the meanings of individual words into a whole, which is called "semantic structure of the sentence".

The major tool for combining meanings into a larger whole is the mechanism of valency filling. We will illustrate this mechanism with examples of varying complexity. Special consideration will be given to the words whose meaning is akin to the meaning of logical quantifiers.

The talk is devoted to infinite-dimensional dynamical systems arising in representation theory. For example, consider the space of infinite matrices with complex entries, the projective limit of usual finite-dimensional matrix spaces. The infinite unitary group, the inductive limit of finite-dimensional unitary groups, naturally acts on our space of infinite matrices both on the left and on the right. Ergodic probability measures of the resulting action of the Cartesian square of the infinite unitary group form an infinite-dimensional family that admits an explicit classification due to Pickrell and to which a different approach has been proposed by Olshanski and Vershik.
The main result of the talk is that, under some natural assumptions, there are no infinite ergodic measures: every ergodic measure admitting well-defined projections on corners of finite size must itself be finite. This finiteness result is then applied to the problem of ergodic decomposition of unitarily-invariant measures on spaces of infinite matrices. The talk is based on the preprints arXiv:1105.0664 and arXiv:1108.2737.

Methods of establishing existence of stationary distribution for general (homogeneous) Markov processes will be presented. This theory will be applied to Erlang-Sevastyanov's problem with infinite number of servers.

We consider a Markov process that models a market performance. It is assumed that the number of participants is large. That permits to reduced the problem to investigation of a system of ordinary differential equation and describe the evolution of the model.

A brief introduction to main terms, notions and facts one needs to undestand bioinformatics posters and lectures at ITaS :-)

High-throughput sequencing allows one to address many classical problems of evolutionary biology in a new way. The rate of adaptive evolution in normal conditions may be determined by studying traces of fast allele replacement in hypervariable populations. If a population adapts to new conditions in a short time, the comparison of its genomes with the genomes of the ancestral population allow one to find targets of positive selection. The mode of reproduction of microscopic organisms such as bdelloid rotifers may be determined by studying associations between alleles of different loci. Genetic foundations of sympatric speciation may be determined by the comparison of genomes of closely related species.

How to place the maximum number of rooks on an n-dimensional chess board (with sides q) in such a way that no one field is beaten twice? Somehow, the answer is known for the case where q is a prime number or its degree, and almost nothing is known in other cases. This question is, in fact, a question about q-ary single error-correcting codes. There will be given some other interesting examples of open mathematical problems, seemingly unrelated to the correction of errors.

Informal introduction to applied coding theory is given. Qualitative aspects of coders and decoders construction for data transmission, storage and processing are discussed.

New words and new meanings of old words are often considered as corruption of language. However, if a new word not simply appeared, but had become fixed and actively used, it means that the language has needed it, having a free slot. Newly arising meanings require new words. Studying language changes, we clearly see changes in our understanding and representation of the world. The sources of new words are diverse, and the language laboratory may be different in different times.

All diurnal animals possess color vision - the ability to distinguish radiations by their spectral composition, regardless of their intensity. Color vision requires both several classes of photopigments, each segregated in a separate class of cones, and an elaborate system of visual processing in the brain comparing signals of different color channels. The dimension of color vision is determined by the number of the chromatic classes of cones. Vast majority of mammals are dichromates. Only primates are trichromates among mammals. The visual worlds of most primates are rich with potential color signals, and many representatives of the order have evolved the biological mechanisms that allow them to exploit these sources of information. Colour vision systems of the Old Wold Primates and the New Wold Primates differ from each other. The genes that encode different cone visual pigments of the Old Wold monkeys are located on the chromosome 7 (pigment of "blue" cones) and in tandem on the q-arm of the X-chromosome (pigments of "green" and "red" cones). In the New Wold monkeys, besides "blue" gene on the chromosome 7, there is only one polymorphic gene (which has three alleles) on the X-chromosome. Thus all males and homozigous females of the New Wold monkeys are polymorphic dichromates. And only heterozygous females are trichromates. In 2007, gene of human red sensitive photopigment was introduced in subretinal space of two adult saimiri-males (a the New Wold specie). After 20 weeks these dichromatic males became trichromates. According to psychophysical tests, their trichromacy retains up today. This means that the brain of an adult monkey is able to use the newly acquired information from the new chromatic type of cones.

The lion's share of bacteria in various environments cannot be cloned in the laboratory and thus cannot be sequenced using existing technologies. A major goal of single-cell genomics is to complement gene-centric metagenomic data with whole-genome assemblies of uncultivated organisms. Assembly of single-cell data is challenging because of highly non-uniform read coverage as well as elevated levels of sequencing errors and chimeric reads. We describe SPAdes, a new assembler for both single-cell and standard (multicell) assembly, and demonstrate that it improves on the recently released single cell assemblers (specialized for single-cell data) and on popular assemblers for multicell data. SPAdes generates single-cell assemblies, providing information about genomes of uncultivatable bacteria that vastly exceeds what may be obtained via traditional metagenomics studies. We describe applications of SPAdes to sequencing bacterial pathogen in a hospital environment and to assembling "dark matter of life" from TM6 candidate division.
This is a joint work with Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey Gurevich, Mikhail Dvorkin, Alexander Kulikov, Valery Lesin, Sergey Nikolenko, Son Pham, Andrey Prjibelski, Alexey Pyshkin, Alexander Sirotkin, Nikolay Vyahhi, Glenn Tesler, and Max Alekseyev.

We study the sequences of Markov semigroups defining the evolution of general symmetric communication networks with number of nodes tending to infinity. These sequences have limits, - nonlinear Markov processes. Some important properties of these nonlinear Markov Processes, living on infinite graphs, are simplier and easier to analyze than the same properies for corresponding Markov processes on finite graphs. These facts give the possibility to find good approximation for some characteristics of symmetric networks with increasing number of nodes. Corresponding examples will be discussed. This talk is based on common work with S.Shlosman.

Moebius function is one of the basic functions in number theory.It has peculiar statistical properties which follow from its intrinsic structure.The analysis of this structure is intresting from different points of view.In particular it leads to probabilistic problems in which probabilities take values of different signs and to some new limit distributions.All these questions will be discussed in my talk.

The paper addresses some problems of modern communication networks: broadcasting, intrusion detection, survivability estimation, scheduling in wireless networks and others. Networks are modeled by graphs, hypergraphs and hypernets. Author discusses possibilities of using these models to investigate different network problems: hypernet adequately describes the hierarchy of modern networks, hypergraph is convenient with interference consideration, and graph theory provides many well-known algorithms useful in routing, message broadcasting, etc. Author gives some results of exploiting graph theory methods to investigate and solve various network problems, based on her previously published papers, as well as on the related papers of other authors.

We consider some methods of modern statistics

In 1919 in order to construct the foundations of probability theory von Mises introduced the notion of "collective" of sequences (composed of zeros and ones), which should be considered as random. His idea consists in that the law of large numbers should be fulfilled for such "random" sequences as well as for their subsequences, obtained using "special selection rules". Unfortunately, von Mises did not specify precisely the notion of "special selection rules". However, the question, raised by von Mises, of what should be considered as "random" sequence, led to different notions of "randomness" including the notion of Kolmogorov complexity. So, general picture of different approaches to the notion of randomness will be considered in the talk.

Yes, one can! Provided there is an interaction between the memory elements. This interaction can be arranged in such a way that the reliability of the resulting memory will increase with its size. In the case of infinite number of the memory elements the resulting memory becomes completely reliable. The phenomenon of appearance of memory in the system with randomness is called the Phase Transition. My talk will be an introduction to the Phase Transition theory.

Vision supplies animals with vital information about structure and color of surrounding objects. Here we review a mechanisms that allow vertebrate photoreceptors to operate within a wide range of light intensities without saturation.