The Great Russian Encyclopedia ( GRE ; Russian : Большая российская энциклопедия , БРЭ, transliterated as Bolshaya rossiyskaya entsiklopediya or academically as Bol'šaja rossijskaja ènciklopedija ) is a universal Russian encyclopedia , completed in 36 volumes, published between 2004 and 2017 by Great Russian Encyclopedia, JSC ( Russian : Большая российская энциклопедия ПАО , transliterated as Bolshaya rossiyskaya entsiklopediya PAO ). A successor to the Great Soviet Encyclopedia , it was released under the auspices of the Russian Academy of Sciences (RAS) after President Vladimir Putin signed a presidential decree №1156 in 2002. The complete edition was released by 2017.
27-468: The chief editor of the encyclopedia was Yury Osipov , the president of the RAS. The editorial board had more than 80 RAS members. The first, introductory volume, released in 2004, was dedicated to Russia . Thirty-five volumes were released between 2005 and 2017, covering the range from "A" to " Яя " ( Yaya ). The RAS plans to publish an updated version every five years, although it may not be issued in print after
54-428: A broad range of ill-defined problems. The structures of Zhuravlev’s algebraic approach were justified based on the compactness hypothesis and the hypothesis of a probabilistic nature of the subject area. These works, like his earlier studies on ECA, inspired a continuing stream of research that solidified Zhuravlev’s school’s global leadership in mathematical recognition methods. In addition to his work in recognition, in
81-686: A member of the Executive Committee of the International Association for Pattern Recognition (IAPR); since 1990, a member of the Bureau of the Department of Informatics, Computer Engineering, and Automation of the RAN; and since 1991, Editor-in-Chief of the international journal “Pattern Recognition and Image Analysis.” In 1997, he founded and headed the Department of Mathematical Forecasting Methods at
108-562: A research problem that had led to an entire research direction. The major result of this period was the general theory of local algorithms, which combined topological principles and algorithm theory. This theory formed the basis of his Doctor of Science dissertation, which Zhuravlev defended in 1965 in one of the first defenses in the field of “Mathematical Cybernetics.” His opponents included cybernetics experts Academician V.M. Glushkov and Corresponding Members A.A. Lyapunov and O.B. Lupanov, as well as algebraist Professor A.D. Taimanov, who conducted
135-729: A rigorous review of the technically challenging studies on majority properties. For his achievements, Zhuravlev, together with O.B. Lupanov and Corresponding Member of the USSR Academy of Sciences S.V. Yablonsky, was awarded the Lenin Prize in Science and Technology in 1966. From 1966, Zhuravlev embarked on a new research direction: solving classification or pattern recognition problems. The first such task, solved in collaboration with geophysicists F.P. Krendelev and A.N. Dmitriev, involved analyzing information on gold deposits. The successful application of
162-579: A series of papers on the now-famous algebraic approach to the synthesis of correct algorithms, establishing the modern framework for recognition and many related fields of applied mathematics and computer science. The core idea of the algebraic approach, derived from Galois extension theory, involved using algebraic closures of initially heuristic models, i.e., parametric families of algorithms, to synthesize high-quality algorithms. In this period’s works, Zhuravlev and his students demonstrated that even explicit constructions of high-quality algorithms are possible for
189-409: A test algorithm for this task led to an entire direction in pattern recognition based on discrete analysis methods. Yuriy Ivanovich introduced and researched the now-classic model of estimation computation algorithms (ECA), unifying most of the known recognition principles and procedures at that time. Hundreds of scientific papers have since studied ECA, many authored by Zhuravlev’s students. Today, ECA
216-611: Is a highly versatile language for describing recognition procedures, widely applied to solve practical tasks and inspiring new theoretical research. In 1969, Zhuravlev joined the USSR Academy of Sciences’ Computing Center (now the Computing Center of the Russian Academy of Sciences), where he led the Laboratory of Recognition Problems, later transformed into the Department of Recognition Problems and Combinatorial Analysis Methods and
243-541: The Encyclopædia Britannica and the Brockhaus Enzyklopädie . Critics complain that many of the biographies, historical entries, and cultural articles are narrow and biased: according to writer and literary critic Nikolai Podosokorsky [ ru ] , several of the articles are "quite superficial" and "the lists of references at the end were often extremely biased". While admitting that some of
270-615: The Russian Academy of Sciences from 17 December 1991 to 29 May 2013. Osipov was born in Tobolsk . In 1959 he graduated from the Department of Mechanics and Mathematics of the Ural State University . His teacher was Nikolay Krasovsky , scientist and founder of the Ural scientific school in mathematical theory of control and the theory of differential games . From 1961 to 1969 he worked at
297-401: The 1980s, Zhuravlev (together with A.Yu. Kogan) achieved significant results in solving “canonically hard” problems in discrete mathematics, again reinforcing his view on complexity: even if “almost all” problems in a certain class are practically unsolvable, specific real-life problems from this class may still be solvable effectively. In 1984, Zhuravlev was elected as a Corresponding Member of
SECTION 10
#1732848127939324-672: The Academy of Sciences of the Soviet Union (Division of Machine Engineering, Mechanics and Control Processes Problems). He has been the President of the Academy of Sciences of the Soviet Union and its successor, the Russian Academy of Sciences , since 1991, having been reelected in 1996, 2001 and 2006. He is also involved in the Russian government, specifically as a member of the Security Council of
351-761: The Department of Computational Forecasting Methods. Zhuravlev continues to lead the Department of Recognition Problems today, also serving as Deputy Director of the Computing Center for Research. Since 1970, he has worked as a professor at the Moscow Institute of Physics and Technology (MIPT). Under Yuriy Ivanovich’s guidance, students and colleagues have solved numerous applied problems in fields such as medicine, geology, social and economic forecasting, creating software systems for decision support, recognition, classification, and prediction. These applied works are grounded in deep fundamental research in both recognition and discrete analysis. From 1976 to 1978, Zhuravlev published
378-951: The Faculty of Computational Mathematics and Cybernetics of Moscow State University. In 1998, he became the Chairman of the Scientific Council on the Complex Problem of “Cybernetics” at the Presidium of the RAN. Since his presentation at the IFIP World Congress in New York in 1965, Yuriy Ivanovich has regularly given lectures abroad, including courses in universities in the USA, France, Finland, Sweden, Austria, Poland, Bulgaria, East Germany, and others. This international engagement significantly contributed to
405-596: The Russian Federation . Since 1993 Osipov has also served as the director of the V. A. Steklov Mathematical Institute in Moscow . He holds a concurrent appointment as a professor of the Moscow State University . Yuri Zhuravlyov (mathematician) Yuri Ivanovich Zhuravlyov ( Russian : Юрий Иванович Журавлёв ; 14 January 1935 – 14 January 2022) was a Soviet and Russian mathematician specializing in
432-460: The Siberian Branch of the USSR Academy of Sciences, created by Yuriy Ivanovich, significant work was carried out on operations research, simulation modeling, nonlinear programming, and applied research. During this period, he achieved several notable results, including the construction of an example of a Boolean function with a “pathologically large” number of dead-end DNFs, fundamentally solving
459-566: The USSR Academy of Sciences and, in 1992, as an Academician of the Russian Academy of Sciences (RAN). In 1992, he also became an Academician of the Russian Academy of Natural Sciences. In 1989, he and several of his students received the USSR Council of Ministers Prize for a series of applied works. An outstanding mathematician and author of numerous scientific directions and results, Yuriy Ivanovich also devoted considerable time and effort to scientific and organizational work. Since 1989, he has been
486-766: The Ural State University. From 1970 to 1993 he worked at the Institute of Mathematics and Mechanics of the Ural Branch of the Academy of Sciences of the Soviet Union (later, of the Russian Academy of Sciences) in Yekaterinburg (from 1986 to 1993 he was the chief of the Institute). In 1971 he defended his second thesis and received the rank of professor in 1973. In 1984 he was elected corresponding member and in 1987, full member of
513-469: The algebraic theory of algorithms. His research in applied mathematics and computer science was foundational for a number of specialties within discrete mathematics, pattern recognition, and predictive analysis. Zhuravlyov was a full member of the Russian Academy of Sciences and the chairman of its "Applied Mathematics and Informatics" section. He was also the editor-in-chief of the international journal Pattern Recognition and Image Analysis . Zhuravlyov
540-412: The articles in the encyclopedia were "excellent", Podosokorsky still stated that he maintained a generally negative view of the project. Yury Osipov Yury Sergeyevich Osipov ( Russian : Ю́рий Серге́евич О́сипов ; born 7 July 1936) is a Soviet and Russian mathematician. He was elected a full member of the Academy of Sciences of the Soviet Union in 1987 and was a president of its successor,
567-3946: The first edition. On 17 June 2024 the project was suspended due to discontinued funding from the Russian government. Yury Osipov , a mathematician , President of RAS (1991-2013), is the GRE Editor in Chief and Chairman of the Scientific Editorial Board. Managing editor is Sergey Kravets [ ru ] , journalist , editor and cultural figure. Also in the scientific editorial board are or were: Sergey S. Averintsev , Eugene N. Avrorin , Sergei I. Adian , Yuri P. Altukhov [ ru ] , Zhores I. Alferov , Boris V. Anan'ich [ ru ] , Alexander F. Andreev , Leo N. Andreev [ ru ] , Dmitry V. Anosov , Vladimir I. Arnold , Sergey N. Bagaev [ ru ] , Nikolai Bahvalov , Oleg A. Bogatikov [ ru ] , Alexander A. Boyarchuk , Evgeny Velikhov , Vladimir A. Vinogradov [ ru ] , Andrei I. Vorobyov [ ru ] , Eric M. Galimov , Andrey V. Gaponov-Grekhov [ ru ] , Mikhail L. Gasparov , Vitaly L. Ginzburg , Georgy S. Golitsyn , Andrei A. Gonchar [ ru ] , Anatoly I. Grigoriev [ ru ] , Abdusalam A. Guseinov [ ru ] , Mikhail I. Davydov [ ru ] , Anatoly P. Derevyanko [ ru ] , Nikolai L. Dobretsov [ ru ] , Yuri I. Zhuravlev , Nicholas S. Zefirov [ ru ] , Yuri A. Zolotov [ ru ] , Viktor P. Ivannikov , Vadim T. Ivanov [ ru ] , Sergei G. Inge-Vechtomov [ ru ] , Alexander S. Isaev [ ru ] , Victor A. Kabanov [ ru ] , Eugene N. Kablov [ ru ] , Sergei P. Karpov , Lev L. Kiselev [ ru ] , Alex E. Kontorovich [ ru ] , Vladimir M. Kotlyakov [ ru ] , Oleg N. Krokhin [ ru ] , Edward P. Kruglyakov [ ru ] , Alexander B. Kudelin [ ru ] , Oleg Y. Kutafin [ ru ] , Nikolai P. Laverov [ ru ] , Viktor P. Legostaev [ ru ] , Nikolai P. Liakishev [ ru ] , Valery L. Makarov [ ru ] , Alexander M. Matveenko [ ru ] , Gennady A. Mesyats , Alexander D. Nekipelov [ ru ] , Alexei V. Nikolaev [ ru ] , Sergey P. Novikov , Yuri S. Osipov , Dmitry S. Pavlov [ ru ] , Alexey N. Parshin [ ru ] , Nikolai A. Plate [ ru ] , Nikolai N. Ponomarev-Steppe [ ru ] , Yuri V. Prokhorov , Alexei Y. Rozanov [ ru ] , Valery A. Rubakov [ ru ] , Alexander Y. Rumyantsev , Dmitry V. Rundkvist [ ru ] , Gennady I. Savin [ ru ] , Victor A. Sadovnichii , Alexander N. Skrinsky [ ru ] , Alexander S. Spirin , Yuri S. Stepanov , Vyacheslav S. Stepin , Michael L. Titarenko , Valery A. Tishkov , Yuri D. Tretyakov , Kliment N. Trubetskoy , Oleg H. Favorsky , Ludvig D. Faddeev , Vladimir Ye. Fortov , Konstantin V. Frolov , Yuri I. Chernov , Gorimir G. Chernii , Alexander O. Chubarian , Vitaly D. Shafranov , Sergey V. Shestakov , Dmitry V. Shirkov . Boris A. Babayan , Vladimir I. Vasiliev , Piama P. Gaidenko , Rudolf V. Kamelin , Michael V. Kovalchuk , Nikolai I. Lapin , Sergey S. Lappo , Alexey V. Yablokov . Vladimir I. Fisinin . Dmitry O. Shvidkovskiy . Alexei D. Bogaturov , Sergey V. Chemezov , Vladimir V. Grigoriev, Alexei I. Komech , Vladimir A. Mau , D. L. Orlov. Publication schedule and contents of volumes: In 2022, an electronic version, Great Russian Encyclopedia (portal) [ ru ]
SECTION 20
#1732848127939594-542: The guidance of Alexey Andreevich Lyapunov, Yuriy Ivanovich completed his first serious scientific work on minimizing partially defined Boolean functions. This work was published in the “Proceedings of the MIAN,” and in 1955, it won first prize in the All-Union Student Research Competition. His diploma work involved solving the problem of finding words in a finite set while considering the unique structure of
621-550: The newly established Akademgorodok in Novosibirsk, where he began his scientific career as a junior researcher, becoming head of a department in 1961 and deputy director for research at the Institute of Mathematics in 1966. He also taught in the Department of Algebra and Mathematical Logic at Novosibirsk University, chaired by Academician A.I. Malcev. In the Computing Theory Department of the Institute of Mathematics at
648-449: The problem of locality in discrete tasks, he introduced a topological concept of “neighborhood” in Boolean function minimization, leading to several classical results, including a theorem on the local undecidability of constructing a minimal disjunctive normal form (DNF). These results formed the basis of his Ph.D. dissertation, which he defended at the end of 1959. In 1959, Zhuravlev moved to
675-423: The set. After defending his thesis in 1957, he entered graduate school at Moscow State University, where he worked with A.A. Lyapunov in the department led by Academician Sergey Lvovich Sobolev. Working on a practical problem of testing a wide class of technical devices, Zhuravlev developed a special mathematical approach that later inspired numerous studies by both Soviet and international scientists. While studying
702-630: Was born on 14 January 1935 in Voronezh in the former Soviet Union . In 1952, after finishing high school, he applied and was accepted into the Mathematics Department at Moscow State University . Under the direction of Alexey Lyapunov , he completed his first serious work on the minimization of partially defined boolean functions . The work was published in 1955 and awarded first prize at the All-Soviet student research competition. In 1953, under
729-504: Was launched at bigenc .ru , described as a Russian government alternative to Misplaced Pages . Some assumed that this will be associated with blocking Misplaced Pages or competing with it, however Russian officials disavowed this claim. While it was widely recognized that the Great Soviet Encyclopedia needed a replacement, the need for a print encyclopedia has been questioned, since many other analogues have now moved online, such as
#938061