Bibliographic Control of Serial Publications

An important problem with serials is bibliographic control. What good does it do for libraries to select, acquire, record, catalog, and bind large holdings of serial publications if the contents of those serials remain a mystery to all except the few who have the opportunity to examine selected journals of continuing personal interest and have discovered some magic way of retaining the gist of the contents? Bibliographic control is the indexing and abstracting of the contents or guts of what is included in the serials. It is this control, provided by secondary publishing services, which this article will discuss. Just as there are problems with serials in general, there are some easily identifiable problems connected with their bibliographic control including: volume, overlap, costs, elements and methods, and a few other miscellaneous considerations. Some history of bibliographic control will also put the current problems in a helpful perspective. Hereafter "bibliographic control" will be designated by the term "abstracting and indexing," one of these alone, or the shorter "a & i." (I do distinguish between abstracting and indexing and believe that they are not in order of importance and difficulty.) Although a & i do provide bibliographic control, this paper will not discuss cataloging, tables of contents, back-of-the-book indexes, year-end indexes, cumulative indexes, lists of advertisers, or bibliographies. If there is to be control, there must always be indexing. Abstracting is a short cut, a convenience, and perhaps a bibliographic luxury which may be now, or is fast becoming, too rich, in light of other factors to be discussed, for library blood and for the users of libraries especially for the users of indexes who may not depend upon the library interface. Abstracting, though, provides a desirable control, and one which will continue to be advocated.published or submitted for publicatio

Termination of rewriting strategies: a generic approach

We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modeled by proof trees, generated by alternatively applying narrowing and abstracting steps. The induction principle is applied through the abstraction mechanism, where terms are replaced by variables representing any of their normal forms. The induction ordering is not given a priori, but defined with ordering constraints, incrementally set during the proof. Abstraction constraints can be used to control the narrowing mechanism, well known to easily diverge. The generic method is then instantiated for the innermost, outermost and local strategies.Comment: 49 page

Criminology and penology abstracts: analysis

ReviewAn analysis of Criminology and Penology Abstracts is "An international abstracting service covering the etiology of crime and juvenile delinquency, the control and treatment of offenders, criminal procedure, and the administration of justice

Abstracting the Traffic of Nonlinear Event-Triggered Control Systems

Scheduling communication traffic in networks of event-triggered control (ETC) systems is challenging, as their sampling times are unknown, hindering application of ETC in networks. In previous work, finite-state abstractions were created, capturing the sampling behaviour of LTI ETC systems with quadratic triggering functions. Offering an infinite-horizon look to all sampling patterns of an ETC system, such abstractions can be used for scheduling of ETC traffic. Here we significantly extend this framework, by abstracting perturbed uncertain nonlinear ETC systems with general triggering functions. To construct an ETC system's abstraction: a) the state space is partitioned into regions, b) for each region an interval is determined, containing all intersampling times of points in the region, and c) the abstraction's transitions are determined through reachability analysis. To determine intervals and transitions, we devise algorithms based on reachability analysis. For partitioning, we propose an approach based on isochronous manifolds, resulting into tighter intervals and providing control over them, thus containing the abstraction's non-determinism. Simulations showcase our developments