Pub Date : 1984-08-01DOI: 10.1016/0252-7308(84)90048-5
J.I.A Siddiqi
In this paper an experiment in which students who had been taught the principles of structured programming had to design a program is described. The designs were classified according to the choice of decomposition and a number of design characteristics. The results are discussed within the framework of problem solving. In particular, in this paper the use of such strategies as “incremental design” and “process the next item” as a basis for decomposition is identified. Furthermore, the results are interpreted in the context of current ideas on program design, and a relationship between the choice of decomposition, the likelihood of a correct design and the ease with which a designer produces a solution is proposed.
{"title":"An empirical investigation into the program design process","authors":"J.I.A Siddiqi","doi":"10.1016/0252-7308(84)90048-5","DOIUrl":"10.1016/0252-7308(84)90048-5","url":null,"abstract":"<div><p>In this paper an experiment in which students who had been taught the principles of structured programming had to design a program is described. The designs were classified according to the choice of decomposition and a number of design characteristics. The results are discussed within the framework of problem solving. In particular, in this paper the use of such strategies as “incremental design” and “process the next item” as a basis for decomposition is identified. Furthermore, the results are interpreted in the context of current ideas on program design, and a relationship between the choice of decomposition, the likelihood of a correct design and the ease with which a designer produces a solution is proposed.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 3","pages":"Pages 279-293"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90048-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86926113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-08-01DOI: 10.1016/0252-7308(84)90046-1
A.W Booth, B Sharp
Existing methods for subtitling television are time consuming and costly. Discussions are taking place at present between The Polytechnic, Wolverhampton, and the British Broadcasting Corporation (BBC) with the aim of defining a system which will go some part of the way to producing subtitles automatically. This paper provides a clear problem statement and describes a new method for subtitling based on submitting the “auto-cue” files to text reduction techniques. Some results are projected.
{"title":"A new approach to the automatic subtitling of television: A proposal","authors":"A.W Booth, B Sharp","doi":"10.1016/0252-7308(84)90046-1","DOIUrl":"10.1016/0252-7308(84)90046-1","url":null,"abstract":"<div><p>Existing methods for subtitling television are time consuming and costly. Discussions are taking place at present between The Polytechnic, Wolverhampton, and the British Broadcasting Corporation (BBC) with the aim of defining a system which will go some part of the way to producing subtitles automatically. This paper provides a clear problem statement and describes a new method for subtitling based on submitting the “auto-cue” files to text reduction techniques. Some results are projected.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 3","pages":"Pages 259-267"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90046-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79281871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-08-01DOI: 10.1016/0252-7308(84)90041-2
Peter F Linington
Standardization of open systems interconnection (OSI) has been in progress for several years. Two major meetings at the end of 1983 consolidated recent efforts. In this paper the current status of the OSI work is reviewed and some future developments are predicted.
{"title":"Progress in open systems standardization","authors":"Peter F Linington","doi":"10.1016/0252-7308(84)90041-2","DOIUrl":"10.1016/0252-7308(84)90041-2","url":null,"abstract":"<div><p>Standardization of open systems interconnection (OSI) has been in progress for several years. Two major meetings at the end of 1983 consolidated recent efforts. In this paper the current status of the OSI work is reviewed and some future developments are predicted.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 3","pages":"Pages 205-220"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90041-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90633839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-08-01DOI: 10.1016/0252-7308(84)90049-7
{"title":"The announcement of projects to expand the ASCII character sets","authors":"","doi":"10.1016/0252-7308(84)90049-7","DOIUrl":"https://doi.org/10.1016/0252-7308(84)90049-7","url":null,"abstract":"","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 3","pages":"Pages 295-296"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90049-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137439747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-08-01DOI: 10.1016/0252-7308(84)90043-6
M Gopalakrishnan, L.M Patnaik
In this paper the implementation and application of a microprocessor-based medium speed experimental local area network using a coaxial cable transmission medium are dealt with. A separate unidirectional control wire has been used in order to provide a collision-free and fair medium access arbitration. As an application of the network, the design of a packet voice communication system is discussed.
{"title":"Salan: A microprocessor-based medium speed experimental local area network","authors":"M Gopalakrishnan, L.M Patnaik","doi":"10.1016/0252-7308(84)90043-6","DOIUrl":"10.1016/0252-7308(84)90043-6","url":null,"abstract":"<div><p>In this paper the implementation and application of a microprocessor-based medium speed experimental local area network using a coaxial cable transmission medium are dealt with. A separate unidirectional control wire has been used in order to provide a collision-free and fair medium access arbitration. As an application of the network, the design of a packet voice communication system is discussed.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 3","pages":"Pages 229-240"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90043-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80815269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-05-01DOI: 10.1016/0252-7308(84)90024-2
Alexander W Booth
In this paper, research undertaken at Leicester Polytechnic into the computer transcription of Palantype code (the British equivalent of Stenotype code) is described. The work has been investigated by the British Broadcasting Corporation for the automatic subtitling of television to benefit the deaf and hard of hearing. The fundamentals of machine shorthand are explained and the problems of computer transcription are identified. Techniques developed to overcome these problems are also described in outline. The research is continuing at The Polytechnic, Wolverhampton, and negotiations are taking place with H.M. Stationery Office to investigate the possibility of transcribing the proceedings of the House of Commons by computer.
{"title":"The computer transcription of machine shorthand","authors":"Alexander W Booth","doi":"10.1016/0252-7308(84)90024-2","DOIUrl":"10.1016/0252-7308(84)90024-2","url":null,"abstract":"<div><p>In this paper, research undertaken at Leicester Polytechnic into the computer transcription of Palantype code (the British equivalent of Stenotype code) is described. The work has been investigated by the British Broadcasting Corporation for the automatic subtitling of television to benefit the deaf and hard of hearing. The fundamentals of machine shorthand are explained and the problems of computer transcription are identified. Techniques developed to overcome these problems are also described in outline. The research is continuing at The Polytechnic, Wolverhampton, and negotiations are taking place with H.M. Stationery Office to investigate the possibility of transcribing the proceedings of the House of Commons by computer.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 2","pages":"Pages 147-165"},"PeriodicalIF":0.0,"publicationDate":"1984-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90024-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91206889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-05-01DOI: 10.1016/0252-7308(84)90028-X
D.B Trafford
{"title":"CAD/CAM systems planning and implementation","authors":"D.B Trafford","doi":"10.1016/0252-7308(84)90028-X","DOIUrl":"10.1016/0252-7308(84)90028-X","url":null,"abstract":"","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 2","pages":"Pages 199-201"},"PeriodicalIF":0.0,"publicationDate":"1984-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90028-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77262237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-05-01DOI: 10.1016/0252-7308(84)90025-4
P Dines Larsen, Jens V Olsen
In this paper the graphics software system and standards developed in the Electronics Department, Risø National Laboratory, are described.
The high degree of versatility and standardization of the system is mainly a result of the need for powerful graphics tools that has arisen during the evolution of the RIKKE (a package for interactive automatic cause-consequence analysis also developed in the Electronics Department, Risø National Laboratory) interactive risk analysis system since the mid-1970s. Because of its generality the system is now installed at a number of minicomputer sites in Risø.
{"title":"A standardized device-independent graphics system","authors":"P Dines Larsen, Jens V Olsen","doi":"10.1016/0252-7308(84)90025-4","DOIUrl":"10.1016/0252-7308(84)90025-4","url":null,"abstract":"<div><p>In this paper the graphics software system and standards developed in the Electronics Department, Risø National Laboratory, are described.</p><p>The high degree of versatility and standardization of the system is mainly a result of the need for powerful graphics tools that has arisen during the evolution of the RIKKE (a package for interactive automatic cause-consequence analysis also developed in the Electronics Department, Risø National Laboratory) interactive risk analysis system since the mid-1970s. Because of its generality the system is now installed at a number of minicomputer sites in Risø.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 2","pages":"Pages 167-179"},"PeriodicalIF":0.0,"publicationDate":"1984-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90025-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87126564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1984-05-01DOI: 10.1016/0252-7308(84)90023-0
Marc C Lobelle
A method is proposed of reliably transferring datagrams consisting of sets of data structures, which are of arbitrary sizes and non-contiguously resident in memory, over local area networks without concern for the restrictions on packet format imposed by the characteristics of the actual network interface.
The transfer is performed as one atomic operation with minimal overhead; on the basis of a set of premises respected by many local area networks, it is possible to send a datagram as a sequence of packets without specific headers. The integrity of the transmission is verified by counting the received packets. Both the sender and the receiver must know the structure of the datagram. One acknowledgment packet is sent for the entire datagram.
Similar techniques of packet counting for local area networks have previously been used in specialized protocols for remote operations at Stanford and for file transfer at Cambridge. In the present paper, the techniques are used to provide a flexible and reliable datagram transfer mechanism while reducing copying and processing overhead in the communicating hosts.
With the proposed protocol, data items of any size are copied directly between the various different memory areas belonging to the user and protocol layers and the network driver.
{"title":"Datagrams transferred as message trains in local area networks","authors":"Marc C Lobelle","doi":"10.1016/0252-7308(84)90023-0","DOIUrl":"10.1016/0252-7308(84)90023-0","url":null,"abstract":"<div><p>A method is proposed of reliably transferring datagrams consisting of sets of data structures, which are of arbitrary sizes and non-contiguously resident in memory, over local area networks without concern for the restrictions on packet format imposed by the characteristics of the actual network interface.</p><p>The transfer is performed as one atomic operation with minimal overhead; on the basis of a set of premises respected by many local area networks, it is possible to send a datagram as a sequence of packets without specific headers. The integrity of the transmission is verified by counting the received packets. Both the sender and the receiver must know the structure of the datagram. One acknowledgment packet is sent for the entire datagram.</p><p>Similar techniques of packet counting for local area networks have previously been used in specialized protocols for remote operations at Stanford and for file transfer at Cambridge. In the present paper, the techniques are used to provide a flexible and reliable datagram transfer mechanism while reducing copying and processing overhead in the communicating hosts.</p><p>With the proposed protocol, data items of any size are copied directly between the various different memory areas belonging to the user and protocol layers and the network driver.</p></div>","PeriodicalId":100687,"journal":{"name":"Interfaces in Computing","volume":"2 2","pages":"Pages 131-146"},"PeriodicalIF":0.0,"publicationDate":"1984-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0252-7308(84)90023-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82832633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}