|
Stefan Savage
Stefan Savage (born 1969) is an American computer science researcher, currently a Professor in the Systems and Networking Group at the University of California, San Diego. There, he holds the Irwin and Joan Jacobs Chair in Information and Computer Science. Savage is widely cited in computer security, particularly in the areas of email spam, Computer worm, network worms and malware propagation, Ddos#Distributed attack, distributed denial of service (DDOS) mitigation and traceback, automotive hacking and wireless security. He received his undergraduate degree at Carnegie Mellon and his Ph.D. from the University of Washington (2002). Career In 1999, Savage's research team published ''TCP Congestion Control with a Misbehaving Receiver'', which uncovered protocol flaws in the Transmission Control Protocol, TCP protocol that carries most Internet traffic. By exploiting these flaws, Savage proposed means for attackers to evade Network congestion avoidance, congestion control, allowing at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Carnegie Mellon University
Carnegie Mellon University (CMU) is a private research university in Pittsburgh, Pennsylvania, United States. The institution was established in 1900 by Andrew Carnegie as the Carnegie Technical Schools. In 1912, it became the Carnegie Institute of Technology and began granting four-year degrees. In 1967, it became Carnegie Mellon University through its merger with the Mellon Institute of Industrial Research, founded in 1913 by Andrew Mellon and Richard B. Mellon and formerly a part of the University of Pittsburgh. The university consists of seven colleges, including the College of Engineering, the School of Computer Science, and the Tepper School of Business. The university has its main campus located 5 miles (8 km) from downtown Pittsburgh. It also has over a dozen degree-granting locations in six continents, including campuses in Qatar, Silicon Valley, and Kigali, Rwanda ( Carnegie Mellon University Africa) and partnerships with universities nationally and glob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic
Stochastic (; ) is the property of being well-described by a random probability distribution. ''Stochasticity'' and ''randomness'' are technically distinct concepts: the former refers to a modeling approach, while the latter describes phenomena; in everyday conversation, however, these terms are often used interchangeably. In probability theory, the formal concept of a '' stochastic process'' is also referred to as a ''random process''. Stochasticity is used in many different fields, including image processing, signal processing, computer science, information theory, telecommunications, chemistry, ecology, neuroscience, physics, and cryptography. It is also used in finance (e.g., stochastic oscillator), due to seemingly random changes in the different markets within the financial sector and in medicine, linguistics, music, media, colour theory, botany, manufacturing and geomorphology. Etymology The word ''stochastic'' in English was originally used as an adjective with the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SIGOPS Mark Weiser Award
The ACM SIGOPS (Special Interest Group on Operating Systems) Mark Weiser Award is awarded to an individual who has shown creativity and innovation in operating system research. The recipients began their career no earlier than 20 years prior to nomination. The special-interest-group-level award was created in 2001 and is named after Mark Weiser, the father of ubiquitous computing. The winners of this award have been: * 2024: George Candea, EPFL * 2023: Matei Zaharia, UC Berkeley * 2022: David Andersen, Carnegie Mellon University * 2021: Michael J. Freedman, Princeton University * 2020: Jason Flinn, University of Michigan and Facebook * 2019: Ion Stoica, UC Berkeley * 2018: Andrea Arpaci-Dusseau and Remzi Arpaci-Dusseau, University of Wisconsin-Madison * 2017: Nickolai Zeldovich, MIT * 2016: Antony Rowstron, Microsoft Research (Cambridge) * 2015: Yuanyuan Zhou, UCSD * 2014: Eddie Kohler, Harvard University * 2013: Stefan Savage, UCSD * 2012: Jeff Dean and Sanjay Ghemawat, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, reporting nearly 110,000 student and professional members . Its headquarters are in New York City. The ACM is an umbrella organization for academic and scholarly interests in computer science (informatics). Its motto is "Advancing Computing as a Science & Profession". History In 1947, a notice was sent to various people: On January 10, 1947, at the Symposium on Large-Scale Digital Calculating Machinery at the Harvard computation Laboratory, Professor Samuel H. Caldwell of Massachusetts Institute of Technology spoke of the need for an association of those interested in computing machinery, and of the need for communication between them. ..After making some inquiries during May and June, we believe there is ample interest to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sloan Research Fellowship
The Sloan Research Fellowships are awarded annually by the Alfred P. Sloan Foundation since 1955 to "provide support and recognition to early-career scientists and scholars". This program is one of the oldest of its kind in the United States. Fellowships were initially awarded in physics, chemistry, and mathematics. Awards were later added in neuroscience (1972), economics (1980), computer science (1993), computational and evolutionary molecular biology (2002), and ocean sciences or earth systems sciences (2012). Winners of these two-year fellowships are awarded $75,000, which may be spent on any expense supporting their research. From 2012 through 2020, the foundation awarded 126 research fellowship each year; in 2021, 128 were awarded, and 118 were awarded in 2022. Eligibility and selection To be eligible, a candidate must hold a Ph.D. or equivalent degree and must be a member of the faculty of a college, university, or other degree-granting institution in the United Sta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ishwar Ramani
''Ishvara'' () is a concept in Hinduism, with a wide range of meanings that depend on the era and the school of Hinduism. Monier Monier Williams, Sanskrit-English dictionarySearch for Izvara, University of Cologne, Germany In ancient texts of Hindu philosophy, depending on the context, ''Ishvara'' can mean lord, ruler, king, husband, queen, soul or the supreme Self ( Atman). In medieval era Hindu texts, depending on the school of Hinduism, ''Ishvara'' means God, Supreme Being, personal God, or special Self. In Shaivism, ''Ishvara'' is an epithet of Shiva.James Lochtefeld, "Ishvara", The Illustrated Encyclopedia of Hinduism, Vol. 1: A–M, Rosen Publishing. , page 306 In Vaishnavism it is synonymous with Vishnu, like in his epithet of Venkateswara. In traditional Bhakti movements, ''Ishvara'' is one or more deities of an individual's preference ( Iṣṭa-devatā) from Hinduism's polytheistic canon of deities. In modern-day sectarian movements such as Arya Samaj and Brahmoism, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
George Varghese
George Varghese (born 1960) is a computer scientist, a professor of computer science and Jonathan B. Postel Chair in Networking in the UCLA Henry Samueli School of Engineering and Applied Science. He is the author of the textbook ''Network Algorithmics,'' published by Morgan Kaufmann in 2004. Education and career Varghese received his B.Tech in electrical engineering from IIT Bombay in 1981, his M.S. in computer studies from NCSU in 1983 and his Ph.D. in computer science from MIT in 1993, where his advisor was Nancy Lynch. He has been a Fellow of the ACM since 2002. Varghese was a professor at Washington University in St. Louis from 1992 until 1999, when he moved to the University of California, San Diego. He worked at Microsoft Research from 2012 until 2016, and took his present position at the University of California, Los Angeles in 2016. Research Transparent Bridge Architecture Before his Ph.D., George spent several years as part of the network architecture and adva ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reverse Engineering
Reverse engineering (also known as backwards engineering or back engineering) is a process or method through which one attempts to understand through deductive reasoning how a previously made device, process, system, or piece of software accomplishes a task with very little (if any) insight into exactly how it does so. Depending on the system under consideration and the technologies employed, the knowledge gained during reverse engineering can help with repurposing obsolete objects, doing security analysis, or learning how something works. Although the process is specific to the object on which it is being performed, all reverse engineering processes consist of three basic steps: information extraction, modeling, and review. Information extraction is the practice of gathering all relevant information for performing the operation. Modeling is the practice of combining the gathered information into an abstract model, which can be used as a guide for designing the new object or syst ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SQL Slammer
SQL Slammer is a 2003 computer worm that caused a denial of service on some Internet hosts and dramatically slowed general Internet traffic. It also crashed routers around the world, causing even more slowdowns. It spread rapidly, infecting most of its 75,000 victims within 10 minutes. The program exploited a buffer overflow bug in Microsoft's SQL Server and Desktop Engine database products. Although thMS02-039(CVE-2002-0649) patch had been released six months earlier, many organizations had not yet applied it. The most infected regions were Europe, North America, and Asia (including East Asia and India). Technical details The worm was based on proof of concept code demonstrated at the Black Hat Briefings by David Litchfield, who had initially discovered the buffer overflow vulnerability that the worm exploited. It is a small piece of code that does little other than generate random IP addresses and send itself out to those addresses. If a selected address happens to belong t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Code Red II
Code Red II is a computer worm similar to the Code Red worm. Released two weeks after Code Red on August 4, 2001, it is similar in behavior to the original, but analysis showed it to be a new worm instead of a variant. Unlike the first, the second has no function for attack; instead it has a backdoor that allows attacks. The worm was designed to exploit a security hole in the indexing software included as part of Microsoft's Internet Information Server (IIS) web server software (CVE-2001-0500). A typical signature of the Code Red II worm appears in a web server log as: GET /default.ida?XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX %u9090%u6858%ucbd3%u7801%u9090%u6858%ucbd3%u7801 %u9090%u6858%ucbd3%u7801%u9090%u9090%u8190%u00c3 %u0003%u8b00%u531b%u53ff%u0078%u0000%u00=a HTTP/1.0 Wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Network Telescope
A network telescope (also known as a packet telescope, darknet, Internet motion sensor or black hole) is an Internet system that allows one to observe different large-scale events taking place on the Internet. The basic idea is to observe traffic targeting the dark (unused) address-space of the network. Since all traffic to these addresses is suspicious, one can gain information about possible network attacks (random scanning worms, and DDoS backscatter) as well as other misconfigurations by observing it. The resolution of the Internet telescope is dependent on the number of IP addresses it monitors. For example, a large Internet telescope that monitors traffic to 16,777,216 addresses (the Internet telescope in IPv4), has a higher probability of observing a relatively small event than a smaller telescope that monitors 65,536 addresses (a Internet telescope). The naming comes from an analogy to optical telescopes, where a larger physical size allows more photons to be observed. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
