{"title":"Performance study of a LAN based image server","authors":"S. Hauser, R. Mittu, C. Rivera, G. Thoma","doi":"10.1109/PCCC.1991.113873","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113873","url":null,"abstract":"The objective is to predict the performance of a practical multi-user system. A prototype distributed system of AT-class computers for multi-user retrieval of electronic document images is described. The prototype system is used as a testbed in which response times are measured, with auxiliary computers simulating additional users. An image server operating on a local-area-network (LAN) and retrieving files from write only read many optical disks includes three potential contributors to a slow receive time: large files, the optical disk drive interface and transmission over a LAN. The authors describe improved receive time achieved through an enhanced optical disk interface, and describe the quantitative effect of Ethernet traffic and multiple users on receive time. Careful selection or design of the optical disk subsystem will reduce the contribution of this component to overall receive time. Of particular importance is the ability of the subsystem to buffer data as it is read from the optical disk. The authors describe a single server system that should be able to support up to five users simultaneously with an average receive time of 0.9 s or less, or to eight users simultaneously with an average receive time of 1.6 s or less.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897229","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}
{"title":"Evaluation of double sided periodic substitution (DSPS) method for recovering missing speech in packet voice communications","authors":"J. Tang","doi":"10.1109/PCCC.1991.113848","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113848","url":null,"abstract":"The author proposes a DSWS (double sides waveform substitution) method and a DSPS (double sides periodic substitution) for recovering missing speech. Recovering missing speech is an important problem in packet voice communications, since missing speech is a major impairment in packet network communications. The author investigates all estimation techniques for packets containing 16 ms of speech and takes comparison tests of each technique by a subjective test (opinion test) and an objective test (LPC spectral distortion). These tests indicated that the most effective estimation is the DSPS method, which extends the acceptable ratio of missing packets of 10% by the previous method, to 20% in the experimental results.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122176592","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}
{"title":"A white box analysis of concurrent system designs","authors":"S. Becker, A. Hevner","doi":"10.1109/PCCC.1991.113830","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113830","url":null,"abstract":"An effective approach is demonstrated for the analysis of concurrent system design in box structures. Potential clear box designs at each level of the box structure usage hierarchy are termed white boxes and are evaluated for design correctness (i.e. consistency and closure) and estimated performance. A correct design with the best estimated performance can be selected as the final clear box. For deterministic concurrent designs, the authors present rigorous methods to evaluate design correctness. For non-deterministic design the authors resort to the use of a Petri-net model of the white box. By implementing the Petri-net model on an automated analysis tool, they evaluate correctness criteria of fairness, mutual exclusion, and liveness, and such performance criteria as resource utilization and throughput.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117226026","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}
{"title":"A dynamic token-based distributed mutual exclusion algorithm","authors":"Yin Chang, M. Singhal, M.T. Liu","doi":"10.1109/PCCC.1991.113817","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113817","url":null,"abstract":"The authors present a dynamic token-based mutual exclusion algorithm for distributed systems. In the algorithm, a site invoking mutual exclusion sends token request messages to a set of sites possibly holding the token as opposed to all the sites as in the algorithm proposed by I. Suzuki and T. Kasami (1985). A request set is used to record the identifiers of such a set of sites in the system. The algorithm is dynamic because the request set is dynamically changed as the algorithm is executed. As the size of the request set is reduced, the number of the messages exchanged per critical section (CS) execution is reduced. Compared with Suzuki and Kasami's algorithm, the proposed algorithm can reduce the number of the messages exchanged by 40% when the traffic is light. Finally, the authors discuss relationship between the token-based and non-token-based mutual exclusion algorithms. This relationship motivated the authors to design such a dynamic token-based algorithm.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126764623","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}
{"title":"The effect of AI on other fields of research","authors":"R. Parikh","doi":"10.1109/PCCC.1991.113904","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113904","url":null,"abstract":"The author suggests that artificial intelligence (AI) has brought about an integration of various, apparently unrelated enterprises and has contributed to the enrichment of a number of fields. Topics of interest to AI include reasoning about knowledge, belief and modalities, temporal reasoning, non-monotonic reasoning, reasoning about vagueness, reasoning about uncertainty, and legal reasoning. These topics are briefly discussed.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127400601","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}
{"title":"Specification refinement using transformation-based tools","authors":"Y.-K. Hsu, R. LeBlanc","doi":"10.1109/PCCC.1991.113831","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113831","url":null,"abstract":"The transformational approach is a formal method for program construction that allows refinement to be carried out using mechanical manipulations. The authors describe an alternative idea for supporting transformations that emphasizes the use of integrated tools instead of individual rules. These tools provide the mechanism for coordinating a generic design concept with the use of transformation rules. In particular, they allow the user to combine the formulation of a design and its application during the refinement process. The authors describe the tools and give examples illustrating their application. A brief description of the methodology and specification notation is also provided.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128273209","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}
{"title":"Direct-detection APD-based optical CDMA using orthogonal signalings","authors":"A. W. Lam","doi":"10.1109/PCCC.1991.113857","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113857","url":null,"abstract":"Direct-detection optical, code-division multiple-access (CDMA) communication systems with avalanche photodiode (APD) photodetectors are investigated. Chernoff upper bound, modified Chernoff upper bound, and Gaussian approximation of the probability of bit error (pbe) are presented for general APDs and (0, 1)-valued optical signature sequences. Multiple-user interference, shot-noise, and receiver thermal noise effects on the pbe are studied in detail. Equal-weight orthogonal signaling formats that do not require dynamic estimation of the receiver threshold are studied. The results suggest that orthogonal signaling schemes are preferable to the on-off orthogonal signaling schemes. It is also shown that prime codes are much better than the optical orthogonal codes for optical code-division multiplexing.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123741804","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}
{"title":"Interleaved trellis coded spread-spectrum for Rician fading channels","authors":"B. Woerner, W. Stark","doi":"10.1109/PCCC.1991.113845","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113845","url":null,"abstract":"A direct-sequence spread-spectrum communication system which uses a form of trellis coding is considered. The authors analyze the performance of this system for a channel model which includes the effects of multiple-access interference, Gaussian noise and Rician fading. Upper and lower bounds on the probability of occurrence of dominant error events are obtained by modeling the continuous probability density functions of noise and interference as discrete probability mass functions. Bit error rates are reported for coded and uncoded systems with equivalent power, bandwidth and transmission rates. It is found that while coded systems without interleaving yield only modest performance improvements over uncoded systems, coded systems with interleaving perform dramatically better.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133210251","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}
{"title":"An exercise in verifying concurrent programs in industry: the I/O subsystem","authors":"M. G. Staskauskas","doi":"10.1109/PCCC.1991.113829","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113829","url":null,"abstract":"The author describes the formal verification of a portion of an existing mainframe operating system using the UNITY methodology proposed by K.M. Chandy and J. Misra (1988). The UNITY methodology consists of a programming notation and a logic for specifying and reasoning about properties of parallel programs. The author discusses the steps involved in specifying the operating system, deriving from the specification a correct UNITY program, and using the latter to drive the assembly language implementation of the system. He also comments on his experience in applying a formal methodology in the context of a large software project.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133938146","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}
{"title":"Access controls for open architecture in intelligent networks","authors":"C.-F. Yu","doi":"10.1109/PCCC.1991.113867","DOIUrl":"https://doi.org/10.1109/PCCC.1991.113867","url":null,"abstract":"The author investigates the security issues and implications in implementing an open network architecture (ONA) in intelligent networks (INs). A view of technical limitations to ONA in IN is developed from the security standpoint. Specifically, access controls for ONA in IN are investigated. The author describes a multi-level functional component (FC) approach to ONA in an IN. With multi-level FCs, an IN gains flexible and finer grain control of access to network resources. The author advocates using high-level FCs as basic service elements (BSE) offerings in IN. The advantage is that high-level FCs gain a higher degree of security and integrity control.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130957980","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}