Institution
University of Notre Dame
Education•Notre Dame, Indiana, United States•
About: University of Notre Dame is a education organization based out in Notre Dame, Indiana, United States. It is known for research contribution in the topics: Population & Context (language use). The organization has 22238 authors who have published 55201 publications receiving 2032925 citations. The organization is also known as: University of Notre Dame du Lac & University of Notre Dame, South Bend.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: Research has shown that students who like school have higher academic achievement and a lower incidence of disciplinary problems, absenteeism, truancy, and dropping out of school than do those who do not like school as discussed by the authors.
Abstract: Research has shown that students who like school have higher academic achievement and a lower incidence of disciplinary problems, absenteeism, truancy, and dropping out of school than do those who ...
322 citations
••
TL;DR: In this article, an investigation of how uncertainty can be quantified in multidisciplinary systems analysis subject to epistemic uncertainty associated with the disciplinary design tools and input parameters is undertaken.
322 citations
••
TL;DR: Numerical evaluations illustrate absolute gains in coverage probability for the general user and the worst case user compared with the noncooperative case and it is shown that no diversity gain is achieved using noncoherent joint transmission, whereas full diversity gain can be achieved at the receiver if the transmitting base stations have channel state information.
Abstract: Motivated by the ongoing discussion on coordinated multipoint in wireless cellular standard bodies, this paper considers the problem of base station cooperation in the downlink of heterogeneous cellular networks. The focus of this paper is the joint transmission scenario, where an ideal backhaul network allows a set of randomly located base stations, possibly belonging to different network tiers, to jointly transmit data, to mitigate intercell interference and hence improve coverage and spectral efficiency. Using tools from stochastic geometry, an integral expression for the network coverage probability is derived in the scenario where the typical user located at an arbitrary location, i.e., the general user, receives data from a pool of base stations that are selected based on their average received power levels. An expression for the coverage probability is also derived for the typical user located at the point equidistant from three base stations, which we refer to as the worst case user. In the special case where cooperation is limited to two base stations, numerical evaluations illustrate absolute gains in coverage probability of up to 17% for the general user and 24% for the worst case user compared with the noncooperative case. It is also shown that no diversity gain is achieved using noncoherent joint transmission, whereas full diversity gain can be achieved at the receiver if the transmitting base stations have channel state information.
321 citations
••
TL;DR: The authors provided the first evidence using gravity equations of both intensive and extensive (goods) margins being affected by EIAs employing a panel data set with a large number of country pairs, product categories, and EIA from 1962 to 2000.
321 citations
01 Jan 2001
TL;DR: Simulation studies show that at short to moderate lengths these codes’ performance meets or surpasses that of randomly generated regular (3,5) LDPC codes when used with sum-product algorithm decoders.
Abstract: 1 This work was supported by NSF grant 99-96222 Abstract A class of graphs is designed using subgroups of the multiplicative group of a prime field GF(p) Instances where (p-1) is divisible by 3 and 5 are used to construct quasi-cyclic LDPC codes with bit degree 3 and parity degree 5, among them a [155,64,20] code While the girth of a graph in this class cannot be greater than twelve, for many practical lengths the graphs have a relatively large girth and a lowdensity of short cycles Simulation studies show that at short to moderate lengths these codes’ performance meets or surpasses that of randomly generated regular (3,5) LDPC codes when used with sum-product algorithm decoders
321 citations
Authors
Showing all 22586 results
Name | H-index | Papers | Citations |
---|---|---|---|
George Davey Smith | 224 | 2540 | 248373 |
David Miller | 203 | 2573 | 204840 |
Patrick O. Brown | 183 | 755 | 200985 |
Dorret I. Boomsma | 176 | 1507 | 136353 |
Chad A. Mirkin | 164 | 1078 | 134254 |
Darien Wood | 160 | 2174 | 136596 |
Wei Li | 158 | 1855 | 124748 |
Timothy C. Beers | 156 | 934 | 102581 |
Todd Adams | 154 | 1866 | 143110 |
Albert-László Barabási | 152 | 438 | 200119 |
T. J. Pearson | 150 | 895 | 126533 |
Amartya Sen | 149 | 689 | 141907 |
Christopher Hill | 144 | 1562 | 128098 |
Tim Adye | 143 | 1898 | 109010 |
Teruki Kamon | 142 | 2034 | 115633 |