Please use this identifier to cite or link to this item: http://nopr.niscpr.res.in/handle/123456789/28083
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBalasubramanian, V-
dc.contributor.authorSuryanarayana, N-
dc.date.accessioned2014-04-15T11:09:41Z-
dc.date.available2014-04-15T11:09:41Z-
dc.date.issued1979-03-
dc.identifier.issn0975-2404 (Online); 0972-5423 (Print)-
dc.identifier.urihttp://hdl.handle.net/123456789/28083-
dc.description42-48en_US
dc.description.abstractThe systematic determination of behaviour of serials processing based on the present publication strategies forms the nucleus of the paper. A great deal of attention has been given towards claiming of issues non-received. The total system serial processing has been decomposed into four modules-Fresh subscription, Renewal subscription, Recording of receipts and Claiming of issues not received .The non-numerical algorithm provided as an appendix, comprising all these modules, will pave the way for programming The problems encountered in each module has been expounded for an optimal solution, Two methods for claiming gap issues and consecutive issues are suggested and the latter one in described in terms of a mathematical model which not only provides better understanding of the problem, but also exposes the computational tasks. In order to eliminate human intervention by all means in claiming, a Performa of ‘CLAIM FORM’ which can be stored in work-area is also depicted in Appendix.en_US
dc.language.isoen_USen_US
dc.publisherNISCAIR-CSIR, Indiaen_US
dc.rights CC Attribution-Noncommercial-No Derivative Works 2.5 Indiaen_US
dc.sourceALIS Vol.26(1-4) [March-December 1979]en_US
dc.titleSystem analysis in serials control: A 'claim-oriented' non-numerical algorithmen_US
dc.typeArticleen_US
Appears in Collections:ALIS Vol.26(1-4) [March-December 1979]

Files in This Item:
File Description SizeFormat 
ALIS 26(1-4) 42-48.pdf1.28 MBAdobe PDFView/Open


Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.