Pub Date : 1990-03-11DOI: 10.1109/SSST.1990.138225
D. Koch
Previous results dealing with radar systems utilizing complementary coded pulse compression waveforms are extended. The objective is to show how the generation and compression of such codes can be based on a specific single-input/multiple-output FIR (finite-impulsive-response) digital filter structure. Driving this filter with a unit pulse yields all members of a complementary code set sequence simultaneously. A decoder is then derived as an FIR digital filter and is matched to the coder filter. The significance of this technique lies in the relative ease with which the decoder structure may be identified for an arbitrary coder structure. Structures are presented for complementary code pairs and sets, as well as for generalized codes. Use of these structures leads to decoding algorithms with reduced computational requirements. The author presents an example that shows how calculations on the order of M/sup 2/ may be reduced to on the order of M log/sub 2/M.<>
{"title":"Analysis of a generalized coding/decoding method using FIR digital filters for radar waveform design","authors":"D. Koch","doi":"10.1109/SSST.1990.138225","DOIUrl":"https://doi.org/10.1109/SSST.1990.138225","url":null,"abstract":"Previous results dealing with radar systems utilizing complementary coded pulse compression waveforms are extended. The objective is to show how the generation and compression of such codes can be based on a specific single-input/multiple-output FIR (finite-impulsive-response) digital filter structure. Driving this filter with a unit pulse yields all members of a complementary code set sequence simultaneously. A decoder is then derived as an FIR digital filter and is matched to the coder filter. The significance of this technique lies in the relative ease with which the decoder structure may be identified for an arbitrary coder structure. Structures are presented for complementary code pairs and sets, as well as for generalized codes. Use of these structures leads to decoding algorithms with reduced computational requirements. The author presents an example that shows how calculations on the order of M/sup 2/ may be reduced to on the order of M log/sub 2/M.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423282","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 : 1990-03-11DOI: 10.1109/SSST.1990.138227
M.L. Hambaba, A. Charchali
The unsupervised neural network learning procedure is applied to the analysis and recognition of speech. This procedure takes a set of input patterns and attempts to learn their function; it develops the necessary representational features during the course of learning. A series of computer simulation studies was carried out to assess the ability of these networks to label sounds accurately, to learn to recognize sounds without labels, and to learn feature representations of continuous speech. These studies demonstrate that the networks can learn to label presegmented test tokens with accuracies of up to 99%. These networks developed rich internal representation. There is no clock; the circuit is data driven, and there is no necessity for endpoint detection or segmentation of the speech signal during recognition. Training in the presence of noise provides noise immunity up to the trained level. For the speech problem studied, the circuit connection only need to be accurate to about a 3-b digitization depth for optimum performance. The algorithm used maps efficiently onto a simple VLSI hardware chip.<>
{"title":"Unsupervised learning the hidden structure of speech","authors":"M.L. Hambaba, A. Charchali","doi":"10.1109/SSST.1990.138227","DOIUrl":"https://doi.org/10.1109/SSST.1990.138227","url":null,"abstract":"The unsupervised neural network learning procedure is applied to the analysis and recognition of speech. This procedure takes a set of input patterns and attempts to learn their function; it develops the necessary representational features during the course of learning. A series of computer simulation studies was carried out to assess the ability of these networks to label sounds accurately, to learn to recognize sounds without labels, and to learn feature representations of continuous speech. These studies demonstrate that the networks can learn to label presegmented test tokens with accuracies of up to 99%. These networks developed rich internal representation. There is no clock; the circuit is data driven, and there is no necessity for endpoint detection or segmentation of the speech signal during recognition. Training in the presence of noise provides noise immunity up to the trained level. For the speech problem studied, the circuit connection only need to be accurate to about a 3-b digitization depth for optimum performance. The algorithm used maps efficiently onto a simple VLSI hardware chip.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127522774","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 : 1990-03-11DOI: 10.1109/SSST.1990.138157
J. Golzy
A method for moving a robot arm along a prescribed path with sufficient accuracy and lower cost is presented. The entire path of movement is divided into n equal segments of fixed length 1 each. By using direction measurements or analytical methods, the location of each node on the path can be determined in the three-dimensional space. Then the straight distance d between each two consecutive nodes is determined. A series of fixed, symmetrical parabolic curves with length 1 but different curvature is defined and stored in the computer. On the basis of the value of d in relation to 1, a suitable curve is chosen and fitted between each two consecutive points. Since the execution strategy for each of these curves is already determined and stored in the computer, the overall execution time is reduced. This method seems to work well for smooth paths. The inverse kinematic problem can be solved to determine the position and velocity of each joint. The dynamic equations are then solved to determine the required torque for each joint.<>
{"title":"A control method for the movement of a robot arm along a prescribed path","authors":"J. Golzy","doi":"10.1109/SSST.1990.138157","DOIUrl":"https://doi.org/10.1109/SSST.1990.138157","url":null,"abstract":"A method for moving a robot arm along a prescribed path with sufficient accuracy and lower cost is presented. The entire path of movement is divided into n equal segments of fixed length 1 each. By using direction measurements or analytical methods, the location of each node on the path can be determined in the three-dimensional space. Then the straight distance d between each two consecutive nodes is determined. A series of fixed, symmetrical parabolic curves with length 1 but different curvature is defined and stored in the computer. On the basis of the value of d in relation to 1, a suitable curve is chosen and fitted between each two consecutive points. Since the execution strategy for each of these curves is already determined and stored in the computer, the overall execution time is reduced. This method seems to work well for smooth paths. The inverse kinematic problem can be solved to determine the position and velocity of each joint. The dynamic equations are then solved to determine the required torque for each joint.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393506","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 : 1990-03-11DOI: 10.1109/SSST.1990.138166
S. Sims, A.D. Poularikas
One of the techniques used to detect and recognize objects in an image is the synthetic discriminant function. The technique is based on spatial autocorrelation and frequency-domain data processing. To minimize the time needed to process a full image, the ring spiral approach is proposed and investigated. It is found that for images without additive noise the speed of detection improved by more than a factor of 1000.<>
{"title":"Rotation invariant image pattern recognition using ring spiral scanning","authors":"S. Sims, A.D. Poularikas","doi":"10.1109/SSST.1990.138166","DOIUrl":"https://doi.org/10.1109/SSST.1990.138166","url":null,"abstract":"One of the techniques used to detect and recognize objects in an image is the synthetic discriminant function. The technique is based on spatial autocorrelation and frequency-domain data processing. To minimize the time needed to process a full image, the ring spiral approach is proposed and investigated. It is found that for images without additive noise the speed of detection improved by more than a factor of 1000.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"55 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134547622","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 : 1990-03-11DOI: 10.1109/SSST.1990.138190
C.D. Johnson, J. Zhu
A new generalization of the state-space concept called hyperstate space, or simply hyperspace, is presented. The concept of hyperspace enables the quick determination of certain important geometric and analytic features of system-dynamic behavior without explicitly solution of the system state equations. The usefulness of the hyperspace concept is demonstrated by several examples from different areas of modern system theory.<>
{"title":"The concept of hyperspace in dynamical system theory","authors":"C.D. Johnson, J. Zhu","doi":"10.1109/SSST.1990.138190","DOIUrl":"https://doi.org/10.1109/SSST.1990.138190","url":null,"abstract":"A new generalization of the state-space concept called hyperstate space, or simply hyperspace, is presented. The concept of hyperspace enables the quick determination of certain important geometric and analytic features of system-dynamic behavior without explicitly solution of the system state equations. The usefulness of the hyperspace concept is demonstrated by several examples from different areas of modern system theory.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122857249","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 : 1990-03-11DOI: 10.1109/SSST.1990.138107
K. Chandy, N. Chandra
A description is given of a physical model designed to simulate pressure-forming operations, and the results from computational models and actual samples are used to validate the use of this physical model. Results from both the computational and physical models, coupled with experimental evidence from actual specimens, indicate that the free deforming profiles of a thin superplastic sheet is spherical. A state of biaxial stress exists at the pole in both physical and actual specimens. The clamping pressure due to the clamps creates a plane strain state in the rubber model. However, the clamps are unable to prevent displacement of the material laterally in actual specimens; this may be due to the bending and shearing action caused when the sheet is bent over the die radius. The drawing action is also responsible for a thickening of the sheet near the die edges. The present physical setup is unable to account for such bending ad shearing stresses.<>
{"title":"Computer simulation and experimental verification of a metal forming process","authors":"K. Chandy, N. Chandra","doi":"10.1109/SSST.1990.138107","DOIUrl":"https://doi.org/10.1109/SSST.1990.138107","url":null,"abstract":"A description is given of a physical model designed to simulate pressure-forming operations, and the results from computational models and actual samples are used to validate the use of this physical model. Results from both the computational and physical models, coupled with experimental evidence from actual specimens, indicate that the free deforming profiles of a thin superplastic sheet is spherical. A state of biaxial stress exists at the pole in both physical and actual specimens. The clamping pressure due to the clamps creates a plane strain state in the rubber model. However, the clamps are unable to prevent displacement of the material laterally in actual specimens; this may be due to the bending and shearing action caused when the sheet is bent over the die radius. The drawing action is also responsible for a thickening of the sheet near the die edges. The present physical setup is unable to account for such bending ad shearing stresses.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439216","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 : 1990-03-11DOI: 10.1109/SSST.1990.138177
D.L. Smith
The goal of the ACT (Automatic Computer Troubleshooting) project is to develop portable software that will help diagnose computer failures. Some of the software will control test instruments and help the user make the diagnosis. Other software will predict the results of signature analysis tests. Functional tests of a target system using the latest available algorithms will be supported. The project will also explore new test algorithms and techniques for diagnosis. The details of the project are discussed. A brief report on the software and test algorithms under development is given.<>
{"title":"The ACT (Automatic Computer Troubleshooting) project","authors":"D.L. Smith","doi":"10.1109/SSST.1990.138177","DOIUrl":"https://doi.org/10.1109/SSST.1990.138177","url":null,"abstract":"The goal of the ACT (Automatic Computer Troubleshooting) project is to develop portable software that will help diagnose computer failures. Some of the software will control test instruments and help the user make the diagnosis. Other software will predict the results of signature analysis tests. Functional tests of a target system using the latest available algorithms will be supported. The project will also explore new test algorithms and techniques for diagnosis. The details of the project are discussed. A brief report on the software and test algorithms under development is given.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864043","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 : 1990-03-11DOI: 10.1109/SSST.1990.138205
P. Crilly
Relaxation-based iterative deconvolution methods have become useful for restoring spectroscopic or chromatographic information that has become distorted by the measurement process. An evaluation is made of several of these techniques. Their RMS error performance, quantitative accuracy and repeatability, rate of convergence, and ability to work with noisy data are investigated. For a class of data that is amplitude-bounded and distorted by a Gaussian-shaped impulse response function, it is shown that P.A. Jansson's method (1984) provides the best overall performance.<>
{"title":"A comparative study of relaxation based iterative deconvolution methods","authors":"P. Crilly","doi":"10.1109/SSST.1990.138205","DOIUrl":"https://doi.org/10.1109/SSST.1990.138205","url":null,"abstract":"Relaxation-based iterative deconvolution methods have become useful for restoring spectroscopic or chromatographic information that has become distorted by the measurement process. An evaluation is made of several of these techniques. Their RMS error performance, quantitative accuracy and repeatability, rate of convergence, and ability to work with noisy data are investigated. For a class of data that is amplitude-bounded and distorted by a Gaussian-shaped impulse response function, it is shown that P.A. Jansson's method (1984) provides the best overall performance.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"19 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120908851","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 : 1990-03-11DOI: 10.1109/SSST.1990.138192
C.D. Johnson, J. You
The mathematical structure of a linear adaptive controller is compared with the structure of several conventional types of nonlinear adaptive controllers. Through a term-by-term comparison of the equations representing each control law, using certain identity relations, it is shown that the structure of a linear adaptive control law is essentially equivalent to the structure of conventional nonlinear adaptive control laws. This result demonstrates that linear adaptive controllers are genuine adaptive controllers, and not just another form of robust controller.<>
{"title":"A structural equivalence between nonlinear and linear adaptive controllers","authors":"C.D. Johnson, J. You","doi":"10.1109/SSST.1990.138192","DOIUrl":"https://doi.org/10.1109/SSST.1990.138192","url":null,"abstract":"The mathematical structure of a linear adaptive controller is compared with the structure of several conventional types of nonlinear adaptive controllers. Through a term-by-term comparison of the equations representing each control law, using certain identity relations, it is shown that the structure of a linear adaptive control law is essentially equivalent to the structure of conventional nonlinear adaptive control laws. This result demonstrates that linear adaptive controllers are genuine adaptive controllers, and not just another form of robust controller.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121399196","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 : 1990-03-11DOI: 10.1109/SSST.1990.138121
H. Franke, B. Abbott
The authors describe a programming environment (TOPS) that creates an abstraction level such that a network of transputers is regarded as a virtual machine independent of the network topology. TOPS provides an extended process model and higher level of message passing than is provided by a bare transputer. The development of TOPS arose in the context of various projects requiring a higher level of flexibility. The discussion covers the transputer system, functionality of TOPS, the task model in TOPS, event handling, dynamic memory measurement, input-output in TOPS, and an evaluation of TOPS.<>
{"title":"TOPS-a distributed operating system kernel for transputer systems","authors":"H. Franke, B. Abbott","doi":"10.1109/SSST.1990.138121","DOIUrl":"https://doi.org/10.1109/SSST.1990.138121","url":null,"abstract":"The authors describe a programming environment (TOPS) that creates an abstraction level such that a network of transputers is regarded as a virtual machine independent of the network topology. TOPS provides an extended process model and higher level of message passing than is provided by a bare transputer. The development of TOPS arose in the context of various projects requiring a higher level of flexibility. The discussion covers the transputer system, functionality of TOPS, the task model in TOPS, event handling, dynamic memory measurement, input-output in TOPS, and an evaluation of TOPS.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223884","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
扫码关注我们
求助内容：
应助结果提醒方式：