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
Book
01 Jan 1989
TL;DR: This chapter discusses transfer in the ACT and the theory of representation and transfer, as well as some examples of transfer practice in the real world.
Abstract: * The Study of Transfer * Transfer in the ACT* Theory * Lateral Transfer * Negative Transfer * Use Specificity of Procedural Knowledge * Simulating Analogical Transfer * Declarative Transfer * The Theory in Review * Representation and Transfer * References * Index

1,235 citations

Journal ArticleDOI
TL;DR: In this article, the authors apply the Schwarz criterion to find an approximate solution to Bayesian testing problems, at least when the hypotheses are nested when the prior on ψ is Normal.
Abstract: To compute a Bayes factor for testing H 0: ψ = ψ0 in the presence of a nuisance parameter β, priors under the null and alternative hypotheses must be chosen As in Bayesian estimation, an important problem has been to define automatic, or “reference,” methods for determining priors based only on the structure of the model In this article we apply the heuristic device of taking the amount of information in the prior on ψ equal to the amount of information in a single observation Then, after transforming β to be “null orthogonal” to ψ, we take the marginal priors on β to be equal under the null and alternative hypotheses Doing so, and taking the prior on ψ to be Normal, we find that the log of the Bayes factor may be approximated by the Schwarz criterion with an error of order O p (n −½), rather than the usual error of order O p (1) This result suggests the Schwarz criterion should provide sensible approximate solutions to Bayesian testing problems, at least when the hypotheses are nested When

1,235 citations

Journal ArticleDOI
TL;DR: In this article, a practically motivated method for evaluating systems' abilities to handle external stress is proposed, which is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing on the underlying determinants of adaptive capacity.
Abstract: This paper offers a practically motivated method for evaluating systems’ abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems’ coping capacities by focusing attention directly on the underlying determinants of adaptive capacity. The method should be sufficiently flexible to accommodate diverse applications whose contexts are location specific and path dependent without imposing the straightjacket constraints of a “one size fits all” cookbook approach. Nonetheless, the method should produce unitless indicators that can be employed to judge the relative vulnerabilities of diverse systems to multiple stresses and to their potential interactions. An artificial application is employed to describe the development of the method and to illustrate how it might be applied. Some empirical evidence is offered to underscore the significance of the determinants of adaptive capacity in determining vulnerability; these are the determinants upon which the method is constructed. The method is, finally, applied directly to expert judgments of six different adaptations that could reduce vulnerability in the Netherlands to increased flooding along the Rhine River.

1,233 citations

Journal ArticleDOI
TL;DR: This paper presents attacks against routing in ad hoc networks, and the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne, which prevents attackers or compromised nodes from tampering with uncompromising routes consisting of uncompromised nodes.
Abstract: An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.

1,230 citations

Journal ArticleDOI
TL;DR: It is demonstrated that by evoking the permission schema it is possible to facilitate performance in Wason's selection paradigm for subjects who have had no experience with the specific content of the problems, and evidence that evocation of a permission schema affects not only tasks requiring procedural knowledge, but also a linguistic rephrasing task requiring declarative knowledge.

1,228 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