TORNET is an experimental local area computer network presently being designed and built in the Computer Group Laboratory of the Department of Electrical Engineering at the University of Toronto. The network consists of a number of local rings, each attached to a central ring. The local rings employ a variation on the slotted-ring format that uses a limited insertion technique to achieve reasonable response times for character traffic among many devices and small computers. Two fixed-length packet formats (one byte or 128 bytes of data) are used on the local rings. Only the longer format is used on the central ring which generally provides record level access to shared specialized equipment. The main objective in the local ring design is a low-cost port for inexpensive terminals, sensors, etc. The paper concentrates on the functional characteristics of the local rings, including delay-throughput comparisons with other well-known ring schemes.
{"title":"TORNET: A local area network","authors":"Z. Vranesic, V. Hamacher, W. Loucks, S. Zaky","doi":"10.1145/800081.802671","DOIUrl":"https://doi.org/10.1145/800081.802671","url":null,"abstract":"TORNET is an experimental local area computer network presently being designed and built in the Computer Group Laboratory of the Department of Electrical Engineering at the University of Toronto. The network consists of a number of local rings, each attached to a central ring. The local rings employ a variation on the slotted-ring format that uses a limited insertion technique to achieve reasonable response times for character traffic among many devices and small computers. Two fixed-length packet formats (one byte or 128 bytes of data) are used on the local rings. Only the longer format is used on the central ring which generally provides record level access to shared specialized equipment. The main objective in the local ring design is a low-cost port for inexpensive terminals, sensors, etc. The paper concentrates on the functional characteristics of the local rings, including delay-throughput comparisons with other well-known ring schemes.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116204832","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}
A. Buzo, Horacio G. Martinez, C. Rivera, A. Jazcilevich
We describe an application of a recently developed speech compression technique to automatic recognition of isolated words (from a given dictionary). The scheme maps sampled speech, from a given word, into a finite codebook (of the same size as the dictionary) using linear predictive coding (LPC) all-pole models and a minimum distortion or nearest neighbor rule between all samples from the given word and the codewords from the codebook. Standard LPC techniques are used to design the codebook, but the final system requires no on-line LPC analysis.
{"title":"Isolated word recognition based upon source coding techniques","authors":"A. Buzo, Horacio G. Martinez, C. Rivera, A. Jazcilevich","doi":"10.1145/800081.802684","DOIUrl":"https://doi.org/10.1145/800081.802684","url":null,"abstract":"We describe an application of a recently developed speech compression technique to automatic recognition of isolated words (from a given dictionary). The scheme maps sampled speech, from a given word, into a finite codebook (of the same size as the dictionary) using linear predictive coding (LPC) all-pole models and a minimum distortion or nearest neighbor rule between all samples from the given word and the codewords from the codebook. Standard LPC techniques are used to design the codebook, but the final system requires no on-line LPC analysis.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594063","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}
This paper introduces four new digital signature schemes for computer communication networks. These involve one or more arbitrators who validate and authenticate messages and signatures without having access to the actual contents of the messages.
{"title":"Digital signature schemes for computer communication networks","authors":"H. Meijer, S. Akl","doi":"10.1145/800081.802657","DOIUrl":"https://doi.org/10.1145/800081.802657","url":null,"abstract":"This paper introduces four new digital signature schemes for computer communication networks. These involve one or more arbitrators who validate and authenticate messages and signatures without having access to the actual contents of the messages.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133162763","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：