5,222 research outputs found
Bel Jour: a discipline-specific portal to periodicals
No full textConvenient, subject-based access to current periodicals can be difficult to achieve in today’s mixed and changing journals environment. This paper describes the creation of a web-accessible database of journals in business and economics, using Microsoft Access and ColdFusion. Bel Jour, the Business and Economics Locator for Journals at Rutgers, provides value-added descriptive information about a specific subject-based journal collection, along with convenient access to content from this collection. Although the actual journal collection is dispersed among many physical and online locations, Bel Jour provides a single, virtual point of access for researchers in the discipline.Published in print as Womack, Ryan. “Bel Jour: a discipline-specific portal to periodicals.” Information Technology and Libraries, Volume 21, Number 2, June 2002, pp. 81-86.Peer reviewe
Career Exploration Resources
No full textBibliography of career resourcesAuthor’s version of paper chapter published as
Ryan Womack, “Career Exploration Resources”, pp. 32-37, in Gary W. White (Ed.), Help Wanted: Job and Career Information Resources, RUSA Occasional Paper, no. 26 (2003
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions
No full textWe consider the problem of designing low-redundancy codes in settings where one must correct deletions in conjunction with substitutions or adjacent transpositions; a combination of errors that is usually observed in DNA-based data storage. One of the most basic versions of this problem was settled more than 50 years ago by Levenshtein, who proved that binary Varshamov-Tenengolts codes correct one arbitrary edit error, i.e., one deletion or one substitution, with nearly optimal redundancy. However, this approach fails to extend to many simple and natural variations of the binary single-edit error setting. In this work, we make progress on the code design problem above in three such variations:
- We construct linear-time encodable and decodable length-n non-binary codes correcting a single edit error with nearly optimal redundancy log n+O(log log n), providing an alternative simpler proof of a result by Cai, Chee, Gabrys, Kiah, and Nguyen (IEEE Trans. Inf. Theory 2021). This is achieved by employing what we call weighted VT sketches, a new notion that may be of independent interest.
- We show the existence of a binary code correcting one deletion or one adjacent transposition with nearly optimal redundancy log n+O(log log n).
- We construct linear-time encodable and list-decodable binary codes with list-size 2 for one deletion and one substitution with redundancy 4log n+O(log log n). This matches the existential bound up to an O(log log n) additive term
High Speed, High Price, High Demand: Business Internet Resources and Databases in American Academic Libraries [presentation]
No full textPresentation from Central Asia 2002 conference. Cite as
Womack, Ryan. “High Speed, High Price, High Demand: Business Internet Resources and Databases in American Academic Libraries.” Central Asia 2002: Internet and Library, Information Resources in Science, Culture, Education, and Business, Bukhara, Uzbekistan, October 16, 2002
Data Visualization and Information Literacy
No full textThis Pecha Kuchka discusses the relationship between data visualization and information literacy, and makes recommendations for which aspects of data visualization are valuable for general inclusion in information literacy goals.Presented at IASSIST 40th Annual Conference, "Aligning Data and Research Infrastructure", Toronto, Canada, June 5, 2014.Womack, Ryan (2014 June). Data visualization and information literacy. Pecha Kuchka presented at the IASSIST conference, Toronto, ON
Author Talk - Ryan Rott
No full textFlyer for an author talk by Ryan Rott, University of Michigan law student.https://repository.law.umich.edu/posters/1063/thumbnail.jp
Author Talk - Ryan Rott
No full textFlyer for an author talk by Ryan Rott, University of Michigan law student.https://repository.law.umich.edu/posters/1063/thumbnail.jp
The Rutgers Experience: Building Data Management and Repository Services
No full textDescribes the development and status as of 2014 of efforts to archive research data in RUcore, the Rutgers University Community RepositoryPresented to NN/LM MAR Research Data Management Symposium, New York, NY, April 28, 2014.Womack, Ryan (2014 April). The Rutgers Experience: Building Data Management and Repository Services. Presented at National Network of Libraries of Medicine, Middle Atlantic Region, Research Data Management Symposium, New York, NY
Bonds Online
No full textReview of the website Bonds Online.This is a preprint of "Bonds Online", published in the Journal of Business and Finance Librarianship, vol. 5, issue 4, pp. 59-65. The article is available at http://dx.doi.org/10.1300/J109v05n04_0
Basic Business Dictionaries Compared
No full textThis article compares the relative merits of five business dictionaries addressed to a general business audience. The distinctive features of each dictionary are described, and definitions and range of coverage are compared in order to discover the distinctive strengths and weaknesses of each dictionary.This is an Author's Original Manuscript of an Article whose final and definitive form, the Version of Record, has been published in the Journal of Business and Finance Librarianship (2005), available online at: http://www.tandfonline.com/10.1300/J109v10n04_02Peer reviewe
- …
