scispace - formally typeset
Search or ask a question
Institution

Carnegie Mellon University

EducationPittsburgh, Pennsylvania, United States
About: Carnegie Mellon University is a education organization based out in Pittsburgh, Pennsylvania, United States. It is known for research contribution in the topics: Population & Robot. The organization has 36317 authors who have published 104359 publications receiving 5975734 citations. The organization is also known as: CMU & Carnegie Mellon.


Papers
More filters
Journal ArticleDOI
TL;DR: It is demonstrated that Fe3GeTe2 (FGT), an exfoliable vdW magnet, exhibits robust 2D ferromagnetism with strong perpendicular anisotropy when thinned down to a monolayer.
Abstract: Discoveries of intrinsic two-dimensional (2D) ferromagnetism in van der Waals (vdW) crystals provide an interesting arena for studying fundamental 2D magnetism and devices that employ localized spins1–4. However, an exfoliable vdW material that exhibits intrinsic 2D itinerant magnetism remains elusive. Here we demonstrate that Fe3GeTe2 (FGT), an exfoliable vdW magnet, exhibits robust 2D ferromagnetism with strong perpendicular anisotropy when thinned down to a monolayer. Layer-number-dependent studies reveal a crossover from 3D to 2D Ising ferromagnetism for thicknesses less than 4 nm (five layers), accompanied by a fast drop of the Curie temperature (TC) from 207 K to 130 K in the monolayer. For FGT flakes thicker than ~15 nm, a distinct magnetic behaviour emerges in an intermediate temperature range, which we show is due to the formation of labyrinthine domain patterns. Our work introduces an atomically thin ferromagnetic metal that could be useful for the study of controllable 2D itinerant ferromagnetism and for engineering spintronic vdW heterostructures5. Metallic ferromagnetism is reported in an exfoliated monolayer of the van der Waals material Fe3GeTe2.

924 citations

Journal ArticleDOI
11 Aug 2006
TL;DR: This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the "social network "among user identities, where an edge between two identities indicates a human-established trust relationship.
Abstract: Peer-to-peer and other decentralized,distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack,a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By controlling a large fraction of the nodes in the system,the malicious user is able to "out vote" the honest users in collaborative tasks such as Byzantine failure defenses. This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks.Our protocol is based on the "social network "among user identities, where an edge between two identities indicates a human-established trust relationship. Malicious users can create many identities but few trust relationships. Thus, there is a disproportionately-small "cut" in the graph between the sybil nodes and the honest nodes. SybilGuard exploits this property to bound the number of identities a malicious user can create.We show the effectiveness of SybilGuard both analytically and experimentally.

924 citations

Book ChapterDOI
TL;DR: Baylor et al. as discussed by the authors described the progress that had been made up to that time in using information processing models and the techniques of computer simulation to explain human problem-solving processes.
Abstract: As genetics needs its model organisms, its Drosophila and Neurospora, so psychology needs standard task environments around which knowledge and understanding can cumulate. Chess has proved to be an excellent model environment for this purpose. About a decade ago in the pages of this journal, one of us, with Allen Newell, described the progress that had been made up to that time in using information-processing models and the techniques of computer simulation to explain human problem-solving processes. (Simon et al, 1964). A part of our article was devoted to a theory of the processes that expert chess players use in discovering checkmating combinations (Simon et al, 1962), a theory that was subsequently developed further, embodied in a running computer program, mater, and subjected to additional empirical testing. (Baylor et al, 1966).

923 citations

Journal ArticleDOI
TL;DR: In this article, the usual formula for transition probabilities in nonrelativistic quantum mechanics is generalized to yield conditional probabilities for selected sequences of events at several different times, called consistent histories, through a criterion which ensures that, within limits which are explicitly defined within the formalism, classical rules for probabilities are satisfied.
Abstract: The usual formula for transition probabilities in nonrelativistic quantum mechanics is generalized to yield conditional probabilities for selected sequences of events at several different times, called “consistent histories,” through a criterion which ensures that, within limits which are explicitly defined within the formalism, classical rules for probabilities are satisfied The interpretive scheme which results is applicable to closed (isolated) quantum systems, is explicitly independent of the sense of time (ie, past and future can be interchanged), has no need for wave function “collapse,” makes no reference to processes of measurement (though it can be used to analyze such processes), and can be applied to sequences of microscopic or macroscopic events, or both, as long as the mathematical condition of consistency is satisfied When applied to appropriate macroscopic events it appears to yield the same answers as other interpretative schemes for standard quantum mechanics, though from a different point of view which avoids the conceptual difficulties which are sometimes thought to require reference to conscious observers or classical apparatus

922 citations

Journal ArticleDOI
Željko Ivezić1, Steven M. Kahn2, J. Anthony Tyson3, Bob Abel4  +332 moreInstitutions (55)
TL;DR: The Large Synoptic Survey Telescope (LSST) as discussed by the authors is a large, wide-field ground-based system designed to obtain repeated images covering the sky visible from Cerro Pachon in northern Chile.
Abstract: We describe here the most ambitious survey currently planned in the optical, the Large Synoptic Survey Telescope (LSST). The LSST design is driven by four main science themes: probing dark energy and dark matter, taking an inventory of the solar system, exploring the transient optical sky, and mapping the Milky Way. LSST will be a large, wide-field ground-based system designed to obtain repeated images covering the sky visible from Cerro Pachon in northern Chile. The telescope will have an 8.4 m (6.5 m effective) primary mirror, a 9.6 deg2 field of view, a 3.2-gigapixel camera, and six filters (ugrizy) covering the wavelength range 320–1050 nm. The project is in the construction phase and will begin regular survey operations by 2022. About 90% of the observing time will be devoted to a deep-wide-fast survey mode that will uniformly observe a 18,000 deg2 region about 800 times (summed over all six bands) during the anticipated 10 yr of operations and will yield a co-added map to r ~ 27.5. These data will result in databases including about 32 trillion observations of 20 billion galaxies and a similar number of stars, and they will serve the majority of the primary science programs. The remaining 10% of the observing time will be allocated to special projects such as Very Deep and Very Fast time domain surveys, whose details are currently under discussion. We illustrate how the LSST science drivers led to these choices of system parameters, and we describe the expected data products and their characteristics.

921 citations


Authors

Showing all 36645 results

NameH-indexPapersCitations
Yi Chen2174342293080
Rakesh K. Jain2001467177727
Robert C. Nichol187851162994
Michael I. Jordan1761016216204
Jasvinder A. Singh1762382223370
J. N. Butler1722525175561
P. Chang1702154151783
Krzysztof Matyjaszewski1691431128585
Yang Yang1642704144071
Geoffrey E. Hinton157414409047
Herbert A. Simon157745194597
Yongsun Kim1562588145619
Terrence J. Sejnowski155845117382
John B. Goodenough1511064113741
Scott Shenker150454118017
Network Information
Related Institutions (5)
Massachusetts Institute of Technology
268K papers, 18.2M citations

95% related

University of Maryland, College Park
155.9K papers, 7.2M citations

93% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

93% related

IBM
253.9K papers, 7.4M citations

93% related

Princeton University
146.7K papers, 9.1M citations

92% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023120
2022499
20214,980
20205,375
20195,420
20184,972