scispace - formally typeset
Search or ask a question
Institution

Cornell University

Education•Ithaca, New York, United States•
About: Cornell University is a education organization based out in Ithaca, New York, United States. It is known for research contribution in the topics: Population & Gene. The organization has 102246 authors who have published 235546 publications receiving 12283673 citations. The organization is also known as: Cornell & CUI.
Topics: Population, Gene, Cancer, Context (language use), Medicine


Papers
More filters
Journal Article•DOI•
13 Jun 1996-Nature
TL;DR: It is shown that a learning algorithm that attempts to find sparse linear codes for natural scenes will develop a complete family of localized, oriented, bandpass receptive fields, similar to those found in the primary visual cortex.
Abstract: The receptive fields of simple cells in mammalian primary visual cortex can be characterized as being spatially localized, oriented and bandpass (selective to structure at different spatial scales), comparable to the basis functions of wavelet transforms. One approach to understanding such response properties of visual neurons has been to consider their relationship to the statistical structure of natural images in terms of efficient coding. Along these lines, a number of studies have attempted to train unsupervised learning algorithms on natural images in the hope of developing receptive fields with similar properties, but none has succeeded in producing a full set that spans the image space and contains all three of the above properties. Here we investigate the proposal that a coding strategy that maximizes sparseness is sufficient to account for these properties. We show that a learning algorithm that attempts to find sparse linear codes for natural scenes will develop a complete family of localized, oriented, bandpass receptive fields, similar to those found in the primary visual cortex. The resulting sparse image code provides a more efficient representation for later stages of processing because it possesses a higher degree of statistical independence among its outputs.

5,947 citations

Proceedings Article•DOI•
24 Aug 2003
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Abstract: Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of "word of mouth" in the promotion of new products. Recently, motivated by the design of viral marketing strategies, Domingos and Richardson posed a fundamental algorithmic problem for such social network processes: if we can try to convince a subset of individuals to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target?We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models; our framework suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform node-selection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.

5,887 citations

Journal Article•DOI•
Debra A. Bell1, Andrew Berchuck2, Michael J. Birrer3, Jeremy Chien1  +282 more•Institutions (35)
30 Jun 2011-Nature
TL;DR: It is reported that high-grade serous ovarian cancer is characterized by TP53 mutations in almost all tumours (96%); low prevalence but statistically recurrent somatic mutations in nine further genes including NF1, BRCA1,BRCA2, RB1 and CDK12; 113 significant focal DNA copy number aberrations; and promoter methylation events involving 168 genes.
Abstract: A catalogue of molecular aberrations that cause ovarian cancer is critical for developing and deploying therapies that will improve patients' lives. The Cancer Genome Atlas project has analysed messenger RNA expression, microRNA expression, promoter methylation and DNA copy number in 489 high-grade serous ovarian adenocarcinomas and the DNA sequences of exons from coding genes in 316 of these tumours. Here we report that high-grade serous ovarian cancer is characterized by TP53 mutations in almost all tumours (96%); low prevalence but statistically recurrent somatic mutations in nine further genes including NF1, BRCA1, BRCA2, RB1 and CDK12; 113 significant focal DNA copy number aberrations; and promoter methylation events involving 168 genes. Analyses delineated four ovarian cancer transcriptional subtypes, three microRNA subtypes, four promoter methylation subtypes and a transcriptional signature associated with survival duration, and shed new light on the impact that tumours with BRCA1/2 (BRCA1 or BRCA2) and CCNE1 aberrations have on survival. Pathway analyses suggested that homologous recombination is defective in about half of the tumours analysed, and that NOTCH and FOXM1 signalling are involved in serous ovarian cancer pathophysiology.

5,878 citations

Journal Article•DOI•
15 Jul 1977-Science

5,833 citations

Journal Article•DOI•
TL;DR: Various findings are reviewed in relation to the idea that ACC is a part of a circuit involved in a form of attention that serves to regulate both cognitive and emotional processing, and how the success of this regulation in controlling responses might be correlated with cingulate size.

5,824 citations


Authors

Showing all 103081 results

NameH-indexPapersCitations
Eric S. Lander301826525976
David Miller2032573204840
Lewis C. Cantley196748169037
Charles A. Dinarello1901058139668
Scott M. Grundy187841231821
Paul G. Richardson1831533155912
Chris Sander178713233287
David R. Williams1782034138789
David L. Kaplan1771944146082
Kari Alitalo174817114231
Richard K. Wilson173463260000
George F. Koob171935112521
Avshalom Caspi170524113583
Derek R. Lovley16858295315
Stephen B. Baylin168548188934
Network Information
Related Institutions (5)
University of Pennsylvania
257.6K papers, 14.1M citations

96% related

Stanford University
320.3K papers, 21.8M citations

96% related

University of Washington
305.5K papers, 17.7M citations

96% related

Columbia University
224K papers, 12.8M citations

96% related

Yale University
220.6K papers, 12.8M citations

95% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023309
20221,363
202112,457
202012,139
201910,787
20189,905