|
Jorma Rissanen
Jorma Johannes Rissanen (October 20, 1932 – May 9, 2020) was an information theorist, known for originating the minimum description length (MDL) principle and practical approaches to arithmetic coding for lossless data compression. His work inspired the development of the theory of stochastic chains with memory of variable length. Education and career Rissanen was born in Pielisjärvi (now Lieksa) in Finland and grew up in Kemi, a border town between Finland and Sweden. He moved to Helsinki and studied at the Helsinki University of Technology, where he obtained his Master’s degree in electrical engineering in 1956 and licentiate in control theory in 1960. He studied there under Olli Lokki and Hans Blomberg. Rissanen became an IBM researcher since 1960, first in Stockholm, Sweden, while still a Ph.D. student under Hans Blomberg. Most of his PhD work was done remotely as a result and he received his Ph.D. from the Helsinki University of Technology in 1965 with a topic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pielisjärvi
Pielisjärvi is a former municipality in the region of North Karelia North Karelia (or ''Northern Karelia'', ; ) is a region in eastern Finland. It borders the regions of Kainuu, North Savo, South Savo and South Karelia, as well as Russia's Republic of Karelia. It is the easternmost region of Finland and share ... in Finland. The municipality had inhabitants in 1970. Pielisjärvi was a Finnish-speaking municipality. Pielisjärvi municipality was joined with the city of Lieksa in 1973. History Pielisjärvi is named after the lake Pielinen, sometimes also called ''Pielisjärvi''. The area of modern North Karelia was ceded by Russia to Sweden in 1617 in the Treaty of Stolbovo, becoming part of the Kexholm County in 1634. Pielisjärvi was first mentioned in 1618 as ''Pelis Järffwi Pogost''. Pielisjärvi was originally a part of the Liperi parish, being separated in 1639. At the time, Pielisjärvi also included Juuka, Nurmes and Valtimo. Nurmes, including Valti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kemi
Kemi (; ; ; ) is a cities of Finland, town and municipalities of Finland, municipality of Finland. It is located approximately from the city of Tornio and the Finland–Sweden border, Swedish border. The distance to Oulu is to the south and to Rovaniemi is to the northeast. It was founded in 1869 by a decree of the Emperor of Russia, Emperor Alexander II of Russia because of its proximity to a deepwater port. The town has a population of () and covers an area of of which are water. The population density is . According to current statistics, Kemi has the highest number of Drug-related crime, drug crimes than any other town in Finland. This is thought to be due to its proximity to the Swedish border and the Illegal drug trade, drug smuggling that occurs across it. History World War II hostage crisis During World War II, after Finland signed the Moscow Armistice and found itself involved in the Lapland War against its former German ally, German forces at the beginning of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IEEE
The Institute of Electrical and Electronics Engineers (IEEE) is an American 501(c)(3) organization, 501(c)(3) public charity professional organization for electrical engineering, electronics engineering, and other related disciplines. The IEEE has a corporate office in New York City and an operations center in Piscataway, New Jersey. The IEEE was formed in 1963 as an amalgamation of the American Institute of Electrical Engineers and the Institute of Radio Engineers. History The IEEE traces its founding to 1884 and the American Institute of Electrical Engineers. In 1912, the rival Institute of Radio Engineers was formed. Although the AIEE was initially larger, the IRE attracted more students and was larger by the mid-1950s. The AIEE and IRE merged in 1963. The IEEE is headquartered in New York City, but most business is done at the IEEE Operations Center in Piscataway, New Jersey, opened in 1975. The Australian Section of the IEEE existed between 1972 and 1985, after which it s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Helsinki Institute For Information Technology
Helsinki Institute for Information Technology HIIT (, ) is a joint research unit of two leading research university, universities in Helsinki, Finland, the University of Helsinki (UH) and Aalto University. Established in 1999, the work of the institute is organised in four research programmes working on Computational Inference, Computational Health, Information Security and Augmented Research. Much of the work is carried out in competitively funded projects in co-operation with Finland, Finnish and international partners. The institute is led by Petri Myllymäki from University of Helsinki, who was selected to continue the work of Martti Mäntylä from Aalto University, Esko Ukkonen from University of Helsinki, Heikki Mannila Aalto University, from Aalto University, and Samuel Kaski from Aalto University. HIIT has about 200 researchers. References External linksHIIT website {{authority control Research institutes in Finland Buildings and structures in Helsinki Universi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Emeritus
''Emeritus/Emerita'' () is an honorary title granted to someone who retires from a position of distinction, most commonly an academic faculty position, but is allowed to continue using the previous title, as in "professor emeritus". In some cases, the term is conferred automatically upon all persons who retire at a given rank, but in others, it remains a mark of distinguished performance (usually in the area of research) awarded selectively on retirement. It is also used when a person of distinction in a profession retires or hands over the position, enabling their former rank to be retained in their title. The term ''emeritus'' does not necessarily signify that a person has relinquished all the duties of their former position, and they may continue to exercise some of them. In descriptions of deceased professors emeriti listed at U.S. universities, the title ''emeritus'' is replaced by an indication of the years of their appointments, except in obituaries, where it may be us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Coding (data Compression)
In data compression, a universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional property that whatever the true probability distribution on integers, as long as the distribution is monotonic (i.e., ''p''(''i'') ≥ ''p''(''i'' + 1) for all positive ''i''), the expected lengths of the codewords are within a constant factor of the expected lengths that the optimal code for that probability distribution would have assigned. A universal code is ''asymptotically optimal'' if the ratio between actual and optimal expected lengths is bounded by a function of the information entropy of the code that, in addition to being bounded, approaches 1 as entropy approaches infinity. In general, most prefix codes for integers assign longer codewords to larger integers. Such a code can be used to efficiently communicate a message drawn from a set of possible messages, by simply ordering the set of messages ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Complexity
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory. The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem. In particular, no program ''P'' computing a lower bound for each text's Kolmogorov complexity can return a value essentially larger than ''P'''s own leng ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Per Martin-Löf
Per Erik Rutger Martin-Löf (; ; born 8 May 1942) is a Sweden, Swedish logician, philosopher, and mathematical statistics, mathematical statistician. He is internationally renowned for his work on the foundations of probability, statistics, mathematical logic, and computer science. Since the late 1970s, Martin-Löf's publications have been mainly in logic. In philosophical logic, Martin-Löf has wrestled with the philosophy of logical consequence and Edmund Husserl#Philosophy of logic and mathematics, judgment, partly inspired by the work of Franz Brentano, Brentano, Gottlob Frege, Frege, and Edmund Husserl, Husserl. In mathematical logic, Martin-Löf has been active in developing intuitionistic type theory as a constructive foundation of mathematics; Martin-Löf's work on type theory has influenced computer science. Until his retirement in 2009, Per Martin-Löf held a joint chair for Mathematics and Philosophy at Stockholm University. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrey Kolmogorov
Andrey Nikolaevich Kolmogorov ( rus, Андре́й Никола́евич Колмого́ров, p=ɐnˈdrʲej nʲɪkɐˈlajɪvʲɪtɕ kəlmɐˈɡorəf, a=Ru-Andrey Nikolaevich Kolmogorov.ogg, 25 April 1903 – 20 October 1987) was a Soviet mathematician who played a central role in the creation of modern probability theory. He also contributed to the mathematics of topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and Analysis of algorithms, computational complexity. Biography Early life Andrey Kolmogorov was born in Tambov, about 500 kilometers southeast of Moscow, in 1903. His unmarried mother, Maria Yakovlevna Kolmogorova, died giving birth to him. Andrey was raised by two of his aunts in Tunoshna (near Yaroslavl) at the estate of his grandfather, a well-to-do Russian nobility, nobleman. Little is known about Andrey's father. He was supposedly named Nikolai Matveyevich Katayev and had been an Agronomy, agronomist. Katayev ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithmic Randomness
Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-free or not) universal Turing machine. The notion can be applied analogously to sequences on any finite alphabet (e.g. decimal digits). Random sequences are key objects of study in algorithmic information theory. In measure-theoretic probability theory, introduced by Andrey Kolmogorov in 1933, there is ''no such thing'' as a random sequence. For example, consider flipping a fair coin infinitely many times. Any particular sequence, be it 0000\dots or 011010\dots, has equal probability of exactly zero. There is no way to state that one sequence is "more random" than another sequence, using the language of measure-theoretic probability. However, it is intuitively obvious that 011010\dots looks more random than 0000\dots. Algorithmic randomness theory formalizes this intuition. As different types of algorithms are sometimes co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
San Jose, California
San Jose, officially the City of San José ( ; ), is a cultural, commercial, and political center within Silicon Valley and the San Francisco Bay Area. With a city population of 997,368 and a metropolitan area population of 1.95 million, it is the most populous city in both the Bay Area and Northern California and the List of United States cities by population, 12th-most populous in the United States. Located in the center of the Santa Clara Valley on the southern shore of San Francisco Bay, San Jose covers an area of and is the county seat, seat of Santa Clara County, California, Santa Clara County. Before the Spanish colonization of the Americas, arrival of the Spanish, the area around San Jose was long inhabited by the Tamyen people, Tamien nation of the Ohlone people San Jose was founded on November 29, 1777, as the ''Pueblo de San José de Our Lady of Guadalupe, Guadalupe'', the first city founded in the Californias. It became a part of Mexico in 1821 after the Mexican Wa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adaptive Control Theory
Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain. For example, as an aircraft flies, its mass will slowly decrease as a result of fuel consumption; a control law is needed that adapts itself to such changing conditions. Adaptive control is different from robust control in that it does not need ''a priori'' information about the bounds on these uncertain or time-varying parameters; robust control guarantees that if the changes are within given bounds the control law need not be changed, while adaptive control is concerned with control law changing itself. Parameter estimation The foundation of adaptive control is parameter estimation, which is a branch of system identification. Common methods of estimation include recursive least squares and gradient descent. Both of these methods provide update laws that are used to modify estimates in real-time (i.e., as the system operates). L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
