Geometry.Net - the online learning center
Home  - Scientists - Kolmogorov Andrey
e99.com Bookstore
  
Images 
Newsgroups
Page 4     61-80 of 97    Back | 1  | 2  | 3  | 4  | 5  | Next 20
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

         Kolmogorov Andrey:     more detail
  1. Stalin Prize Winners: Andrei Sakharov, Sergei Eisenstein, Mikhail Kalashnikov, Dmitri Shostakovich, Léon Theremin, Andrey Kolmogorov
  2. Information Theorists: Claude Shannon, Gregory Chaitin, Andrey Kolmogorov, David A. Huffman, Richard Hamming, Harry Nyquist, Elwyn Berlekamp
  3. Soviet Mathematicians: Andrey Kolmogorov, Vladimir Arnold, Vladimir Steklov, Mikhail Lavrentyev, Grigori Perelman, Israel Gelfand
  4. Control Theorists: Claude Shannon, Aleksandr Lyapunov, Andrey Kolmogorov, Kevin Warwick, Norbert Wiener, List of People in Systems and Control
  5. Moscow State University Faculty: Andrey Kolmogorov, Mikhail Lomonosov, Vladimir Arnold, Pavel Samuilovich Urysohn, Lev Landau, Igor Tamm
  6. Russian Statisticians: Andrey Kolmogorov, Pafnuty Chebyshev, Ladislaus Bortkiewicz, Yuri Linnik, Oskar Anderson
  7. Moscow State University Alumni: Mikhail Gorbachev, Andrei Sakharov, C. A. R. Hoare, Anton Chekhov, Imre Lakatos, Andrey Kolmogorov
  8. Russian Mathematicians: Andrey Markov, Aleksandr Lyapunov, Andrey Kolmogorov, Vladimir Arnold, Grigory Barenblatt, Vladimir Voevodsky
  9. Probability Theorists: Blaise Pascal, Claude Shannon, Abraham de Moivre, Daniel Bernoulli, Andrey Markov, Andrey Kolmogorov, Jacob Bernoulli
  10. Kolmogorov, Heyting and Gentzen on the intuitionistic logical constants *.: An article from: Crítica by Gustavo Fernandez Diez, 2000-12-01
  11. Probability Space: Probability Theory, Randomness, Sample Space, Event, Sigma-Algebra, Measure, Probability Axioms, Andrey Kolmogorov
  12. Andrey Kolmogorov: Probability theory, Topology, Intuitionistic logic,Turbulence, Classical mechanics, Computational complexitytheory, Kolmogorov backward equation, Probability axioms

61. The Probability Web: Quotations
kolmogorov, andrey Foundations of the Theory of Probability The theory ofprobability as a mathematical discipline can and should be developed from axioms
http://www.mathcs.carleton.edu/probweb/quotes.html
Quotations If you would like to add your favorite probability quotation to this page, please e-mail me or fill in the form. Aristotle
The probable is what usually happens. Bertrand, Joseph
How dare we speak of the laws of chance? Is not chance the antithesis of all law? Boethius (ca. 480-525)
The Consolation of Philosophy
Chance, too, which seems to rush along with slack reins, is bridled and governed by law. Boole, George
An Investigation of the Law of Thought
Probability is expectation founded upon partial knowledge. A perfect acquaintance with all the circumstances affecting the occurrence of an event would change expectation into certainty, and leave neither room nor demand for a theory of probabilities. Born, Max
The conception of chance enters in the very first steps of scientific activity in virtue of the fact that no observation is absolutely correct. I think chance is a more fundamental conception that causality; for whether in a concrete case, a cause-effect relation holds or not can only be judged by applying the laws of chance to the observation. Bulwer, Lytton E.G.

62. Biographies
andrey Nikolaevich kolmogorov. kolmogorov was doubtless the most important Russianmathematician of the twentieth century. His work on dynamical systems,
http://tulsagrad.ou.edu/statistics/biographies/kolmogorov.htm
Andrey Nikolaevich Kolmogorov Kolmogorov was doubtless the most important Russian mathematician of the twentieth century. His work on dynamical systems, homology and cohomology, Markov random processes and probability place him at the front rank of mathematicians of the twentieth century. In terms of statistics and probability, Kolmogorov's monograph on probability Grundbegriffe der Wahrscheinlichkeitsrechnung provided an axiomatic foundation for the discipline on the same order as Euclid's Elements provided for geometry. This axiomatic and rigorous approach is today the foundation for the advanced study of probability and random processes. Kolmogorov began his mathematical studies at the same time as the topologist Alexandrov, the two first meeting in the summer of 1929. They began a lifelong relationship that lasted over 50 years. As young scholars, they travelled together, each working on their own mathematical problems, visiting the leading mathematicians of the day. Later they purchased a home where they lived together and hosted the leading mathematical minds of the the twentieth century. Kologmogorov said that Alexandrov's kindness was the "greatest source of my happiness" during the fifty-three years of their relationship. Since homosexuality was criminalized in the the Soviet Union, neither Kolmogorov nor Alexandrov could have openly admitted to a romantic relationship. If there were one, the KGB certainly would have known; had they been open about it they doubtless would have suffered a fate similar to that of

63. Andrey Nikolaevich Kolmogorov (1903-1987)
Translate this page andrey Nikolaevich kolmogorov (1903-1987). Date and Time July 23 (Fri) 13301500Location South 9 Building (Very new building next to South 3rd
http://www.comm.ss.titech.ac.jp/sp-lecture2.html
2nd Special lecture by Prof.Mikhail K. Tchobanou
Andrey Nikolaevich Kolmogorov (1903-1987)
Date and Time: July 23 (Fri) 13:3015:00
Location: South 9 Building (Very new building next to South 3rd Building) 6F Meeting Room (Room 605)
Abstract :
The foremost contemporary Soviet mathematician, one of the great mathematicians of this century. His many creative and fundamental contributions to a vast variety of mathematical fields are very wide-ranging. Some impressions from the time he lived and worked.
<%`%Z!
<%8$XLa$k(B
July. 20(Tue) ,2004

64. Nonlinear Filtering And Target Tracking
andrey kolmogorov, first approached the problem during World War II. Rather thancatching fly balls, kolmogorov and Wiener were trying,
http://www.usc.edu/dept/LAS/CAMS/nonlinear.htm
Nonlinear Filtering and Target Tracking Each time an outfielder tracks and catches a fly ball, he intuitively solves a problem of target tracking. That problem has stymied engineers, mathematicians, and computer scientists for years. Two great mathematicians, American, Norbert Wiener and Russian, Andrey Kolmogorov, first approached the problem during World War II. Rather than catching fly balls, Kolmogorov and Wiener were trying, in the days before computers, to develop mathematical algorithms that would help to track enemy aircraft by radar and automatically guide an anti-aircraft gun to shoot it down. The research started by Kolmogorov and Wiener has developed into a thriving area of applied mathematics known as Filtering Theory. Filtering, estimation of a signal or an image from noisy data, is the basic component of the data assimilation in target tracking. Research in nonlinear filtering performed in CAMS placed USC among the world leaders in this important field. Recently, a group of CAMS scientists, S. Lototsky, R. Mikulevicius and B. Rozovskii, have found a complete solution of "The Last Wiener Problem", development of a Wiener type optimal nonlinear filter. This theoretical breakthrough led the CAMS group to invention of a new algorithm (S ) for tracking objects with possibly nonlinear dynamics. Optimal nonlinear tracking filters are much more efficient than the standard extended Kalman filter in many practically important situations (e.g. infrared search and track, radar warning receiver, noise jammed radar, etc.)

65. BiblioDb
Translate this page andrey Nikolayevich kolmogorov. Tambov, Russia, 25 maggio 1903 / Mosca, Russia, kolmogorov è uno dei fondatori della teoria della probabilità.
http://aleasrv.cs.unitn.it/bibliodb.nsf/0/a825cd7d547c1eccc1256951002afe04?OpenD

66. Aerts, D. , Czachor, M. , And D'Hooghe, B. (2005) Towards A Quantum Evolutionary
kolmogorov, andrey N. 1950. Foundations of the theory of probability. New YorkChelsea. Google. Komatsu, Lloyd K. 1992. ``Recent views on conceptual
http://www.isrl.uiuc.edu/~amag/langev/ref/aerts05quantumEvolution.html
HOME Back to the Paper :: References Aerts, D. Czachor, M. , and D'Hooghe, B. (2005) Towards a quantum evolutionary scheme: violating Bell's inequalities in language. In N. Gontier, J. P. Van Bendegem and D. Aerts, editors, Evolutionary Epistemology, Language and Culture . Dordrecht: Springer.
References (may not be complete) [Original format] [ Sort by year Sort by author Sort by citations
Accardi , Luigi. 1984. ``The probabilistic roots of the quantum mechanical paradoxes''. In: Diner, Simon; Fargue, Daniel; Lochak, George et al. (eds), The wave-particle dualism 47-55. Dordrecht: Kluwer Academic. Google Aerts , Diederik. 1982. ``Example of a macroscopical situation that violates Bell inequalities''. Lettere al Nuovo Cimento 34: 107-111. Google Aerts , Diederik. 1986. ``A possible explanation for the probabilities of quantum mechanics''. Journal of Mathematical Physics 27: 202-210. Google Aerts , Diederik. 1995. ``Quantum structures: an attempt to explain their appearance in nature''. International Journal of Theoretical Physics 34: 1165-1186. Google Aerts , Diederik; and Aerts, Sven. 1994. ``Applications of quantum statistics in psychological studies of decision processes''. Foundations of Science 1: 85-97.

67. History Of Astronomy: Persons (K)
kolmogorov, andrey Nikolayevich (19031987). Short biography and references (MacTutorHist. Math.) Kolumbus see Columbus, Christopher (1451-1506); König,
http://www.astro.uni-bonn.de/~pbrosche/persons/pers_k.html
History of Astronomy Persons
History of Astronomy: Persons (K)
Deutsche Fassung

68. Andrey Kolmogorov Université Montpellier II
Translate this page andrey kolmogorov (1903-1987). Cette image et la biographie complète en anglaisrésident sur le site de l’université de St Andrews Écosse
http://ens.math.univ-montp2.fr/SPIP/article.php3?id_article=1392

69. Science Blog -- Physicists Reconsider The Nature Of Turbulence
Russian scientist andrey kolmogorov first proposed a theory of turbulence in the1940s that was pretty good, a theory scientists today refer to as the
http://www.scienceblog.com/community/older/1999/E/199904051.html
From: University of Notre Dame
Physicists Reconsider The Nature Of Turbulence
Modifications may be needed to current theories describing the character of turbulence with applications in understanding atmospheric airflows and weather, oceanic currents and even the fluididty of metals inside the Earth's core or of gases within the stars above suggest recent experiments by physicists at the University of Notre Dame and Tohoku University in Japan. The findings were reported in the March 25 issue of Nature. According to James A. Glazier, professor of physics at Notre Dame and principal investigator, it's important to know if turbulence is the same under all situations or whether there are changes in extreme situations. "People have been beating their heads against the concept of turbulence for some time," he says. Russian scientist Andrey Kolmogorov first proposed a theory of turbulence in the 1940s that was "pretty good," a theory scientists today refer to as the classical theory of turbulence. Up until Komogorov attempted to describe turbulence, physicists recognized four patterns of flow: still, steady convection, periodic convection, and turbulent convection. Each of these can be pictured by imagining a pan of water on a stove. When the burner is lit beneath the pan, the flow of the water will go through each of these transitions as it is heated. Among the factors that define the transitions are abrubt changes in the efficiency of heat distribution. Another defining factor is the complexity of the flow, which increases and becomes more and more disordered in each subsequent phase.

70. Theoriedag 2003 Van De NVTI De Activiteiten Van De NVTI Worden
andrey kolmogorov and John von Neumann honoring the 100th anniversary of spend most of the seminar discussing the influence of andrey kolmogorov,
http://www.siks.nl/nvti2003.txt
Theoriedag 2003 van de NVTI De activiteiten van de NVTI worden mede mogelijk gemaakt door de ondersteuning (financieel en anderszins) van de volgende instellingen: NWO/EW, CWI, de Onderzoeksscholen SIKS, IPA, OZSL, Elsevier Science B.V. Vrijdag 7 maart 2003 Vergadercentrum Hoog Brabant Radboudkwartier 23 Hoog Catharijne Utrecht Programma (samenvattingen volgen beneden) - 9.30-10.00: Ontvangst met koffie 10.00-10.10: Opening 10.10-11.00: Lezing Prof.dr. L. Fortnow (Nec Laboratories America) Titel: Church, Kolmogorov and von Neumann: Their Legacy Lives in Complexity 11.00-11.30: Koffie 11.30-12.20: Prof.dr. P. Stevenhagen (UL) Titel: Primes is in P 12.20-12.50: Presentatie Onderzoeksscholen (OZL, IPA en SIKS) 12.50-14.10: Lunch (Zie beneden voor registratie) 14.10-15.00: Lezing Prof.dr. M. Vardi (Rice University, USA) Titel: The Design of A Formal Property-Specification Language 15.00-15.20: Thee 15.20-16.10: Lezing Dr. M. de Rijke (UvA) Titel: Intelligent Information Access 16.10-16.40: Algemene ledenvergadering NVTI Samenvattingen van de lezingen Prof.dr. L. Fortnow (Nec Laboratories, USA) - Church, Kolmogorov and von Neumann: Their Legacy Lives in Complexity In the year 1903, several of the greatest early computer scientists entered our world. In this talk we look at the work of three of these giants: Alonzo Church, Andrey Kolmogorov and John von Neumann honoring the 100th anniversary of their births. We will focus on how their research has andcontinues to play a major role in the development of computational complexity and our understanding of what we can compute. Alonzo Church developed the lambda-calculus, a computation model equivalent to the Turing machine. He co-developed independently with Alan Turing what we now call the Church-Turing thesis that states that every computable is computable by a Turing machine (or the lambda-calculus). John von Neumann's work in quantum mechanics, game theory, automata theory and his development of early computers have played major roles in the development of algorithms and complexity. We will spend most of the seminar discussing the influence of Andrey Kolmogorov, whose work on algorithmic randomness has had a more direct impact on computational complexity and certainly my own research. We will give an overview of Kolmogorov complexity and several examples of computational restricted versions of this measure have helped us better understand the nature of efficient computation. Prof.dr. P. Stevenhagen (UL) Primes is in P In August 2002, the Indian computer scientists Agrawal, Kayal and Saxena proved that primality of an integer can be tested by means of a deterministic algorithm that runs in polynomial time. For several decades, this had been an outstanding problem. We discuss the importance of the result in theory and practice, and give an impression of the mathematics that goes into it. Prof.dr. M. Vardi (Rice University, USA) The Design of A Formal Property-Specification Language In recent years, the need for formal specification languages is growing rapidly as the functional validation environment in semiconductor design is changing to include more and more validation engines based on formal verification technologies. In particular, the usage of Formal Equivalence Verification and Formal Property Verification is growing, new symbolic simulation engines are introduced and hybrid environments of scalar and symbolic simulators are developed. To facilitate the use of these new-generation validation engines - properties, checkers and reference models need to be developed in a formal language. In this talk we describe the design of the ForSpec Temporal Logic (FTL), the new temporal logic of ForSpec, Intel's new formal property-specification language, which is today part of Synopsis OpenVera hardware verification language (www.open-vera.com). The key features of FTL are: it is a linear temporal logic, based on Pnueli's LTL, it enables the user to define temporal connectives over time windows, it enables the user to define regular events, which are regular sequences of Boolean events, and then relate such events via special connectives, and it contains constructs that enable the user to model multiple clock and reset signals, which is useful in the verification of globally asynchronous and locally synchronous hardware designs. The focus of the talk is on design rationale, rather than a detailed language description. Dr. M. de Rijke (UvA) - Intelligent Information Access Search is one of the core topics in theoretical computer science, and online search has become a day-to-day activity for many of us. Finding keywords in a text file is easy. Using keyword search, current retrieval systems allow users to find documents that are relevant to their information needs, but most leave it to the user to extract the useful information from those documents. This leaves the (often unwilling) user with a relatively large amount of text to consume. People have questions and they need answers, not documents. There is a need for tools that reduce the amount of text one might have to read to obtain the desired information. In this talk I review ongoing research initiatives (such as novelty detection, question answering, and XML retrieval) aimed at moving beyond traditional document retrieval, and I will try to identify theoretical issues that arise from these initiatives.

71. Systems Thinkers
andrey kolmogorov andrey kolmogorov was one of the broadest of this century smathematicians. He laid the mathematical foundations of probabilit y theory
http://mathcs.wilkes.edu/~rpryor/systhinkers.html
Systems Thinkers,
Cyberneticists , and Dealers in Uncertainty Based Information
Psalm 8
O LORD our Lord, how excellent is thy name in all the earth! who hast set thy glory above the heavens. Out of the mouth of babes and sucklings hast thou ordained strength because of thine enemies, that thou mightest still the enemy and the avenger. When I consider thy heavens, the work of thy fingers, the moon and the stars, which thou hast ordained; What is man, that thou art mindful of him? and the son of man, that thou visitest him? For thou hast made him a little lower than the angels, and hast crowned him with glory and honour. Thou madest him to have dominion over the works of thy hands; thou hast put all things under his feet: All sheep and oxen, yea, and the beasts of the field; The fowl of the air, and the fish of the sea, and whatsoever passeth through the paths of the seas. O LORD our Lord, how excellent is thy name in all the earth!
Genesis 11:6
And the LORD said, Behold, the people is one, and they have all one language; and this they begin to do: and now nothing will be restrained from them, which they have imagined to do.
[ George J. Klir ]

72. Great Thinkers And Visionaries On The Net
andrey kolmogorov andrey kolmogorov books Related web links live searchwith AltaVista usenet Albert Einstein Albert Einstein
http://www.lucifer.com/~sasha/thinkers.html
Sign up with PayPal to support this site - and get up
to $1000 that you can use to buy books by these authors!
Try the experimental new thinkers site here
Great Thinkers and Visionaries
This is a list of people whose ideas on how and where the world is - and should be - evolving, may be of interest to those who want to understand the frontier of human thought, at least according to my opinion. Originally I created it to give credit to people who influenced my ideas but as it often happens the project took a life of its own. Please enjoy these resources. It would be great if you could support this site or help me improve it . Now you can also take part in the discussions on the Visionaries mailing list or on the Delphi Thinkers Forum
I apologize if my selection of thinkers is not sufficiently balanced. In Russia , reading most of them could get me into Big Trouble. I hope to fix these gaps now - with your help.
You may also want to take part in the efforts that should lead to distribution of visionary ideas based on their merits rather then cute facade or interests of social power structures.
Quick guide to this page:
home page of a thinker Books by this thinker
Other web pages (live search) Current usenet discussions
Douglas Hofstadter
Daniel Dennett Andrey Kolmogorov Albert Einstein ... Robert A. Heinlein

73. The End Of Materialist Science
ecumenically, to the great Russian mathematician andrey kolmogorov and to kolmogorov and Chaitin identified the complexity of a string with the
http://www.rae.org/matersci.html
The End of Materialist Science Author: David Berlinski
Subject: Anti-Evolution Articles
Date:
Essays by Author

Essays by Subject

Essays by Date

Shopping Cart

December 2, 1996, Pg. 146
Simply the thing you are shall make you live. OLD SPANISH PROVERB FOR THE MOMENT, WE ARE ALL waiting for the gate of time to open. The heroic era of scientific exploration appears at an end, the large aching questions settled. An official ideology is everywhere in evidence and everywhere resisted. From the place where space and time are curved to the arena of the elementary particles, there is nothing but matter in one of its modes. Physicists are now pursuing the grand unified theory that will in one limpid gesture amalgamate the world's four far-flung forces. For all of its ambitiousness, it is hardly an inspiring view. And few have been inspired by it. "The more the universe seems comprehensible," Steven Weinberg has written sourly, "the more it seems pointless." Yet even as the system is said to be finished, with only the details to be put in place, a delicate system of subversion is at work, the very technology made possible by the sciences themselves undermining the foundations of the edifice, compromising its principles, altering its shape and the way it feels, conveying the immemorial message that the land is more fragrant than it seemed at sea. Entombed in one century certain questions sometimes arise at the threshold of another, their vitality strangely intact, rather like one of the Haitian undead, hair floating and silvered eyes flashing. Complexity, the Reverend William Paley observed in the eighteenth century, is a property of things, one as notable as their shape or mass. But complexity, he went on to observe, is also a property that requires an explanation.

74. BEYOND THE IVORY TOWER: Constructing Complexity In The Digital Age -- Mitchell 3
AN kolmogorov, N. andrey, IEEE Trans. Inform. Theory IT14, 662 (1968). GJ Chaitin,IEEE Trans. Inform. Theory IT-16, 5 (1970). GJ Chaitin, IEEE Trans.
http://www.sciencemag.org/cgi/content/full/303/5663/1472

Previous
Article Table of Contents Next ... Article Science , Vol 303, Issue 5663, 1472-1473 , 5 March 2004
Summary
of this Article PDF Version of this Article E-Letters: Submit a response to this article Download to Citation Manager Alert me when:
new articles cite this article

Search for similar articles in:
Science
Online
ISI Web of Science

PubMed
Search Medline for articles by:
Mitchell, W. J.
Search for citing articles in:
ISI Web of Science (1)
Request permission to use this article This article appears in the following Subject Collections:
Essays
Computers/Mathematics ADVERTISEMENT What's This... [DOI: 10.1126/science.1091973]
Essays on Science and Society
Also see the archival list of the Essays on Science and Society.
BEYOND THE IVORY TOWER: Constructing Complexity in the Digital Age
William J. Mitchell O ver the centuries, architects have expressed their designs as one- dimensional strings of text, two- dimensional drawings, three-dimensional scale models, andmost recentlydigital databases stored in computers. Successive advances in information technology have enabled the description and execution of increasingly ambitious projects. Today, innovative applications of computer-aided design and manufacturing technology are allowing architects to transcend long-standing limits on complexity and, thus, to respond more sensitively and effectively to varied human needs and construction contexts. The tradition of expressing designs as text strings goes back at least to the Biblical instructions to Noah to "Make thee an ark of gopher wood; rooms shalt thou make in the ark, and shalt pitch it within and without with pitch." (Genesis 6:14). It continues today in cake recipes, and in the instruction leaflets that come with unassembled products. Such text strings are typically process descriptions of designs: They explicitly specify sequences of operations that will produce desired results but may leave the details of those results implicit. The operations must be executed to see how the details work out.

75. ECCC Reports 2004
Michal Koucký What Can be Efficiently Reduced to the kolmogorovRandom Strings? TR04-054 andrey Muchnik, Alexander Shen, Nikolay Vereshchagin,
http://eccc.uni-trier.de/eccc-local/Lists/TR-2004.html
ECCC Reports 2004
ISSN 1433-8092, 11th Year
Lance Fortnow and Russell Impagliazzo and Valentine Kabanets and Christopher Umans:
On the complexity of succinct zero-sum games
Troy Lee, Dieter van Melkebeek, Harry Buhrman:
Language Compression and Pseudorandom Generators
Pascal Koiran:
Valiant's model and the cost of computing integers
Ramamohan Paturi, Pavel Pudlak:
Circuit lower bounds and linear codes
Revision available
Stasys Jukna:
On Graph Complexity
A remark on nondecidabilities of the initial value problem of ODEs
Comment and Revision available
Alan Selman, Samik Sengupta:
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy
V. Arvind and Jacobo Toran:
Martin Dyer, Alan Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs
Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant Property Testing and Distance Approximation
Christian Glasser:
Counting with Counterfree Automata
Paul Beame, Joseph Culberson, David Mitchell, Cristopher Moore:
The Resolution Complexity of Random Graph $k$-Colorability
Oded Goldreich and Dana Ron:
On Estimating the Average Degree of a Graph.

76. Internews Azerbaijan
andrey kolmogorov, a professional editor and director from Russia, hit on themain doctrines of broadcast editing from the first minutes of the seminar.
http://www.internews.az/eng/articles/newsletter/20030910.shtml
Azeri Eng Site map: About Us Events News Last Archive Production TV Shows PSAs Documentaries Training Schedule Reports Materials Initiatives GIPI Ganja Media Center Due Deligence Legislation Media Law Center Bookshelf Articles Stations Donors Contacts Jobs Links About Us Events News Production ... Links Search Using: All words Any word Exact phrase
Newsletter - September-October 2003 World Learning and Internews Unveil A Joint Anti-Corruption Campaign In The Local Media
On September 3, 2003 in cinema Azerbaijan, Internews Azerbaijan and World Learning unveiled a series of 8 public services announcements (PSAs) advocating against corruption. These PSAs were part of the 3-month USAID funded project entitled Economic Costs of Corruption.
This project was managed by World Learning and implemented with the technical assistance and production advice of Internews Azerbaijan. According to the project goals, Internews produced eight 30-second public service announcements, explaining how harmful corruption is for the economy and society at large and also organized contests among local journalists.
"USAID expects the Azeri public to become more aware of the economic costs of corruption and hope that the participating journalists will benefit from this project by developing their specialty reporting skills", said William McKinney, Country Coordinator for USAID in Azerbaijan.

77. Global-Investor Bookshop : Encyclopedia Of Statistics In Behavioral Science By B
Kendall s Coefficient of Concordance. Kendall s Tau t. Kernel Smoothing.K-Means Analysis. kolmogorov, andrey Nikolaevich. kolmogorov-Smirnov Tests.
http://books.global-investor.com/books/21626.htm?ginPtrCode=00000&identifier=

78. Newsletter
The only other mathematician in the top twenty was andrey kolmogorov with therest all physicists. Antonia WilmotSmith shared the Faculty of Science Miller
http://www-maths.mcs.st-andrews.ac.uk/newsletters/newsletter38.shtml
Home Personnel Info for prospective undergraduates Research and postgraduates ... MacTutor History of Mathematics
School of Mathematics and Statistics
MATHEMATICS AND STATISTICS Link to the last newsletter June - August 2004 WELCOME
  • We welcome Dr Ersin Ozugurlu from Turkey who has just joined the Vortex Group as a Research Fellow. Ersin will be funded by the UK EPSRC for the next 2 years and will be working on geophysical vortex interactions.
FAREWELL AND GOOD LUCK
  • Tibor Toeroek, who has been a visiting the Solar Theory Group within the framework of the PLATON Research Training Network since May 2003, has left at the end of July to take up a PostDoc position at Mullard Space Science Laboratories. During his stay in St. Andrews, Tibor did a lot of work on MHD models of solar eruptions (together with Bernhard Kliem, another visitor we had over the past months and partially with Thomas Neukirch). Tibor also finished his thesis which he has now submitted to the University of Potsdam, Germany. We wish Tibor all the best for his future (he'll actually be back for SOHO 15 !).
CONGRATULATIONS
  • Professor Richard A. Harrison, an Honorary Professor in the School of Mathematics and Statistics and a member of the Solar Theory Group, gained an MBE in the Queen's Birthday Honours for services to Solar Research. Richard is based at the Rutherford Appleton Laboratory (RAL) in Oxfordshire, and has been associated with the Solar Group in St Andrews for many years. He is the Principal Investigator for one of the instruments on the highly successful SoHO space mission.

79. Kolmogorov
Biography of andrey kolmogorov (19031987) The MacTutor History of Mathematicsarchive andrey Nikolaevich kolmogorov
http://lvov.weizmann.ac.il/Lecture-Online/Bib/Kolmogorov.html
The MacTutor History of Mathematics archive :
Andrey Nikolaevich Kolmogorov
Born: 25 April 1903 in Tambov, Tambov province, Russia
Died: 20 Oct 1987 in Moscow, Russia
Andrei Nikolaevich Kolmogorov 's parents were not married and his father took no part in his upbringing. His father Nikolai Kataev, the son of a priest, was an agriculturist who was exiled. He returned after the Revolution to head a Department in the Agricultural Ministry but died in fighting in 1919. Kolmogorov's mother also, tragically, took no part in his upbringing since she died in childbirth at Kolmogorov's birth. His mother's sister, Vera Yakovlena, brought Kolmogorov up and he always had the deepest affection for her. In fact it was chance that had Kolmogorov born in Tambov since the family had no connections with that place. Kolmogorov's mother had been on a journey from the Crimea back to her home in Tunoshna near Yaroslavl and it was in the home of his maternal grandfather in Tunoshna that Kolmogorov spent his youth. Kolmogorov's name came from his grandfather, Yakov Stepanovich Kolmogorov, and not from his own father. Yakov Stepanovich was from the nobility, a difficult status to have in Russia at this time, and there is certainly stories told that an illegal printing press was operated from his house. After Kolmogorov left school he worked for a while as a conductor on the railway. In his spare time he wrote a treatise on Newton's laws of mechanics. Then, in 1920, Kolmogorov entered Moscow State University but at this stage he was far from committed to mathematics. He studied a number of subjects, for example in addition to mathematics he studied metallurgy and Russian history. Nor should it be thought that Russian history was merely a topic to fill out his course, indeed he wrote a serious scientific thesis on the owning of property in Novgorod in the 15th and 16th centuries. There is an anecdote told by D G Kendall in [10] regarding this thesis, his teacher saying:-

80. Blog Yalding : Measure Radomness
andrey kolmogorov comes out the idea of kolmogorov complexity ( similar For any sequence X, the kolmogorov complexity is the size of the minimal
http://www.cs.ust.hk/~yalding/blog/2005/04/measure-radomness.html
@import url("http://www.blogger.com/css/blog_controls.css"); @import url("http://www.blogger.com/dyn-css/authorization.css?blogID=5239281"); @import url(http://www.blogger.com/css/navbar/main.css); @import url(http://www.blogger.com/css/navbar/4.css); BlogThis!
Blog yalding
Life is illusion
About Me
Name: Yajun Location: Hong Kong, Hong Kong SAR, China
View my complete profile
Previous Posts
  • Skyped today? Trip to »¢ÌøÏ¿ (ÔÆÄÏÀö½­) in last easter Fools' Game Gathering Nearest Lift to 4209 ... Atom Feed
    Friday, April 15, 2005
    Measure Radomness
    Ming Li gave an interesting talk today about Kolmogorov complexity. Basicly, in my mind, it is a method to measure radomness. /*as a stupid Perment Head Damaged student, do not critisize me for any misunderstanding. Comments are welcome though. */
    For example, we have a 0,1 sequence in random with length 100. If the sequence is 100 0's or 1's, we may think it is not a "random" sequence. Well, we may assume "0010100111100011..." is a "more random" sequence than 100 0's. Everyone should agree that makes some sensen, but it is actually quite hard to give a measurement on the "randomness" of the sequences.
    Pierre-Simon Laplace
    tried to measure randomness use "regular pattern". Thus if one sequence contains certain patterns, it is not "random" sequence. After the invention of computer science in last centry, Andrey Kolmogorov comes out the idea of Kolmogorov complexity ( similar idea was also discovered by other two scientists, who I can not figure out the names now. ). For any sequence X, the Kolmogorov complexity is the size of the minimal reprensentation of this sequence. (The formal definition uses the notion of Universal Turing Machine, which is too technical for me to describe). For 100 0's, we can just use "100", "0" and reconstruct it, which means "100" "0" contain all the information of the sequence 100 0's. Thus it is not random.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

Page 4     61-80 of 97    Back | 1  | 2  | 3  | 4  | 5  | Next 20

free hit counter