Pub Date : 1992-04-01DOI: 10.1109/PCCC.1992.200579
S. Urban, M. Desiderio, L. Delcambre
The organization and presentation of constraints within a constraint explanation tool known as CONTEXT is described. CONTEXT provides a means for transforming constraints into propagation rules for actively maintaining constraints. The focus is on the functionality of CONTEXT as a constraint explanation tool, describing a structure known as explanation trees. Explanation trees provide a basis for the presentation of constraints, the validation of constraint structures, the identification of propagation actions, and query processing for constraint checking at execution time. The primary contribution of explanation trees within CONTEXT is the manner in which they support the explanation of schema constraints from the point of view of any relevant database update operation.<>
{"title":"Explanation trees in CONTEXT: a constraint explanation tool","authors":"S. Urban, M. Desiderio, L. Delcambre","doi":"10.1109/PCCC.1992.200579","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200579","url":null,"abstract":"The organization and presentation of constraints within a constraint explanation tool known as CONTEXT is described. CONTEXT provides a means for transforming constraints into propagation rules for actively maintaining constraints. The focus is on the functionality of CONTEXT as a constraint explanation tool, describing a structure known as explanation trees. Explanation trees provide a basis for the presentation of constraints, the validation of constraint structures, the identification of propagation actions, and query processing for constraint checking at execution time. The primary contribution of explanation trees within CONTEXT is the manner in which they support the explanation of schema constraints from the point of view of any relevant database update operation.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072852","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200545
A. Datta, R. D. Javagal, S. Ghosh
The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<>
{"title":"An algorithm for preventing deadlocks in distributed systems","authors":"A. Datta, R. D. Javagal, S. Ghosh","doi":"10.1109/PCCC.1992.200545","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200545","url":null,"abstract":"The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116343091","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200576
I. Remedios, K. Efe, L. Delcambre
A statistical approach is used to analyze the performance of data allocation optimization techniques in distributed computer systems. This approach is applied to a computer integrated manufacturing (CIM) system with hierarchical control constraints. The performance of some existing general purpose optimization techniques are compared with heuristics specifically developed for allocating data in a CIM system. Data allocation optimization techniques were actually implemented and performance was evaluated for a 250 node apparel CIM factory. The specific issues addressed include: (1) solution quality in terms of the minimum system wide input/output (I/O) task operating cost, (2) the probability of finding a better solution, (3) the performance of optimization heuristics in terms of their figure-of-merit, and (4) the impact of I/O task activation scenarios on the choice of an optimization technique for solving the CIM data allocation problem.<>
{"title":"Statistical evaluation of data allocation optimization techniques with application to computer integrated manufacturing","authors":"I. Remedios, K. Efe, L. Delcambre","doi":"10.1109/PCCC.1992.200576","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200576","url":null,"abstract":"A statistical approach is used to analyze the performance of data allocation optimization techniques in distributed computer systems. This approach is applied to a computer integrated manufacturing (CIM) system with hierarchical control constraints. The performance of some existing general purpose optimization techniques are compared with heuristics specifically developed for allocating data in a CIM system. Data allocation optimization techniques were actually implemented and performance was evaluated for a 250 node apparel CIM factory. The specific issues addressed include: (1) solution quality in terms of the minimum system wide input/output (I/O) task operating cost, (2) the probability of finding a better solution, (3) the performance of optimization heuristics in terms of their figure-of-merit, and (4) the impact of I/O task activation scenarios on the choice of an optimization technique for solving the CIM data allocation problem.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114146586","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200563
M. Ross, F. Carden, W. Osborne
Pragmatic trellis coded modulation (TCM) uses the industry standard, 64-state, binary convolutional code. The authors present the logic design and simulation results for a system which effectively implements pragmatic TCM for rate 2/3 encoded 8 phase shift keying (PSK). This system associates each sector of a quantized phase receiver with a pair of weights to be used as soft decision inputs of the Viterbi decoder. This system approaches 3 dB of coding gain at bit error rates of 10/sup -5/ and less.<>
{"title":"Pragmatic trellis coded modulation: a simulation using 24-sector quantized 8-PSK","authors":"M. Ross, F. Carden, W. Osborne","doi":"10.1109/PCCC.1992.200563","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200563","url":null,"abstract":"Pragmatic trellis coded modulation (TCM) uses the industry standard, 64-state, binary convolutional code. The authors present the logic design and simulation results for a system which effectively implements pragmatic TCM for rate 2/3 encoded 8 phase shift keying (PSK). This system associates each sector of a quantized phase receiver with a pair of weights to be used as soft decision inputs of the Viterbi decoder. This system approaches 3 dB of coding gain at bit error rates of 10/sup -5/ and less.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321238","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200523
N. Shiratori, E. Lee
The authors propose a new specification methodology and environment named the model based programming (MBP) environment. The objective of MBP is to design a user-friendly specification environment for formal description techniques (FDTs) such as LOTOS and SDL. MBP consists of the following tools: (1) mechanism for requirement acquisition, (2) tutor, (3) formal specification description model and (4) translator to FDTs. (1) acquires user requirements based on user-friendly tools, (2) gives information to users about MBP and FDTs, (3) represents a user requirement as a model based on the FDT being used, and (4) translates the user requirement represented in (3) to a FDT specification. By using MBP, a nonexpert user who only has a basic knowledge about the design concepts and the outline of each FDT can easily describe the FDT specification. MBP-1 has been implemented as a pilot system.<>
{"title":"A user friendly specification environment for FDT and its application to LOTOS","authors":"N. Shiratori, E. Lee","doi":"10.1109/PCCC.1992.200523","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200523","url":null,"abstract":"The authors propose a new specification methodology and environment named the model based programming (MBP) environment. The objective of MBP is to design a user-friendly specification environment for formal description techniques (FDTs) such as LOTOS and SDL. MBP consists of the following tools: (1) mechanism for requirement acquisition, (2) tutor, (3) formal specification description model and (4) translator to FDTs. (1) acquires user requirements based on user-friendly tools, (2) gives information to users about MBP and FDTs, (3) represents a user requirement as a model based on the FDT being used, and (4) translates the user requirement represented in (3) to a FDT specification. By using MBP, a nonexpert user who only has a basic knowledge about the design concepts and the outline of each FDT can easily describe the FDT specification. MBP-1 has been implemented as a pilot system.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114534445","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200526
T. Takeda, K. Tanno
The authors deal with a new channel access scheme for ring LANs, referred to as the self-token protocol. They describe the basic operation of the protocol, priority transmission and the packet error detection/recovery method. The performance of the protocol was evaluated by using computer simulation. It was shown to have superior characteristics by combining the merits of the multiple-token and the register insertion channel access methods. Asynchronous and synchronous communications and a bidirectional ring for realizing high-speed and multi-media-oriented LANs are discussed.<>
{"title":"Self-token protocol for high-speed multimedia LANs","authors":"T. Takeda, K. Tanno","doi":"10.1109/PCCC.1992.200526","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200526","url":null,"abstract":"The authors deal with a new channel access scheme for ring LANs, referred to as the self-token protocol. They describe the basic operation of the protocol, priority transmission and the packet error detection/recovery method. The performance of the protocol was evaluated by using computer simulation. It was shown to have superior characteristics by combining the merits of the multiple-token and the register insertion channel access methods. Asynchronous and synchronous communications and a bidirectional ring for realizing high-speed and multi-media-oriented LANs are discussed.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116090503","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200611
R. Ziemer, M. Wickert, D. B. Ruth
A user-friendly, highly visual computer workstation-based satellite network evaluation tool is described. It is capable of providing end-to-end performance statistics in response to the specification of a wide variety of network geometries, modulation types, and routing protocols. A description of the algorithm structure and program flow is given. The software provides a highly interactive, visual, user-friendly tool for determining certain link statistics for a broad range of orbital and communication parameter options.<>
{"title":"Satlink v2.5: an interactive, user-friendly computer workstation tool for satellite network evaluation","authors":"R. Ziemer, M. Wickert, D. B. Ruth","doi":"10.1109/PCCC.1992.200611","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200611","url":null,"abstract":"A user-friendly, highly visual computer workstation-based satellite network evaluation tool is described. It is capable of providing end-to-end performance statistics in response to the specification of a wide variety of network geometries, modulation types, and routing protocols. A description of the algorithm structure and program flow is given. The software provides a highly interactive, visual, user-friendly tool for determining certain link statistics for a broad range of orbital and communication parameter options.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127398011","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200550
Pao-Chi Chang, P. Kermani, A. Kershenbaum
The authors consider the problem of selecting a link topology and sizing the link given a point-to-point traffic matrix and a cost matrix. Different speed links are permitted in the topology. An algorithm is presented for the solution to this problem, and its performance, both in terms of running time and the quality of the networks produced, is compared with that of an algorithm which only considers a single speed link. The new algorithm shows significant improvement, reducing cost by as much as 6% while increasing running time by only a constant factor.<>
{"title":"Multi-link-speed network topology design","authors":"Pao-Chi Chang, P. Kermani, A. Kershenbaum","doi":"10.1109/PCCC.1992.200550","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200550","url":null,"abstract":"The authors consider the problem of selecting a link topology and sizing the link given a point-to-point traffic matrix and a cost matrix. Different speed links are permitted in the topology. An algorithm is presented for the solution to this problem, and its performance, both in terms of running time and the quality of the networks produced, is compared with that of an algorithm which only considers a single speed link. The new algorithm shows significant improvement, reducing cost by as much as 6% while increasing running time by only a constant factor.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820720","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200541
J.-A. Lee, K. Kim
A set of VLSI architectures for robot direct kinematics computation is presented. The homogeneous link transformation matrix is decomposed into products of translation/rotation matrices, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme is proposed for a six-link robot kinematics processor utilizing full pipelining at the macro level and parallel redundant arithmetic and full pipelining at the micro level. The performance of the scheme is analyzed with respect to the time to compute one location of the end-effector of a six-link manipulator and the number of transistors required. This scheme is assessed to produce a single-chip VLSI utilizing state-of-the-art MOS technology. A comparison table shows that the CORDIC-based robotics processor is a prospective solution in VLSI to be used for a wide range of kinematic calculation requirements.<>
{"title":"Fully-pipelined VLSI architectures for the kinematics of robot arm manipulators","authors":"J.-A. Lee, K. Kim","doi":"10.1109/PCCC.1992.200541","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200541","url":null,"abstract":"A set of VLSI architectures for robot direct kinematics computation is presented. The homogeneous link transformation matrix is decomposed into products of translation/rotation matrices, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme is proposed for a six-link robot kinematics processor utilizing full pipelining at the macro level and parallel redundant arithmetic and full pipelining at the micro level. The performance of the scheme is analyzed with respect to the time to compute one location of the end-effector of a six-link manipulator and the number of transistors required. This scheme is assessed to produce a single-chip VLSI utilizing state-of-the-art MOS technology. A comparison table shows that the CORDIC-based robotics processor is a prospective solution in VLSI to be used for a wide range of kinematic calculation requirements.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127262736","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 : 1992-04-01DOI: 10.1109/PCCC.1992.200596
V. Jagannathan, J. Cleetus, R. Kannan, J. Toth, V. Saks
The Application Message Interface (AMI) is a software system designed and developed as part of the DARPA Initiative in Concurrent Engineering (DICE). The primary role of AMI is to serve as a framework for integration in a dynamic, heterogeneous, and extensible distributed environment. A distributed environment is characterized as dynamic when client-server relationships need not be statically configured. By extensible it is meant that the available services are subject to change. Thus, in a dynamic and extensible environment clients have new services available at run time. AMI is aimed at facilitating seamless integration in such an environment.<>
{"title":"Application Message Interface","authors":"V. Jagannathan, J. Cleetus, R. Kannan, J. Toth, V. Saks","doi":"10.1109/PCCC.1992.200596","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200596","url":null,"abstract":"The Application Message Interface (AMI) is a software system designed and developed as part of the DARPA Initiative in Concurrent Engineering (DICE). The primary role of AMI is to serve as a framework for integration in a dynamic, heterogeneous, and extensible distributed environment. A distributed environment is characterized as dynamic when client-server relationships need not be statically configured. By extensible it is meant that the available services are subject to change. Thus, in a dynamic and extensible environment clients have new services available at run time. AMI is aimed at facilitating seamless integration in such an environment.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127383485","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
扫码关注我们
求助内容：
应助结果提醒方式：