Pub Date : 1900-01-01DOI: 10.1109/ICSYSE.1991.161110
A. Kanekar, A. Feliachi
The state estimation problem using artificial neural networks is considered. Stochastic systems are analyzed. The neural networks used are the adaptive linear combiner (ALC) and a multilayer network. An approach to train the network based on several Kalman filter solutions whose average is used as the desired output is developed. The performance of the training algorithms gives state estimates when measurement are presented. Examples are given for cases of high and low signal-to-noise ratio to illustrate the proposed approach.<>
{"title":"State estimation using adaptive linear combiner and multilayer neural network","authors":"A. Kanekar, A. Feliachi","doi":"10.1109/ICSYSE.1991.161110","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161110","url":null,"abstract":"The state estimation problem using artificial neural networks is considered. Stochastic systems are analyzed. The neural networks used are the adaptive linear combiner (ALC) and a multilayer network. An approach to train the network based on several Kalman filter solutions whose average is used as the desired output is developed. The performance of the training algorithms gives state estimates when measurement are presented. Examples are given for cases of high and low signal-to-noise ratio to illustrate the proposed approach.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123311614","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161109
J. Wang
Conditions of configuring feedforward neural networks without local minima are analyzed for both synchronous and asynchronous learning rules. Based on the analysis, a learning algorithm that integrates a synchronous-asynchronous learning rule with a dynamic configuration rule to train feedforward neural networks is presented. The theoretic analysis and numerical simulation reveal that the proposed learning algorithm substantially reduces the likelihood of local minimum solutions in supervised learning.<>
{"title":"Synchronous learning versus asynchronous learning in artificial neural networks","authors":"J. Wang","doi":"10.1109/ICSYSE.1991.161109","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161109","url":null,"abstract":"Conditions of configuring feedforward neural networks without local minima are analyzed for both synchronous and asynchronous learning rules. Based on the analysis, a learning algorithm that integrates a synchronous-asynchronous learning rule with a dynamic configuration rule to train feedforward neural networks is presented. The theoretic analysis and numerical simulation reveal that the proposed learning algorithm substantially reduces the likelihood of local minimum solutions in supervised learning.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"146 40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715914","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161069
L. Novak
The use of high-resolution radar measurement data (35 GHz) from four ground vehicles (bulldozer, Dodge Power Wagon, Dodge Van, and Camaro) to evaluate the performance of several 1D and 2D classifiers is discussed. The 1D classifiers use high-resolution range profiles to classify targets; the 2D classifier uses high-resolution inverse synthetic aperture radar (ISAR) images to classify targets. Classification performance results using the 1D and 2D algorithms are presented, and it is shown that the 2D algorithm performed best.<>
{"title":"A comparison of 1D and 2D algorithms for radar target classification","authors":"L. Novak","doi":"10.1109/ICSYSE.1991.161069","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161069","url":null,"abstract":"The use of high-resolution radar measurement data (35 GHz) from four ground vehicles (bulldozer, Dodge Power Wagon, Dodge Van, and Camaro) to evaluate the performance of several 1D and 2D classifiers is discussed. The 1D classifiers use high-resolution range profiles to classify targets; the 2D classifier uses high-resolution inverse synthetic aperture radar (ISAR) images to classify targets. Classification performance results using the 1D and 2D algorithms are presented, and it is shown that the 2D algorithm performed best.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129954222","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161091
Y. Gutman, M. Lee, J. D'Costa
Singularity is an inherent problem and an important obstacle to be overcome in robotic kinematics. When it is near a singular configuration, a robot loses one or more degrees of freedom (d.o.f.), and joint velocities approach infinitely leading to control instability. A strategy for stabilizing robot rate control near or at a singularity (degenerate) configuration using phantom d.o.f. is proposed. The phantom d.o.f. is considered as part of a robot kinematic velocity model and is activated only when the joint velocity exceeds its limit or at singularity configurations. A numerical illustration of singularity control of a 5-d.o.f. robot is discussed.<>
{"title":"Robot singularity rate control with phantom d.o.f. strategy","authors":"Y. Gutman, M. Lee, J. D'Costa","doi":"10.1109/ICSYSE.1991.161091","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161091","url":null,"abstract":"Singularity is an inherent problem and an important obstacle to be overcome in robotic kinematics. When it is near a singular configuration, a robot loses one or more degrees of freedom (d.o.f.), and joint velocities approach infinitely leading to control instability. A strategy for stabilizing robot rate control near or at a singularity (degenerate) configuration using phantom d.o.f. is proposed. The phantom d.o.f. is considered as part of a robot kinematic velocity model and is activated only when the joint velocity exceeds its limit or at singularity configurations. A numerical illustration of singularity control of a 5-d.o.f. robot is discussed.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"44 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125804","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161164
M.-H. Yoon, T. Ramabadran
In many deconvolution problems, the signal to be estimated is modeled as the input to a known plant and assumed white. There are, however, situations in which this signal is not white. A simple iterative scheme for estimating colored sequences is presented. In this scheme, the colored plant noise is modeled as the output of a shaping filter excited by white noise. The shaping filter is considered as part of the plant while applying Mendel's minimum variance deconvolution (MVD) algorithm based on the Kalman filter to estimate the plant noise. To begin with, the shaping filter is just an identity filter. The estimated plant noise is then used to update its coefficients iteratively until the change in the coefficient values is small. The iterative scheme has been tested using simulated data under different conditions, and is found to perform quite well under certain situations.<>
{"title":"Estimation of colored plant noise using Kalman filter based deconvolution","authors":"M.-H. Yoon, T. Ramabadran","doi":"10.1109/ICSYSE.1991.161164","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161164","url":null,"abstract":"In many deconvolution problems, the signal to be estimated is modeled as the input to a known plant and assumed white. There are, however, situations in which this signal is not white. A simple iterative scheme for estimating colored sequences is presented. In this scheme, the colored plant noise is modeled as the output of a shaping filter excited by white noise. The shaping filter is considered as part of the plant while applying Mendel's minimum variance deconvolution (MVD) algorithm based on the Kalman filter to estimate the plant noise. To begin with, the shaping filter is just an identity filter. The estimated plant noise is then used to update its coefficients iteratively until the change in the coefficient values is small. The iterative scheme has been tested using simulated data under different conditions, and is found to perform quite well under certain situations.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126197823","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161157
H. Shertukde, L. Godbout, S. C. Elmurr
A methodology for estimating the magnitude of signals generally found in a high-count-rate (HCR) system is presented. An analog system which is presently used for estimating such HCR signals has a moderate resolution and poor throughput. In order to enhance these performance measures, a digital signal processor design which maximizes the signal-to-noise ratio (SNR) of the sequence of measurements is used. The signal to be considered is deterministic and assumed to be known, and is corrupted by colored noise due to inherent sensor imperfections and the environment. By using the digital filter the improvement in resolution is marginal, whereas the expected improvement in throughput is considerable. The performance of the digital signal processor is evaluated for a SNR value of approximately 65 dB.<>
{"title":"Estimation of high count rate signals with a digital filter","authors":"H. Shertukde, L. Godbout, S. C. Elmurr","doi":"10.1109/ICSYSE.1991.161157","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161157","url":null,"abstract":"A methodology for estimating the magnitude of signals generally found in a high-count-rate (HCR) system is presented. An analog system which is presently used for estimating such HCR signals has a moderate resolution and poor throughput. In order to enhance these performance measures, a digital signal processor design which maximizes the signal-to-noise ratio (SNR) of the sequence of measurements is used. The signal to be considered is deterministic and assumed to be known, and is corrupted by colored noise due to inherent sensor imperfections and the environment. By using the digital filter the improvement in resolution is marginal, whereas the expected improvement in throughput is considerable. The performance of the digital signal processor is evaluated for a SNR value of approximately 65 dB.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127450189","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161076
G. Radack, J. Jacobsohn, F. Merat
A method for representing and manipulating information on dimensioning and positioning within a feature-based environment for mechanical parts design is described. In the feature-based design paradigm, designs are constructed using form features which are high-level representations of part geometry, i.e. block, hole, slot, pocket, chamfer, fillet, etc. In the system discussed two modes of positioning form features are supported. The first is a layout mode, which allows the user to position form features relative to each other, in order to layout the general geometry of the part. The second is a dimensioning mode, in which the user specifies which dimensions on the part are critically important, and what they should be. The system completes the dimensioning on request, producing enough dimensions to generate an engineering drawing.<>
{"title":"Positioning features within the Rapid Design System","authors":"G. Radack, J. Jacobsohn, F. Merat","doi":"10.1109/ICSYSE.1991.161076","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161076","url":null,"abstract":"A method for representing and manipulating information on dimensioning and positioning within a feature-based environment for mechanical parts design is described. In the feature-based design paradigm, designs are constructed using form features which are high-level representations of part geometry, i.e. block, hole, slot, pocket, chamfer, fillet, etc. In the system discussed two modes of positioning form features are supported. The first is a layout mode, which allows the user to position form features relative to each other, in order to layout the general geometry of the part. The second is a dimensioning mode, in which the user specifies which dimensions on the part are critically important, and what they should be. The system completes the dimensioning on request, producing enough dimensions to generate an engineering drawing.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"122 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128695982","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161097
S. Vestal
The use of formal scheduling models as a basis for constructing reusable code templates for real-time software is studied. Code templates in a particular language are developed hand-in-hand with formal scheduling models for those templates, where the formal models include necessary run-time or operating system overheads. The code templates can be adapted in ways that correspond to the parameters of the formal model (e.g. number and frequencies of tasks). Ultimately, both an analytic tool to predict system performance metrics and a code generator to produce executive software can be driven by a high-level specification of the tasks in a particular application. This approach is demonstrated for one formal model, rate monotonic scheduling, and one Ada code template.<>
{"title":"Model-based templates for real-time scheduling","authors":"S. Vestal","doi":"10.1109/ICSYSE.1991.161097","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161097","url":null,"abstract":"The use of formal scheduling models as a basis for constructing reusable code templates for real-time software is studied. Code templates in a particular language are developed hand-in-hand with formal scheduling models for those templates, where the formal models include necessary run-time or operating system overheads. The code templates can be adapted in ways that correspond to the parameters of the formal model (e.g. number and frequencies of tasks). Ultimately, both an analytic tool to predict system performance metrics and a code generator to produce executive software can be driven by a high-level specification of the tasks in a particular application. This approach is demonstrated for one formal model, rate monotonic scheduling, and one Ada code template.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114088476","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161105
A. Dhawan, S. Lončarić, S. Ramachandran
The problem of selecting the pyramid level for optimal morphological processing of an image with a selected structuring element is considered. Each level in the image pyramid is eroded by a structuring element and the residue computed. The residues for all pyramid levels are normalized and compared in order to determine the optimal image pyramid level. A method for residue normalization considering the fundamental morphological operation, erosion, is presented. An optimal structuring element can be determined at the selected pyramid level on the basis of minimal residues, providing as complete a representation of the image as possible.<>
{"title":"Optimal multiresolution morphological image processing","authors":"A. Dhawan, S. Lončarić, S. Ramachandran","doi":"10.1109/ICSYSE.1991.161105","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161105","url":null,"abstract":"The problem of selecting the pyramid level for optimal morphological processing of an image with a selected structuring element is considered. Each level in the image pyramid is eroded by a structuring element and the residue computed. The residues for all pyramid levels are normalized and compared in order to determine the optimal image pyramid level. A method for residue normalization considering the fundamental morphological operation, erosion, is presented. An optimal structuring element can be determined at the selected pyramid level on the basis of minimal residues, providing as complete a representation of the image as possible.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128115","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 : 1900-01-01DOI: 10.1109/ICSYSE.1991.161163
K. Lou, T.-H. Fan
A root test for signal detection based on a family of autoregressive (AR) spectral estimates is evaluated. It is observed that the root test fails for the strong narrowband noise case and is asymptotically inconclusive. A ratio test is also studied. The two AR spectra with order n and 2n are dependent. since they use the same first n correlation information. It will be difficult to find the joint density function of the ratio of the two AR spectra above. An example is included.<>
{"title":"Testing hypothesis for signal detection","authors":"K. Lou, T.-H. Fan","doi":"10.1109/ICSYSE.1991.161163","DOIUrl":"https://doi.org/10.1109/ICSYSE.1991.161163","url":null,"abstract":"A root test for signal detection based on a family of autoregressive (AR) spectral estimates is evaluated. It is observed that the root test fails for the strong narrowband noise case and is asymptotically inconclusive. A ratio test is also studied. The two AR spectra with order n and 2n are dependent. since they use the same first n correlation information. It will be difficult to find the joint density function of the ratio of the two AR spectra above. An example is included.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122080442","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
扫码关注我们
求助内容：
应助结果提醒方式：