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: Computer science & 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 ChapterDOI
14 Aug 2005
TL;DR: By building a framework of multiset operations, employing the mathematical properties of polynomials, this work designs efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations.
Abstract: In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party's input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties' private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work.

750 citations

Proceedings ArticleDOI
08 Nov 2008
TL;DR: Examination of how the number of editors in Wikipedia and the coordination methods they use affect article quality demonstrated the critical importance of coordination in effectively harnessing the "wisdom of the crowd" in online production environments.
Abstract: Wikipedia's success is often attributed to the large numbers of contributors who improve the accuracy, completeness and clarity of articles while reducing bias. However, because of the coordination needed to write an article collaboratively, adding contributors is costly. We examined how the number of editors in Wikipedia and the coordination methods they use affect article quality. We distinguish between explicit coordination, in which editors plan the article through communication, and implicit coordination, in which a subset of editors structure the work by doing the majority of it. Adding more editors to an article improved article quality only when they used appropriate coordination techniques and was harmful when they did not. Implicit coordination through concentrating the work was more helpful when many editors contributed, but explicit coordination through communication was not. Both types of coordination improved quality more when an article was in a formative stage. These results demonstrate the critical importance of coordination in effectively harnessing the "wisdom of the crowd" in online production environments.

749 citations

Proceedings ArticleDOI
06 Dec 2009
TL;DR: This paper describes PEGASUS, an open source Peta Graph Mining library which performs typical graph mining tasks such as computing the diameter of the graph, computing the radius of each node and finding the connected components, and describes a very important primitive for PEGasUS, called GIM-V (Generalized Iterated Matrix-Vector multiplication).
Abstract: In this paper, we describe PEGASUS, an open source Peta Graph Mining library which performs typical graph mining tasks such as computing the diameter of the graph, computing the radius of each node and finding the connected components. As the size of graphs reaches several Giga-, Tera- or Peta-bytes, the necessity for such a library grows too. To the best of our knowledge, PEGASUS is the first such library, implemented on the top of the Hadoop platform, the open source version of MapReduce. Many graph mining operations (PageRank, spectral clustering, diameter estimation, connected components etc.) are essentially a repeated matrix-vector multiplication. In this paper we describe a very important primitive for PEGASUS, called GIM-V (Generalized Iterated Matrix-Vector multiplication). GIM-V is highly optimized, achieving (a) good scale-up on the number of available machines (b) linear running time on the number of edges, and (c) more than 5 times faster performance over the non-optimized version of GIM-V. Our experiments ran on M45, one of the top 50 supercomputers in the world. We report our findings on several real graphs, including one of the largest publicly available Web Graphs, thanks to Yahoo!, with 6,7 billion edges.

749 citations

Journal ArticleDOI
TL;DR: In this paper, the concept of initiators for continuous activator regeneration (ICAR) in atom transfer radical polymerization (ATRP) is introduced, whereby a constant source of organic free radicals works to regenerate the CuI activator, which is otherwise consumed in termination reactions when used at very low concentrations.
Abstract: The concept of initiators for continuous activator regeneration (ICAR) in atom transfer radical polymerization (ATRP) is introduced, whereby a constant source of organic free radicals works to regenerate the CuI activator, which is otherwise consumed in termination reactions when used at very low concentrations. With this technique, controlled synthesis of polystyrene and poly(methyl methacrylate) (Mw/Mn < 1.2) can be implemented with catalyst concentrations between 10 and 50 ppm, where its removal or recycling would be unwarranted for many applications. Additionally, various organic reducing agents (derivatives of hydrazine and phenol) are used to continuously regenerate the CuI activator in activators regenerated by electron transfer (ARGET) ATRP. Controlled polymer synthesis of acrylates (Mw/Mn < 1.2) is realized with catalyst concentrations as low as 50 ppm. The rational selection of suitable Cu complexing ligands {tris[2-(dimethylamino)ethyl]amine (Me6TREN) and tris[(2-pyridyl)methyl]amine (TPMA)} is discussed in regards to specific side reactions in each technique (i.e., complex dissociation, acid evolution, and reducing agent complexation). Additionally, mechanistic studies and kinetic modeling are used to optimize each system. The performance of the selected catalysts/reducing agents in homo and block (co)polymerizations is evaluated.

748 citations

Journal ArticleDOI
TL;DR: In this article, the authors analyze the issue of market power in the context of markets for transferable property rights and present a model that explains how a single firm with market power might exercise its influence.
Abstract: The appeal of using markets as a means of allocating scarce resources stems in large part from the assumption that a market will approximate the competitive ideal. When competition is not a foregone conclusion, the question naturally arises as to how a firm might manipulate the market to its own advantage. This paper analyzes the issue of market power in the context of markets for transferable property rights. First, a model is developed that explains how a single firm with market power might exercise its influence. This is followed by an examination of the model in the context of a particular policy problem--the control of particulate sulfates in the Los Angeles region.

748 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,981
20205,375
20195,420
20184,972