skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Recommendation of scholarly venues based on dynamic user interests

Publication Date:
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
OSTI Identifier:
Grant/Contract Number:
Resource Type:
Journal Article: Publisher's Accepted Manuscript
Journal Name:
Journal of Informetrics
Additional Journal Information:
Journal Volume: 11; Journal Issue: 2; Related Information: CHORUS Timestamp: 2017-12-26 11:59:08; Journal ID: ISSN 1751-1577
Country of Publication:
Country unknown/Code not available

Citation Formats

Alhoori, Hamed, and Furuta, Richard. Recommendation of scholarly venues based on dynamic user interests. Country unknown/Code not available: N. p., 2017. Web. doi:10.1016/j.joi.2017.03.006.
Alhoori, Hamed, & Furuta, Richard. Recommendation of scholarly venues based on dynamic user interests. Country unknown/Code not available. doi:10.1016/j.joi.2017.03.006.
Alhoori, Hamed, and Furuta, Richard. 2017. "Recommendation of scholarly venues based on dynamic user interests". Country unknown/Code not available. doi:10.1016/j.joi.2017.03.006.
title = {Recommendation of scholarly venues based on dynamic user interests},
author = {Alhoori, Hamed and Furuta, Richard},
abstractNote = {},
doi = {10.1016/j.joi.2017.03.006},
journal = {Journal of Informetrics},
number = 2,
volume = 11,
place = {Country unknown/Code not available},
year = 2017,
month = 5

Journal Article:
Free Publicly Available Full Text
This content will become publicly available on April 8, 2018
Publisher's Accepted Manuscript

Save / Share:
  • Purpose: Advancement in academic radiation oncology is largely contingent on research productivity and the perceived external influence of an individual's scholarly work. The purpose of this study was to use the Hirsch index (h-index) to estimate the research productivity of current radiation oncology faculty at U.S. academic institutions between 1996 and 2007. Methods and Materials: We performed bibliometric citation database searches for available radiation oncology faculty at domestic residency-training institutions (n = 826). The outcomes analyzed included the total number of manuscripts, total number of citations, and the h-index between 1996 and 2007. Analysis of overall h-index rankings with stratificationmore » by academic ranking, junior vs. senior faculty status, and gender was performed. Results: Of the 826 radiation oncologists, the mean h-index was 8.5. Of the individuals in the top 10% by the h-index, 34% were chairpersons, 88% were senior faculty, and 13% were women. A greater h-index was associated with a higher academic ranking and senior faculty status. Recursive partitioning analysis revealed an h-index threshold of 15 (p <0.0001) as an identified breakpoint between the senior and junior faculty. Overall, women had lower h-indexes compared with men (mean, 6.4 vs. 9.4); however, when stratified by academic ranking, the gender differential all but disappeared. Conclusion: Using the h-index as a partial surrogate for research productivity, it appears that radiation oncologists in academia today comprise a prolific group, however, with a highly skewed distribution. According to the present analysis, the h-index correlated with academic ranking. Thus, it potentially has utility in the process of promotion decisions. Overall, women in radiation oncology were less academically productive than men; the possible reasons for the gender differential are discussed.« less
  • The emergence of the web has fundamentally affected most aspects of information communication, including scholarly communication. The immediacy that characterizes publishing information to the web, as well as accessing it, allows for a dramatic increase in the speed of dissemination of scholarly knowledge. But, the transition from a paper-based to a web-based scholarly communication system also poses challenges. In this paper, we focus on reference rot, the combination of link rot and content drift to which references to web resources included in Science, Technology, and Medicine (STM) articles are subject. We investigate the extent to which reference rot impacts themore » ability to revisit the web context that surrounds STM articles some time after their publication. We do so on the basis of a vast collection of articles from three corpora that span publication years 1997 to 2012. For over one million references to web resources extracted from over 3.5 million articles, we determine whether the HTTP URI is still responsive on the live web and whether web archives contain an archived snapshot representative of the state the referenced resource had at the time it was referenced. We observe that the fraction of articles containing references to web resources is growing steadily over time. We find one out of five STM articles suffering from reference rot, meaning it is impossible to revisit the web context that surrounds them some time after their publication. When only considering STM articles that contain references to web resources, this fraction increases to seven out of ten.« less
  • No commonly used framework exists in the scholarly study of the social impacts of dams. This hinders comparisons of analyses and thus the accumulation of knowledge. The aim of this paper is to unify scholarly understanding of dams' social impacts via the analysis and aggregation of the various frameworks currently used in the scholarly literature. For this purpose, we have systematically analyzed and aggregated 27 frameworks employed by academics analyzing dams' social impacts (found in a set of 217 articles). A key finding of the analysis is that currently used frameworks are often not specific to dams and thus omitmore » key impacts associated with them. The result of our analysis and aggregation is a new framework for scholarly analysis (which we call ‘matrix framework’) specifically on dams' social impacts, with space, time and value as its key dimensions as well as infrastructure, community and livelihood as its key components. Building on the scholarly understanding of this topic enables us to conceptualize the inherently complex and multidimensional issues of dams' social impacts in a holistic manner. If commonly employed in academia (and possibly in practice), this framework would enable more transparent assessment and comparison of projects.« less
  • This paper concerns a discrete-time, link-based, dynamic user-optimal departure time/route choice model using the variational inequality approach. The model complies with a dynamic user-optimal equilibrium condition in which for each origin-destination pair, the actual route travel times experienced by travelers, regardless the departure time, is equal and minimal. A nested diagonalization procedure is proposed to solve the model. Numerical examples are then provided for demonstration and detailed elaboration for multiple solutions and Braess`s paradox.
  • The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recyclingmore » functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.« less