Serials spoken here: reports of conferences,institutes, and seminars

Abstract

Reports on the Ohio Valley Group of Technical Services Librarians (OVGTSL) Annual Conference, the April 2004 New England Technical Services Librarians (NETSL) Conference, the 2004 Acquisitions Institute at Timberline Lodge, and the 2004 Conference of the North American Serials Interest Group (NASIG).

Reports are from four conferences held in various parts of the United States and cover a wide range of topics. The Ohio Valley Group of Technical Services Librarians program emphasized the relationship between technical and public services. Education, both formal and continuing, was the theme for the New England Technical Services Librarians. Timberline Lodge hosted another Acquisitions Institute featuring sessions on new discoveries. The report on the 2004 North American Serials Group Annual Conference allows Conference Student Grant Award winner Chris Brady to include some personal reflections along with summaries of the sessions he attended.     

2008 NETSL Conference—Cohabiting and Colliding: Print and Electronic Resources

Abstract

This report discusses the program of the 2011 New England Technical Services Librarians (NETSL) annual spring conference, held on Friday, April 8 at the College of the Holy Cross in Worcester, Massachusetts and entitled “2020 Vision: A New Decade for Technical Services.” NETSL is a section of the New England Library Association and a regional group of the American Library Association.     

Mapping Our Way: New Formations in Technical Services: Ohio Valley Group of Technical Services Librarians Annual Conference

Abstract

The annual meeting of the Ohio Valley Group of Technical Services Librarians (OVGTSL) was held May 16–18, 2007, at the Holiday Inn-University Plaza in Bowling Green, Kentucky. One hundred twenty technical services librarians from Indiana, Ohio, Kentucky, and points beyond gathered for programming centered around the theme of “Mapping Our Way: New Formations in Technical Services.”     

Reports of Conferences,Institutes, and Seminars

Abstract

Late winter and early spring of 2009 was a busy conference time for librarians. Some of the conferences held during that time are reported herein: the American Library Association Midwinter Conference, January 23–28; Electronic Resources and Libraries (E&;RL), February 9–12; the North Carolina Serials Conference, March 27; the New England Technical Services Librarians' (NETSL) Spring Conference, April 17; and the Technical, Electronic and Digital Services Interest Group (TEDSIG) Spring Meeting, April 24.     

Reports of Conferences,Institutes, and Seminars

Abstract

Reports from the annual American Library Association Conference, the Ohio Valley Group of Technical Services Librarians' Conference, and the Acquisitions Institute at Timberline Lodge. Serials Review 2002; 28:63–73.     

“Serials at Warp Speed: Navigating Transitions,” the 2007 North Carolina Serials Conference

Abstract

Reports on four major serials conferences, the 2007 North Carolina Serials Conference, the 2007 meeting of the Ohio Valley Group of Technical Services Librarians, the Canadian Library Association’s 2007 Pre-Conference, and the 2007 North American Serials Interest Group Conference.     

Reports of Conferences,Institutes, and Seminars

Abstract

Reports from a spring 2002 New England Technical Services Librarians conference on standards, the 2002 Acquisitions Institute at Timberline Lodge, and a program on “AACR2 Chapter 12 Revised” held during the 2002 American Library Association Annual Conference. Serials Review 2002; 28:327–338.     

Electronic Resources Workflow: Design,Analysis and Technologies for an Overdue Solution

During the summer of 2013, a joint team involving Duke University Libraries and IBM spent three months configuring IBM Business Process Manager to improve electronic resources workflows in the Libraries’ Technical Services department. The resulting workflow showcases the application's ability to transform the management of online databases. This article will provide an overview of the “before” and “after” database workflow, with a demo of the new system and its integration points with other tools.     

CONSER Editing Guide

Abstract

The 2011 American Library Association conference took place June 23–28 at the Morial Convention Center in New Orleans, Louisiana. This report summarizes several programs and forums including the Association for Library Collections and Technical Services (ALCTS) Continuing Resources Section, Electronic Resources Interest Group program; Holdings Forum: Universal and Repurposed Holdings Information: Emerging Initiatives and Projects; the RDA Update Forum; and the Continuing Resources Cataloging Committee Update Forum.     

Little Magazine Interview Index 2006

Abstract

Portland State University collection development librarian Jill Emery talks with members of the Orbis Cascade Alliance demand driven acquisitions implementation team, EBL, and YBP Library Services about their participation in a pilot project to acquire e-books that are accessible to and jointly owned by the thirty-seven member libraries of the Orbis Cascade Alliance.     

Reports of Conferences,Institutes, and Seminars

Abstract

This quarter’s column offers a report from the 2018 annual meeting of the Ex Libris Users of North America (ELUNA), as well as coverage of sessions from the annual meeting of the Northern Ohio Technical Services Librarians (NOTSL). A handful of reports were also collected from courses offered at the FORCE11 Scholarly Communications Institute. Topics covered include features within ExLibris’s Alma library that support print serials operations, current and future developments in serials librarianship, and critiques about open peer review.     

Scholarly Communications Training: Professional Development for the Next Generation of Scholars

Abstract

Many campuses are seeing increased needs for support in scholarly communications areas such as open access, research identity management, scholarship metrics, and related topics. This article discusses a professional development program that addresses scholarly communications needs for online and in-person graduate students and faculty at UNC Greensboro (UNCG), through a collaborative, interdepartmental effort that brings together librarians from the departments of Research, Outreach, and Instruction (ROI) and Technical Services. The authors provide a brief overview of the literature related to scholarly communications needs and training in academic libraries and discuss the UNCG program’s inception, modules, format, assessment, and future directions.     

Serials Spoken Here

Abstract

This quarter's column features a report from the Ohio Valley Group of Technical Services Librarians (OVGTSL), held May 15–17, 2013, in Richmond, KY; the 29th Annual North American Serials Interest Group (NASIG) Conference, held June 5–9, 2013, in Buffalo, NY, including a separate report on the June 6 RDA &; Serials preconference; and, the American Library Association's Annual Conference, held June 27–July 2, 2013, in Chicago, IL.     

Analysis of an unreliable MX/G1G2/1/repeated service queue with delayed repair under randomized vacation policy

Abstract

In this article we consider an unreliable M^X/G/1 queue with two types of general heterogeneous service and optional repeated service subject to server’s break down and delayed repair under randomized vacation policy. We assume that customer arrive to the system according to a compound Poisson process. The server provides two types of general heterogeneous service and a customer can choose either type of service before its service start. After the completion of either type of service, the customer has the further option to repeat the same type of service once again. While the server is working with any types of service or repeated service, it may breakdown at any instant. Further the concept of randomized vacation is also introduced. For this model, we first derive the joint distribution of state of the server and queue size by considering both elapsed and remaining time, which is one of the objective of this article. Next, we derive Laplace Stieltjes transform of busy period distribution. Finally, we obtain some important performance measure and reliability indices of this model.     

An Interview with Sam Brooks

Abstract

Jeff Slagell interviewed Sam Brooks, the senior vice president of sales and marketing for EBSCO Information Services, in December 2001. In this interview, Brooks discusses the debate on embargoes and exclusivity agreements in full-text databases that took place last year on discussion lists and in numerous articles. He explains EBSCO's role in working with publishers and librarians in providing full-text database services. Brooks also describes his work with the eIFL Direct Project. Serials Review 2002; 28:142–150.     

The Waiting Time Distribution of a Type k Customer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs

Abstract

This paper presents an improved method to calculate the delay distribution of a type k customer in a first-come-first-serve (FCFS) discrete-time queueing system with multiple types of customers, where each type has different service requirements, and c servers, with c = 1, 2 (the MMAP[K]/PH[K]/c queue). The first algorithms to compute this delay distribution, using the GI/M/1 paradigm, were presented by Van Houdt and Blondia [Van Houdt, B.; Blondia, C. The delay distribution of a type k customer in a first come first served MMAP[K]/PH[K]/1 queue. J. Appl. Probab. 2002, 39 (1), 213–222; The waiting time distribution of a type k customer in a FCFS MMAP[K]/PH[K]/2 queue. Technical Report; 2002]. The two most limiting properties of these algorithms are: (i) the computation of the rate matrix R related to the GI/M/1 type Markov chain, (ii) the amount of memory needed to store the transition matrices A _l and B _l . In this paper we demonstrate that each of the three GI/M/1 type Markov chains used to develop the algorithms in the above articles can be reduced to a QBD with a block size which is only marginally larger than that of its corresponding GI/M/1 type Markov chain. As a result, the two major limiting factors of each of these algorithms are drastically reduced to computing the G matrix of the QBD and storing the 6 matrices that characterize the QBD. Moreover, these algorithms are easier to implement, especially for the system with c = 2 servers. We also include some numerical examples that further demonstrate the reduction in computational resources.     

Book-a-Book: Facilitating Access to Learning Materials for Students With Disabilities

Abstract

Until 2019, each higher education institution in Flanders had to develop their own workflows to handle requests for digital study materials for students with disabilities. At KU Leuven these requests are processed by KU Leuven Libraries Central Services. This unit, among other things, supports the core tasks of KU Leuven Libraries in the area of acquisitions and licensing negotiations with publishers. This article will focus on the creation and development of Book-a-Book, which has its origin in the service the KU Leuven Libraries Central Services has been providing for students with disabilities for KU Leuven students since 2011. Book-a-Book is a web application that facilitates access to learning materials for students with disabilities enrolled in Flemish higher education institutions. It is the first online tool to serve all higher education students with disabilities in Flanders and is the result of a collaboration between The Support Center for Inclusive Higher Education (SIHO), KU Leuven Libraries, and LIBIS (Leuven Integrated Library and Information System). SIHO is as a collaboration between the associations of the Flemish universities and colleges on the one side, and the Flemish government on the other side. The core responsibility of the SIHO lies in the support of all higher education institutions in realizing inclusive higher education for students with a disability. On September 12, 2019, Book-a-Book was launched on the international conference “Enhancing Student Experience: Innovative Support Tools for Students with Disabilities” in Brussels, Belgium.     

Transient analysis of a finite source discrete-time queueing system using homogeneous Markov system with state size capacities (HMS/c)

Abstract

In this article, a finite source discrete-time queueing system is modeled as a discrete-time homogeneous Markov system with finite state size capacities (HMS/c) and transition priorities. This Markov system is comprised of three states. The first state of the HMS/c corresponds to the source and the second one to the state with the servers. The second state has a finite capacity which corresponds to the number of servers. The members of the system which can not enter the second state, due to its finite capacity, enter the third state which represents the system's queue. In order to examine the variability of the state sizes recursive formulae for their factorial and mixed factorial moments are derived in matrix form. As a consequence the probability mass function of each state size can be evaluated. Also the expected time in queue is computed by means of the interval transition probabilities. The theoretical results are illustrated by a numerical example.     

ML and Bayes estimation in a two-phase tandem queue with a second optional service and random feedback

ABSTRACT

In this article, we consider a two-phase tandem queueing model with a second optional service and random feedback. The first phase of service is essential for all customers and after the completion of the first phase of service, any customer receives the second phase of service with probability α, feedback to the tail of the first queue with probability β if the service is not successful and leaves the system with probability 1 ? α ? β. In this model, our main purpose is to estimate the parameters of the model, traffic intensity, and mean system size, in the steady state, via maximum likelihood and Bayesian methods. Furthermore, we find asymptotic confidence intervals for mean system size. Finally, by a simulation study, we compute the confidence levels and mean length for asymptotic confidence intervals of mean system size with a nominal level 0.95.     

Stochastic monotonicity and comparability of Markov chains with block-monotone transition matrices and their applications to queueing systems

ABSTRACT

Motivated by various applications in queueing theory, this article is devoted to the stochastic monotonicity and comparability of Markov chains with block-monotone transition matrices. First, we introduce the notion of block-increasing convex order for probability vectors, and characterize the block-monotone matrices in the sense of the block-increasing order and block-increasing convex order. Second, we characterize the Markov chain with general transition matrix by martingale and provide a stochastic comparison of two block-monotone Markov chains under the two block-monotone orders. Third, the stochastic comparison results for the Markov chains corresponding to the discrete-time GI/G/1 queue with different service distributions under the two block-monotone orders are given, and the lower bound and upper bound of the Markov chain corresponding to the discrete-time GI/G/1 queue in the sense of the block-increasing convex order are found.