Janey K. Cringean
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Janey K. Cringean has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Peter Willett
3 shared publicationsGordon A. Manson
2 shared publicationsP. Willett
Departments of Information Studies, University of Sheffield, Western Bank, Sheffield S10 2TN, U.K.
2 shared publicationsAndrew R. Poirrette
Department of Information Studies, University of Sheffield, Western Bank, Sheffield S10 2TN, U.K.
1 shared publication- Brian K. Tanner
Durham University (Durham, United Kingdom)
1 shared publication Catherine A. Pepperrell
Department of Information Studies, University of Sheffield, Western Bank, Sheffield S10 2TN, U.K.
1 shared publication
Latest Publications
- 31 December 1991
- Published by Elsevier in Information Processing & Management
- Vol. 27 (4) , 265-283
Network design for the implementation of text searching using a multicomputer
- 31 December 1991
- Published by Elsevier in Information Processing & Management
- Vol. 27 (4) , 265-283
Network design for the implementation of text searching using a multicomputer
- 31 December 1990
- Published by Elsevier in Tetrahedron Computer Methodology
- Vol. 3 (1) , 37-46
Selection of screens for three-dimensional substructure searching
- 31 December 1990
- Published by Elsevier in Tetrahedron Computer Methodology
- Vol. 3 (1) , 37-46
Selection of screens for three-dimensional substructure searching
- Open Access
- 1 December 1989
- Published by Association for Computing Machinery (ACM)
- p. 429-453
Parallel text searching in serial files using a processor farm
- 1 December 1989
- Published by Association for Computing Machinery (ACM)
- p. 429-453
Open AccessParallel text searching in serial files using a processor farm
- 1 January 1989
- Published by Elsevier in Information Processing & Management
- Vol. 25 (6) , 599-614
Retrieving documents by plausible inference: An experimental study
- 1 January 1989
- Published by Elsevier in Information Processing & Management
- Vol. 25 (6) , 599-614
Retrieving documents by plausible inference: An experimental study
- 1 January 1989
- Published by SAGE Publications in Journal of Studies in International Education
- Vol. 15 (4-5) , 211-222
Subgraphs of reduced chemical graphs as screens for substructure searching of specific chemical structures
- 1 January 1989
- Published by SAGE Publications in Journal of Studies in International Education
- Vol. 15 (4-5) , 211-222
Subgraphs of reduced chemical graphs as screens for substructure searching of specific chemical structures
- 1 December 1988
- Published by SAGE Publications in Journal of Information Science
- Vol. 14 (6) , 335-345
Efficiency of text scanning in bibliographic databases using microprocessor-based, multiprocessor networks
This paper reports an evaluation of the efficiency of text scanning achievable from a microprocessor-based, multi processing system which uses Inmos transputers. The Boyer-Moore pattern matching algorithm was used to search 35 natural language quenes against a file of 1000 titles and abstracts taken from the Library and Information Science Ab stracts database. A model of searching using a singly-linked chain containing up to 11 transputers was carried out: the maximum speed-up obtained with this size of network was 10.4 with a processor utilization of 0.95, both figures being close to the ideal of 11.0 and 1.0. Expenments with a nearest neighbour searching algorithm for serial document files demonstrate the need to keep the processors fully occupied with computational work if a high degree of speed-up is to be obtained.
- 1 December 1988
- Published by SAGE Publications in Journal of Information Science
- Vol. 14 (6) , 335-345
Efficiency of text scanning in bibliographic databases using microprocessor-based, multiprocessor networks
This paper reports an evaluation of the efficiency of text scanning achievable from a microprocessor-based, multi processing system which uses Inmos transputers. The Boyer-Moore pattern matching algorithm was used to search 35 natural language quenes against a file of 1000 titles and abstracts taken from the Library and Information Science Ab stracts database. A model of searching using a singly-linked chain containing up to 11 transputers was carried out: the maximum speed-up obtained with this size of network was 10.4 with a processor utilization of 0.95, both figures being close to the ideal of 11.0 and 1.0. Expenments with a nearest neighbour searching algorithm for serial document files demonstrate the need to keep the processors fully occupied with computational work if a high degree of speed-up is to be obtained.
- 1 January 1987
- Published by Elsevier in Progress in Crystal Growth and Characterization
- Vol. 14, 403-424
Real-time and stroboscopic topography
- 1 January 1987
- Published by Elsevier in Progress in Crystal Growth and Characterization
- Vol. 14, 403-424
Real-time and stroboscopic topography