Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160803
K. Li, E. Miska
Fire-fighter acts as an intelligent assistant for the on-scene commander of a fire emergency on a naval vessel. Given a ship's model with information of the configuration, contents, fire-fighting resources, and some fire-specific knowledge, Fire-fighter will develop a fire management plan to suppress the fire. Fire-fighter is based on script-based planning. Scripts are skeleton plans which are similar in concept to contingency plans for emergencies. The known situation data is used to instantiate the skeleton plan. Fire-fighter interleaves planning, execution, and monitoring to better react to a changing environment. To measure the success of its emergency actions, Fire-fighter will monitor the progress of the plan. When actions fail or appear to be failing replanning will commence. In a hazardous environment, care must be taken to safely replan. Fire-fighter uses domain-dependent knowledge to determine why goals are not being met. Once the cause of failure is known, one can determine where to alter the plan and the appropriate steps to take.<>
{"title":"Fire-fighter: a decision support system for fire management","authors":"K. Li, E. Miska","doi":"10.1109/PACRIM.1991.160803","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160803","url":null,"abstract":"Fire-fighter acts as an intelligent assistant for the on-scene commander of a fire emergency on a naval vessel. Given a ship's model with information of the configuration, contents, fire-fighting resources, and some fire-specific knowledge, Fire-fighter will develop a fire management plan to suppress the fire. Fire-fighter is based on script-based planning. Scripts are skeleton plans which are similar in concept to contingency plans for emergencies. The known situation data is used to instantiate the skeleton plan. Fire-fighter interleaves planning, execution, and monitoring to better react to a changing environment. To measure the success of its emergency actions, Fire-fighter will monitor the progress of the plan. When actions fail or appear to be failing replanning will commence. In a hazardous environment, care must be taken to safely replan. Fire-fighter uses domain-dependent knowledge to determine why goals are not being met. Once the cause of failure is known, one can determine where to alter the plan and the appropriate steps to take.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237594","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160683
B. Buxton, R. Vahldieck, J. Bornemann
A dual-gate GaAs FET mixer for use in a low-noise receiver front end in the frequency range of 800 to 900 MHz is presented. The circuit is made on a low-cost 0.062-in fiber glass substrate with in /sub r/ of 4.2 and is designed with inexpensive common surface mount components. The prototype has a third-order intercept of 9 dBm, with respect to the output level, a minimum gain of 13.9 dB, and a sensitivity of -119.3 dBm when driven with an LO power of -2 dBm and with a drain current of 3.0 mA. For improved performance and for easier integration into the receiver, the output impedance is set at 1500 Omega .<>
{"title":"An active dual-gate GaAs FET mixer for 800 MHz low current consumption mountain top repeaters","authors":"B. Buxton, R. Vahldieck, J. Bornemann","doi":"10.1109/PACRIM.1991.160683","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160683","url":null,"abstract":"A dual-gate GaAs FET mixer for use in a low-noise receiver front end in the frequency range of 800 to 900 MHz is presented. The circuit is made on a low-cost 0.062-in fiber glass substrate with in /sub r/ of 4.2 and is designed with inexpensive common surface mount components. The prototype has a third-order intercept of 9 dBm, with respect to the output level, a minimum gain of 13.9 dB, and a sensitivity of -119.3 dBm when driven with an LO power of -2 dBm and with a drain current of 3.0 mA. For improved performance and for easier integration into the receiver, the output impedance is set at 1500 Omega .<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116658412","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160827
D. Park, S. Mori
The authors propose a frequency synthesizer which is implemented by deploying a multiple phase detector scheme, and by adding a bias voltage corresponding to desired frequency to the input of a voltage controlled oscillator (VCO) and resetting each divider. One can obtain a fast acquisition time within one cycle of the reference frequency. The acquisition time which is generated by the variation of bias voltage in the VCO due to temperature characteristics can also be minimized by using the proposed multiple phase detectors. The authors have compared the acquisition time of the new frequency synthesizer with a conventional frequency synthesizer and a significant improvement was obtained. The performance was verified by experiments.<>
{"title":"Fast acquisition frequency synthesizer with the multiple phase detectors","authors":"D. Park, S. Mori","doi":"10.1109/PACRIM.1991.160827","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160827","url":null,"abstract":"The authors propose a frequency synthesizer which is implemented by deploying a multiple phase detector scheme, and by adding a bias voltage corresponding to desired frequency to the input of a voltage controlled oscillator (VCO) and resetting each divider. One can obtain a fast acquisition time within one cycle of the reference frequency. The acquisition time which is generated by the variation of bias voltage in the VCO due to temperature characteristics can also be minimized by using the proposed multiple phase detectors. The authors have compared the acquisition time of the new frequency synthesizer with a conventional frequency synthesizer and a significant improvement was obtained. The performance was verified by experiments.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892412","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160730
W. Qian, C.C.Y. Ma
A single-link flexible arm setup has been built. The major objective is to use it as a testbed to explore and investigate new controller designs and the related control problems for this kind of plant. The experiments reported are concerned with model identification and several existing control law implementations. One interesting result obtained in identification is that all of the first three flexible modes of this plant tend to destabilize the system. The approximate linear model identified, which includes the viscous friction at the joint, is verified in the control experiments.<>
{"title":"Experiments on a flexible one-link manipulator","authors":"W. Qian, C.C.Y. Ma","doi":"10.1109/PACRIM.1991.160730","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160730","url":null,"abstract":"A single-link flexible arm setup has been built. The major objective is to use it as a testbed to explore and investigate new controller designs and the related control problems for this kind of plant. The experiments reported are concerned with model identification and several existing control law implementations. One interesting result obtained in identification is that all of the first three flexible modes of this plant tend to destabilize the system. The approximate linear model identified, which includes the viscous friction at the joint, is verified in the control experiments.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127148910","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160694
N. Dimopoulos, R. Sivakumar, V. Dimakopoulos, M. Chowdhury, D. Radvan
The authors present the Hypercycles, a class of multidimensional graphs, which are generalizations of the n-cube. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cycle interconnection strategy. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of alternative size graphs. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. A backtrack-to-the-origin-and-retry routing scheme in which paths that block at intermediate nodes are abandoned and a new attempt is made is presented. Intermediate nodes are chosen at random at each point from among the ones that form the shortest paths from a source to a destination. Simulation results that establish the performance of a variety of configurations are presented. In addition, the initial attempt at constructing a Hypercycle-based router is discussed.<>
{"title":"Hypercycles: a status report","authors":"N. Dimopoulos, R. Sivakumar, V. Dimakopoulos, M. Chowdhury, D. Radvan","doi":"10.1109/PACRIM.1991.160694","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160694","url":null,"abstract":"The authors present the Hypercycles, a class of multidimensional graphs, which are generalizations of the n-cube. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cycle interconnection strategy. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of alternative size graphs. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. A backtrack-to-the-origin-and-retry routing scheme in which paths that block at intermediate nodes are abandoned and a new attempt is made is presented. Intermediate nodes are chosen at random at each point from among the ones that form the shortest paths from a source to a destination. Simulation results that establish the performance of a variety of configurations are presented. In addition, the initial attempt at constructing a Hypercycle-based router is discussed.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127510984","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160776
C.M. Jubien, M. R. Jernigan
A neural network architecture for deblurring a blurry scene without prior knowledge of the blur is proposed. Two different training algorithms are described, one a standard neural network training algorithm (employing the least mean squares (LMS) rule) and the second an original algorithm, dubbed algorithm-X. Both were successful for developing inverse blur filters to enhance a blurry picture. Algorithm-X is computationally less complex than the LMS algorithm, and in tests comparing the training times of the two algorithms, algorithm-X was found to be faster.<>
{"title":"A neural network for deblurring an image","authors":"C.M. Jubien, M. R. Jernigan","doi":"10.1109/PACRIM.1991.160776","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160776","url":null,"abstract":"A neural network architecture for deblurring a blurry scene without prior knowledge of the blur is proposed. Two different training algorithms are described, one a standard neural network training algorithm (employing the least mean squares (LMS) rule) and the second an original algorithm, dubbed algorithm-X. Both were successful for developing inverse blur filters to enhance a blurry picture. Algorithm-X is computationally less complex than the LMS algorithm, and in tests comparing the training times of the two algorithms, algorithm-X was found to be faster.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727017","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160670
Y. Seo, Y. Shiroto, N. Nishi, R. Nakazaki
A parallel algorithm for solving LU factorization of huge dense matrices was developed for parallel vector supercomputers with a hierarchy of memory layers (i.e., local memories, shared memory, semiconductor extended storage, and magnetic disk). The algorithm is based on Gaussian elimination and optimizes data transfers among memory layers by recursively using a block partitioning method. Using four memory layers, an LU factorization for a 32768*32768 dense matrix was calculated in 640 min on the HPP-LHS supercomputer system developed under the MITI (Ministry of International Trade and Industry) Supercomputer Project. Required memory capacity for the gigantic matrix is 8 GB, and the whole matrix data area was allocated to magnetic disk for this calculation. The execution speed with four processors was 2.8 times faster than that with one processor, even using a magnetic disk, and the algorithm was proved to be effective.<>
针对具有存储层(即本地存储器、共享存储器、半导体扩展存储器和磁盘)层次结构的并行向量超级计算机，提出了求解大密度矩阵LU分解的并行算法。该算法基于高斯消去算法，采用块划分方法递归优化内存层间的数据传输。利用4个存储层，在MITI (Ministry of International Trade and Industry)超级计算机项目开发的HPP-LHS超级计算机系统上，在640分钟内计算了32768*32768密集矩阵的LU分解。这个巨大矩阵所需的内存容量为8 GB，整个矩阵数据区域被分配给磁盘进行计算。4个处理器的执行速度是单处理器的2.8倍，即使使用磁盘，该算法也被证明是有效的。
{"title":"An LU factorization algorithm for parallel supercomputers with memory hierarchies","authors":"Y. Seo, Y. Shiroto, N. Nishi, R. Nakazaki","doi":"10.1109/PACRIM.1991.160670","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160670","url":null,"abstract":"A parallel algorithm for solving LU factorization of huge dense matrices was developed for parallel vector supercomputers with a hierarchy of memory layers (i.e., local memories, shared memory, semiconductor extended storage, and magnetic disk). The algorithm is based on Gaussian elimination and optimizes data transfers among memory layers by recursively using a block partitioning method. Using four memory layers, an LU factorization for a 32768*32768 dense matrix was calculated in 640 min on the HPP-LHS supercomputer system developed under the MITI (Ministry of International Trade and Industry) Supercomputer Project. Required memory capacity for the gigantic matrix is 8 GB, and the whole matrix data area was allocated to magnetic disk for this calculation. The execution speed with four processors was 2.8 times faster than that with one processor, even using a magnetic disk, and the algorithm was proved to be effective.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114123909","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160815
Hui Zhang, Zhenya He
The block-matching algorithm (BMA) is widely used for image sequence coding. In the conventional BMA, the blocks within a frame are processed independently and the intensity variations are not considered. The authors present a motion estimation algorithm in which the correlation of interblock is used to save the computations, and the variations of image intensity are considered for the improvement of estimated motion vector accuracy. The simulation results show that the performance of the motion estimation algorithm is better than that of the 2-D logarithmic search method.<>
{"title":"A new motion estimation algorithm","authors":"Hui Zhang, Zhenya He","doi":"10.1109/PACRIM.1991.160815","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160815","url":null,"abstract":"The block-matching algorithm (BMA) is widely used for image sequence coding. In the conventional BMA, the blocks within a frame are processed independently and the intensity variations are not considered. The authors present a motion estimation algorithm in which the correlation of interblock is used to save the computations, and the variations of image intensity are considered for the improvement of estimated motion vector accuracy. The simulation results show that the performance of the motion estimation algorithm is better than that of the 2-D logarithmic search method.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402274","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160709
S. Simmons
A new unified approach is taken in which simple low-pass filters are used after quadrature demodulation, and are followed by a sampler and reduced-computation sequence estimation algorithm. As the number of samples per baud increases, optimal performance is closely approached. The computational complexity can be minimized by choosing a narrow filter that actually modifies the received signal shapes; the sequence estimation algorithm accounts for introduced ISI. It is shown for representative modulations that near-optimal performance can be achieved with simple low-pass filtering, just two samples per baud, and trellis search with only a few survivor paths.<>
{"title":"Simplified coherent detection of bandwidth-efficient CPFSK/CPM modulations","authors":"S. Simmons","doi":"10.1109/PACRIM.1991.160709","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160709","url":null,"abstract":"A new unified approach is taken in which simple low-pass filters are used after quadrature demodulation, and are followed by a sampler and reduced-computation sequence estimation algorithm. As the number of samples per baud increases, optimal performance is closely approached. The computational complexity can be minimized by choosing a narrow filter that actually modifies the received signal shapes; the sequence estimation algorithm accounts for introduced ISI. It is shown for representative modulations that near-optimal performance can be achieved with simple low-pass filtering, just two samples per baud, and trellis search with only a few survivor paths.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128653359","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 : 1991-05-09DOI: 10.1109/PACRIM.1991.160772
Chewei Huang, G. Bi, Q. Chen, Li Li
The authors focus on the development of a multifunction workstation for the ISDN environment, integrating voice, data, and graphics information. The configuration and services of the workstation are introduced. The multimedia protocol and multimedia synchronization are discussed, and the implementation of the ISDN communication control unit (CCU) board and the CCU interface to the host computer are described. In addition, a brief discussion is included on how to counteract weakness of the multitasking operation system in read-time support. The architecture and implementation of the basic system software and the relationship between parallel processes are described. Some applications of multifunction workstations are introduced.<>
{"title":"Multifunction workstation integrated voice/data/graphics for the ISDN environment","authors":"Chewei Huang, G. Bi, Q. Chen, Li Li","doi":"10.1109/PACRIM.1991.160772","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160772","url":null,"abstract":"The authors focus on the development of a multifunction workstation for the ISDN environment, integrating voice, data, and graphics information. The configuration and services of the workstation are introduced. The multimedia protocol and multimedia synchronization are discussed, and the implementation of the ISDN communication control unit (CCU) board and the CCU interface to the host computer are described. In addition, a brief discussion is included on how to counteract weakness of the multitasking operation system in read-time support. The architecture and implementation of the basic system software and the relationship between parallel processes are described. Some applications of multifunction workstations are introduced.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318179","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
扫码关注我们
求助内容：
应助结果提醒方式：