Pub Date : 1992-04-01DOI: 10.1109/PCCC.1992.200513
M. Obaidat, D. Abu-Saymeh
A system in which transducers are characterized and classified using both pattern recognition and neural network algorithms is presented. Various techniques are investigated, compared, and analyzed. The hardware of the system used in collecting and measuring the characteristics of the transducers, and the parameters used in classifying the transducers into classes are described. The neural network and pattern recognition algorithms used to classify the transducers are introduced. The results of the classification are presented and the various algorithms are analyzed and compared.<>
{"title":"Neural network and pattern recognition techniques for characterizing ultrasonic transducers","authors":"M. Obaidat, D. Abu-Saymeh","doi":"10.1109/PCCC.1992.200513","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200513","url":null,"abstract":"A system in which transducers are characterized and classified using both pattern recognition and neural network algorithms is presented. Various techniques are investigated, compared, and analyzed. The hardware of the system used in collecting and measuring the characteristics of the transducers, and the parameters used in classifying the transducers into classes are described. The neural network and pattern recognition algorithms used to classify the transducers are introduced. The results of the classification are presented and the various algorithms are analyzed and compared.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"12 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":"129571603","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.200551
T. Yoneda, Y. Matsushita
A time-dependent multimedia document (TDMD) system is being developed. A method for formally specifying the structure of time-dependent documents is proposed. A time-dependent document consists of temporal information, spatial information and content information. The proposed structure can include various types of objects which can specify those three types of information. It is shown that a tree structure is suitable for representing a TDMD system. By using the proposed structure, intelligent processing such as retrieving of content information by name, by time, and by location, independent editing of content information, location editing, and time editing can be realized. To interchange a document between computers, the structure of the document is described by ASN.1. A prototype system was implemented in which a time-dependent document can be interchanged between SUN workstations.<>
{"title":"Constructing a system using time dependent multimedia document","authors":"T. Yoneda, Y. Matsushita","doi":"10.1109/PCCC.1992.200551","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200551","url":null,"abstract":"A time-dependent multimedia document (TDMD) system is being developed. A method for formally specifying the structure of time-dependent documents is proposed. A time-dependent document consists of temporal information, spatial information and content information. The proposed structure can include various types of objects which can specify those three types of information. It is shown that a tree structure is suitable for representing a TDMD system. By using the proposed structure, intelligent processing such as retrieving of content information by name, by time, and by location, independent editing of content information, location editing, and time editing can be realized. To interchange a document between computers, the structure of the document is described by ASN.1. A prototype system was implemented in which a time-dependent document can be interchanged between SUN workstations.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"1 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":"129432914","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.200554
A. Schill
An approach to control the dynamic object transfer between distributed repositories is presented. The author introduces a declarative notation to specify the structure of a distributed repository environment. A complementary notation is offered to specify event-based sending and receiving of data objects via port links. The notation allows for detailed specification of trigger events, of data object selection of transfer destination selection, and of several options to control transfer management at runtime. The approach supports a strict decoupling of local data processing and of distributed data exchange. In addition, it makes a decentralized model of data storage possible, as opposed to the more costly model of ubiquity provided by distributed databases. The practical use of the approach is illustrated by examples.<>
{"title":"Controlling dynamic object transfer between distributed repositories","authors":"A. Schill","doi":"10.1109/PCCC.1992.200554","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200554","url":null,"abstract":"An approach to control the dynamic object transfer between distributed repositories is presented. The author introduces a declarative notation to specify the structure of a distributed repository environment. A complementary notation is offered to specify event-based sending and receiving of data objects via port links. The notation allows for detailed specification of trigger events, of data object selection of transfer destination selection, and of several options to control transfer management at runtime. The approach supports a strict decoupling of local data processing and of distributed data exchange. In addition, it makes a decentralized model of data storage possible, as opposed to the more costly model of ubiquity provided by distributed databases. The practical use of the approach is illustrated by examples.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"24 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":"129827941","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.200594
S. Olariu, J. L. Schwing, J. Zhang
A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<>
{"title":"Integer sorting in O(1) time on an n*n reconfigurable mesh","authors":"S. Olariu, J. L. Schwing, J. Zhang","doi":"10.1109/PCCC.1992.200594","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200594","url":null,"abstract":"A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"56 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":"121240315","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.200520
H. Barghi, W. Cronenwett, J. Bredeson
An efficient reservation-based carrier sense multiple access with collision-detection (CSMA/CD) protocol for two types of priority packets is presented. Type 1 packets are of relatively short duration, need a very quick response time, and have a high arrival rate. Type 2 packets are of longer duration, do not require as fast a response time, and have a low arrival rate. Expressions are developed for both the throughput and delay performance of two channel reservation network (TCRN), two channel reservation network with a preemptive priority, (TCRN/PP), and two channel reservation network with a nonpreemptive priority (TCRN/NPP) protocols. To examine the behavior of the protocols under time-constrained conditions, the authors check the percentage of voice packets which are transmitted within a given amount of time after their generation at a transmitting station and the voice capacity, both under different operating conditions. The results show that the channel is efficiently used to minimize the average delay for the data portion and to maintain as many voice stations as possible.<>
{"title":"Time constrained performance of a two channel reservation protocol for local networks","authors":"H. Barghi, W. Cronenwett, J. Bredeson","doi":"10.1109/PCCC.1992.200520","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200520","url":null,"abstract":"An efficient reservation-based carrier sense multiple access with collision-detection (CSMA/CD) protocol for two types of priority packets is presented. Type 1 packets are of relatively short duration, need a very quick response time, and have a high arrival rate. Type 2 packets are of longer duration, do not require as fast a response time, and have a low arrival rate. Expressions are developed for both the throughput and delay performance of two channel reservation network (TCRN), two channel reservation network with a preemptive priority, (TCRN/PP), and two channel reservation network with a nonpreemptive priority (TCRN/NPP) protocols. To examine the behavior of the protocols under time-constrained conditions, the authors check the percentage of voice packets which are transmitted within a given amount of time after their generation at a transmitting station and the voice capacity, both under different operating conditions. The results show that the channel is efficiently used to minimize the average delay for the data portion and to maintain as many voice stations as possible.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"7 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":"122948207","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.200598
S. Bandinelli, A. Fuggetta, C. Ghezzi
The authors explore the analogy between software processes and real-time systems by discussing the applicability of a formalism developed for real-time systems specification to the specification and enactment of software processes. The formalism, called ER nets, is based on Petri nets. A specialization of ER nets for this new application area is introduced, and its applicability is discussed through a case study. Ongoing research directions are outlined.<>
{"title":"Software processes as real-time systems: a case study using high-level Petri nets","authors":"S. Bandinelli, A. Fuggetta, C. Ghezzi","doi":"10.1109/PCCC.1992.200598","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200598","url":null,"abstract":"The authors explore the analogy between software processes and real-time systems by discussing the applicability of a formalism developed for real-time systems specification to the specification and enactment of software processes. The formalism, called ER nets, is based on Petri nets. A specialization of ER nets for this new application area is introduced, and its applicability is discussed through a case study. Ongoing research directions are outlined.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"22 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":"123103071","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.200610
E. Henriksen, G. Aas, J.B. Rydningen
The protocol is applicable to multicast file transfer over satellite links, but is also suitable for use in order broadcast networks. The OSI standards for the transport layer and for file transfer (FTAM) at the application layer have been used as models for the protocol. The transport protocol is based on a selective-repeat strategy for error recovery. The advantage of this strategy is that the protocol can handle the transfer in two phases. In the first phase the whole file is transmitted as a continuous stream of packets, and the sender just collects negative acknowledgements from receivers that lost packets. After that the sender enters the retransmission phase where the NACKed packets are retransmitted. The 'clever' receivers that have not lost any packets can deliver the complete file after the first transfer phase.<>
{"title":"A transport protocol supporting multicast file transfer over satellite links","authors":"E. Henriksen, G. Aas, J.B. Rydningen","doi":"10.1109/PCCC.1992.200610","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200610","url":null,"abstract":"The protocol is applicable to multicast file transfer over satellite links, but is also suitable for use in order broadcast networks. The OSI standards for the transport layer and for file transfer (FTAM) at the application layer have been used as models for the protocol. The transport protocol is based on a selective-repeat strategy for error recovery. The advantage of this strategy is that the protocol can handle the transfer in two phases. In the first phase the whole file is transmitted as a continuous stream of packets, and the sender just collects negative acknowledgements from receivers that lost packets. After that the sender enters the retransmission phase where the NACKed packets are retransmitted. The 'clever' receivers that have not lost any packets can deliver the complete file after the first transfer phase.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"28 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":"131657173","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.200599
H. Nakatani, T. Sato, M. Ito
The authors have been studying ways to configure APLICOT (application platform for integrated database and data communication), a common in-house application program (AP) development environment with the aim of simplifying the job flow of in-house online system building at NTT. The authors report the techniques used to design AP interfaces (APIs) in the APLICOT project and also include an appraisal of their usefulness. APLICOT breaks down all of the different kinds of online application processing at NTT into six major types based on the processing types of messages and files. APLICOT then provides a set of 54 API parts for each type to standardize AP development environments. This set minimizes the total development cost of AP and these API parts. APLICOT's purpose is to standardize AP development support systems while allowing flexibility in the number of required AP programmers and in their tasks.<>
{"title":"Application program interface design based on on-line processing types","authors":"H. Nakatani, T. Sato, M. Ito","doi":"10.1109/PCCC.1992.200599","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200599","url":null,"abstract":"The authors have been studying ways to configure APLICOT (application platform for integrated database and data communication), a common in-house application program (AP) development environment with the aim of simplifying the job flow of in-house online system building at NTT. The authors report the techniques used to design AP interfaces (APIs) in the APLICOT project and also include an appraisal of their usefulness. APLICOT breaks down all of the different kinds of online application processing at NTT into six major types based on the processing types of messages and files. APLICOT then provides a set of 54 API parts for each type to standardize AP development environments. This set minimizes the total development cost of AP and these API parts. APLICOT's purpose is to standardize AP development support systems while allowing flexibility in the number of required AP programmers and in their tasks.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"18 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":"125613110","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.200559
M.-Y. Chen
A bidirectional serial search pseudonoise (PN) acquisition scheme in a direct sequence spread spectrum system is investigated. By starting with a common initial phase point, both the forward sliding correlation and the backward sliding correlation are performed and examined simultaneously. Whichever phase point in either direction hits the correct phase point first is selected as the desired reference phase point. The author describes the analysis model of bidirectional serial search and the procedure for calculating the overall mean PN acquisition time. A formula for the overall mean PN acquisition time is derived. The computational result and the performance comparison between the bidirectional serial search and the unidirectional serial search are given.<>
{"title":"Performance of bidirectional serial search PN acquisition in direct sequence spread spectrum system","authors":"M.-Y. Chen","doi":"10.1109/PCCC.1992.200559","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200559","url":null,"abstract":"A bidirectional serial search pseudonoise (PN) acquisition scheme in a direct sequence spread spectrum system is investigated. By starting with a common initial phase point, both the forward sliding correlation and the backward sliding correlation are performed and examined simultaneously. Whichever phase point in either direction hits the correct phase point first is selected as the desired reference phase point. The author describes the analysis model of bidirectional serial search and the procedure for calculating the overall mean PN acquisition time. A formula for the overall mean PN acquisition time is derived. The computational result and the performance comparison between the bidirectional serial search and the unidirectional serial search are given.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"22 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":"114515147","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.200591
T. Sueyoshi, B. Apduhan, S. Funakoshi, I. Arita
A new approach to realize a reconfigurable interconnection network which is the key factor in constructing reconfigurable parallel computers, utilizing the reconfigurability features of a field programmable gate array (FPGA), is presented. The organization of the reconfigurable interconnection network and the mapping strategy for static and dynamic networks are discussed. Mapping examples are included. The control mechanism and interface that make it possible to implement the optimum interconnection topologies for interprocessor communication patterns on the interconnection network for the efficient execution of application programs on a multiprocessor system are outlined. The system organization of a reconfigurable interconnection network for a massively parallel multiprocessor is described.<>
{"title":"A new approach towards realization of reconfigurable interconnection networks","authors":"T. Sueyoshi, B. Apduhan, S. Funakoshi, I. Arita","doi":"10.1109/PCCC.1992.200591","DOIUrl":"https://doi.org/10.1109/PCCC.1992.200591","url":null,"abstract":"A new approach to realize a reconfigurable interconnection network which is the key factor in constructing reconfigurable parallel computers, utilizing the reconfigurability features of a field programmable gate array (FPGA), is presented. The organization of the reconfigurable interconnection network and the mapping strategy for static and dynamic networks are discussed. Mapping examples are included. The control mechanism and interface that make it possible to implement the optimum interconnection topologies for interprocessor communication patterns on the interconnection network for the efficient execution of application programs on a multiprocessor system are outlined. The system organization of a reconfigurable interconnection network for a massively parallel multiprocessor is described.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"40 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":"116921408","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
扫码关注我们
求助内容：
应助结果提醒方式：