|
Self-stabilisation
Self-stabilization is a concept of fault-tolerance in distributed systems. Given any initial state, a self-stabilizing distributed system will end up in a correct state in a finite number of execution steps. At first glance, the guarantee of self stabilization may seem less promising than that of the more traditional fault-tolerance of algorithms, that aim to guarantee that the system always remains in a correct state under certain kinds of state transitions. However, that traditional fault tolerance cannot always be achieved. For example, it cannot be achieved when the system is started in an incorrect state or is corrupted by an intruder. Moreover, because of their complexity, it is very hard to debug and to analyze distributed systems. Hence, it is very hard to prevent a distributed system from reaching an incorrect state. Indeed, some forms of self-stabilization are incorporated into many modern computer and telecommunications networks, since it gives them the ability to cope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distributed Systems
A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another from any system. Distributed computing is a field of computer science that studies distributed systems. The components of a distributed system interact with one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack of a global clock, and managing the independent failure of components. When a component of one system fails, the entire system does not fail. Examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications. A computer program that runs within a distributed system is called a distributed program, and ''distributed programming'' is the process of writing such programs. There are many different types of implementations for t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fault-tolerance
Fault tolerance is the property that enables a system to continue operating properly in the event of the failure of one or more faults within some of its components. If its operating quality decreases at all, the decrease is proportional to the severity of the failure, as compared to a naively designed system, in which even a small failure can cause total breakdown. Fault tolerance is particularly sought after in high-availability, mission-critical, or even life-critical systems. The ability of maintaining functionality when portions of a system break down is referred to as graceful degradation. A fault-tolerant design enables a system to continue its intended operation, possibly at a reduced level, rather than failing completely, when some part of the system fails. The term is most commonly used to describe computer systems designed to continue more or less fully operational with, perhaps, a reduction in throughput or an increase in response time in the event of some partial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Superstabilization
Superstabilization is a concept of fault-tolerance in distributed computing. Superstabilizing distributed algorithms combine the features of self-stabilizing algorithms and dynamic algorithms. A superstabilizing algorithm – just like any other self-stabilizing algorithm – can be started in an arbitrary state, and it will ''eventually'' converge to a legitimate state. Additionally, a superstabilizing algorithm will recover ''rapidly'' from a single change in the network topology (adding or removing one edge or node in the network). Any self-stabilizing algorithm recovers from a change in the network topology – the system configuration after a topology change can be treated just like any other arbitrary starting configuration. However, in a self-stabilizing algorithm, the convergence after a single change in the network topology may be as slow as the convergence from an arbitrary starting state. In the study of superstabilizing algorithms, special attention is paid to the time i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mohamed G
Muhammad was an Islamic prophet and a religious and political leader who preached and established Islam. Muhammad and variations may also refer to: *Muhammad (name), a given name and surname, and list of people with the name and its variations Persons with the name Muhammad and no other name *Muhammad (Bavandid ruler), 13th-century Iranian monarch *Muhammad V of Kelantan (born 1969), 15th Yang di-Pertuan Agong and Sultan of Kelantan *Mohammed VI of Morocco (born 1963), King of Morocco * Muhammed VII, Sultan of Granada (1370–1408) *Muhammad VII of Bornu of the Sayfawa dynasty (1731–1747) * Muhammed VIII, Sultan of Granada (1411–1431) * Mohammed VIII of Bornu of the Sayfawa dynasty (1811–1814) Places * Mohammad-e Olya, a village in Fars Province, Iran *Mohammad, Gachsaran, a village in Kohgiluyeh and Boyer-Ahmad Province, Iran *Mohammad, Kohgiluyeh, a village in Kohgiluyeh and Boyer-Ahmad Province, Iran *Mohammad, Sistan and Baluchestan, a village in Sistan and Baluchest ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Collective Intelligence
Collective intelligence (CI) is shared or group intelligence (GI) that emerges from the collaboration, collective efforts, and competition of many individuals and appears in consensus decision making. The term appears in sociobiology, political science and in context of mass peer review and crowdsourcing applications. It may involve consensus, social capital and formalisms such as voting systems, social media and other means of quantifying mass activity. Collective IQ is a measure of collective intelligence, although it is often used interchangeably with the term collective intelligence. Collective intelligence has also been attributed to bacteria and animals. It can be understood as an emergent property from the synergies among: #data-information-knowledge #software-hardware #individuals (those with new insights as well as recognized authorities) that continually learns from feedback to produce just-in-time knowledge for better decisions than these three elements acting alo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MIT Press
The MIT Press is a university press affiliated with the Massachusetts Institute of Technology (MIT) in Cambridge, Massachusetts (United States). It was established in 1962. History The MIT Press traces its origins back to 1926 when MIT published under its own name a lecture series entitled ''Problems of Atomic Dynamics'' given by the visiting German physicist and later Nobel Prize winner, Max Born. Six years later, MIT's publishing operations were first formally instituted by the creation of an imprint called Technology Press in 1932. This imprint was founded by James R. Killian, Jr., at the time editor of MIT's alumni magazine and later to become MIT president. Technology Press published eight titles independently, then in 1937 entered into an arrangement with John Wiley & Sons in which Wiley took over marketing and editorial responsibilities. In 1962 the association with Wiley came to an end after a further 125 titles had been published. The press acquired its modern name af ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computationa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krzysztof R
Krzysztof () is a Polish given name, equivalent to English '' Christopher''. The name became popular in the 15th century. Its diminutive forms include Krzyś, Krzysiek, and Krzysio; augmentative – Krzychu Individuals named Krzysztof may choose to celebrate their name day on March 15, July 25, March 2, May 21, August 20 or October 31. People with the first name Krzysztof * Krzysztof Arciszewski (1592–1656), Polish military man * Krzysztof Bednarski (born 1953), famous contemporary Polish sculptor * Krzysztof Bizacki (born 1973), Polish footballer * Krzysztof Bukalski (born 1970), Polish footballer * Krzysztof Charamsa (born 1972), Polish priest * Krzysztof Chodkiewicz, d. 1652, Polish-Lithuanian nobleman * Krzysztof Cwalina (born 1971), Polish freestyle swimmer * Krzysztof Czerwinski (Krzysztof Czerwiński) (born 1980), Polish conductor, organist and voice teacher * Krzysztof Dabrowski (Krzysztof Dąbrowski) (born 1978), Polish footballer * Krzysztof Głowacki (born 1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shlomo Moran
Shlomo Moran ( he, שלמה מורן; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel. Moran received his Ph.D. in 1979 from the Technion, under the supervision of Azaria Paz; his dissertation was entitled "NP Optimization Problems and their Approximation". Several PhD students of Moran joined the academia as well, including Shlomi Dolev, Ilan Gronau, Shay Kutten, and Gadi Taubenfeld. In 1993 he shared the Gödel Prize with László Babai, Shafi Goldwasser, Silvio Micali, and Charles Rackoff for their work on Arthur–Merlin protocols and interactive proof systems. , ACM |
Circular Dependency
In software engineering, a circular dependency is a relation between two or more modules which either directly or indirectly depend on each other to function properly. Such modules are also known as mutually recursive. Overview Circular dependencies are natural in many domain models where certain objects of the same domain depend on each other. However, in software design, circular dependencies between larger software modules are considered an anti-pattern because of their negative effects. Despite this, such circular (or cyclic) dependencies have been found to be widespread among the source files of real-world software. Mutually recursive modules are, however, somewhat common in functional programming, where inductive and recursive definitions are often encouraged. Problems Circular dependencies can cause many unwanted effects in software programs. Most problematic from a software design point of view is the ''tight coupling'' of the mutually dependent modules which reduces or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shay Kutten
Shay Kutten is an Israeli computer scientist who holds the William M. Davidson Chair in Industrial Engineering and Management at the Technion – Israel Institute of Technology in Haifa, Israel. He is with the Information Systems Group of the William Davidson Faculty of Industrial Engineering and Management. His research involves Network Algorithms, distributed computing, and Network Security. Education and career Kutten completed his BA, MSc, and DSc at the Technion – Israel Institute of Technology. His MSc was performed under the supervision of Imrich Chlamtac, and the doctorate under the supervision of Shlomo Moran and Ephraim Korach. After a post doctorate with IBM T.J. Watson Research Center, he stayed there as a research staff member and as the group leader and manager of the network algorithms group and of the network security group he founded. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shlomi Dolev
Shlomi Dolev ( he, שלומי דולב; born December 5, 1958) is a Rita Altura Trust Chair Professor in Computer Science at Ben-Gurion University of the Negev (BGU) and the head of the BGU Negev Hi-Tech Faculty Startup Accelerato Biography Shlomi Dolev received Bachelor of Science, B.Sc. in Civil Engineering and B.A. in Computer Science in 1984 and 1985, and his M.Sc. and D.Sc. in computer science in 1990 and 1992 from the Technion Israel Institute of Technology. From 1992 to 1995 he was at Texas A&M University as a visiting research specialist. Academic career In 1995 Dolev joined the Department of Mathematics and Computer Science at BGU. He was the founder and first department head of the Computer Science Department, established in 2000. After 15 years, the department was ranked among the first 150 best departments in the world. He is the author of Self-Stabilization published by MIT Press in 2000. From 2011 to 2014, Dolev served as Dean of the Natural Sciences Faculty. From ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
