Pub Date : 1990-08-09DOI: 10.1109/ICSYSE.1990.203183
J. M. Miller, G. Stockman
An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders
{"title":"Precedence constraints and tasks: how many task orderings?","authors":"J. M. Miller, G. Stockman","doi":"10.1109/ICSYSE.1990.203183","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203183","url":null,"abstract":"An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129343132","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-08-09DOI: 10.1109/ICSYSE.1990.203141
L. Hong, D. Brzakovic
A method for noise removal in image processing is described. The method does not require any prior knowledge about the image, and it uses a signal model that represents two independent dynamics of the signal. This model is used as the basis for adaptive Kalman filtering. The method is based on the generalised likelihood ratio. It has the capability to retain fast transients that are attributed to important changes in the images while it removes the noise added to the slow transients. The method has been implemented in 1D fashion. With an easy extension, it can be readily implemented in a 2D fashion. Satisfactory results obtained when processing 1D and 2D signals are shown
{"title":"GLR-based adaptive Kalman filtering in noise removal","authors":"L. Hong, D. Brzakovic","doi":"10.1109/ICSYSE.1990.203141","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203141","url":null,"abstract":"A method for noise removal in image processing is described. The method does not require any prior knowledge about the image, and it uses a signal model that represents two independent dynamics of the signal. This model is used as the basis for adaptive Kalman filtering. The method is based on the generalised likelihood ratio. It has the capability to retain fast transients that are attributed to important changes in the images while it removes the noise added to the slow transients. The method has been implemented in 1D fashion. With an easy extension, it can be readily implemented in a 2D fashion. Satisfactory results obtained when processing 1D and 2D signals are shown","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181864","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-08-09DOI: 10.1109/ICSYSE.1990.203200
J. G. Kelly, R. Carpenter, J. Tague, N. Haddad
The active sonar classification problem is considered. To perform active classification, a known waveform is transmitted into a medium and directed towards a region called the test volume. An array of sensors is used to pick up the backscattered signal energy reflected from the cells of the test volume. The data are input into a processing algorithm. The processor is to decide whether an object is present and, if so, what kind of object is present. A systematic method for evaluating classifier performance is derived. A sensitivity analysis and interpretation of processor performance is made. An analysis of processor performance as a function of angular resolution is described
{"title":"Optimum object classification with active sonar: new theoretical results","authors":"J. G. Kelly, R. Carpenter, J. Tague, N. Haddad","doi":"10.1109/ICSYSE.1990.203200","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203200","url":null,"abstract":"The active sonar classification problem is considered. To perform active classification, a known waveform is transmitted into a medium and directed towards a region called the test volume. An array of sensors is used to pick up the backscattered signal energy reflected from the cells of the test volume. The data are input into a processing algorithm. The processor is to decide whether an object is present and, if so, what kind of object is present. A systematic method for evaluating classifier performance is derived. A sensitivity analysis and interpretation of processor performance is made. An analysis of processor performance as a function of angular resolution is described","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132282289","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-08-09DOI: 10.1109/ICSYSE.1990.203195
T. Hinamoto
The lossless bounded-real lemma for 2D systems is developed. This is based on the second local state-space (LSS) model of E. Fornasini and G. Marchesini (Math. Syst. Theory, vol.12, p.59-72, 1978; IEEE Trans. Circuits Syst. vol.CAS-27, p.1210-7, 1980). A condition for a 2D system to be bounded-real is also investigated. Similar arguments can be applied to the Roesser LSS model. The lossless bounded-real property is treated in conjunction with the asymptotic stability and the overflow oscillation in 2D systems
{"title":"The bounded-real lemma for two-dimensional systems","authors":"T. Hinamoto","doi":"10.1109/ICSYSE.1990.203195","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203195","url":null,"abstract":"The lossless bounded-real lemma for 2D systems is developed. This is based on the second local state-space (LSS) model of E. Fornasini and G. Marchesini (Math. Syst. Theory, vol.12, p.59-72, 1978; IEEE Trans. Circuits Syst. vol.CAS-27, p.1210-7, 1980). A condition for a 2D system to be bounded-real is also investigated. Similar arguments can be applied to the Roesser LSS model. The lossless bounded-real property is treated in conjunction with the asymptotic stability and the overflow oscillation in 2D systems","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130240748","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-08-09DOI: 10.1109/ICSYSE.1990.203208
N. Rafla, F. Merat
A method called vision-taction exploration (VTE) for generating surface descriptions from range vision and tactile sensor data is described. The range vision systems available provide sparse 3D data about surfaces. These data are partially processed to provide primary surface features such as surface points and surface normals. With the use of tactile and force-torque sensors under position control, supplementary data are obtained and processed to generate surface features identical to those generated from the vision data. These two sets of data are integrated and processed at a higher level for surface representation and classification. The VTE process levels are described. The touch system has been implemented, and the resulting surface description is presented
{"title":"Vision-taction integration for surface representation","authors":"N. Rafla, F. Merat","doi":"10.1109/ICSYSE.1990.203208","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203208","url":null,"abstract":"A method called vision-taction exploration (VTE) for generating surface descriptions from range vision and tactile sensor data is described. The range vision systems available provide sparse 3D data about surfaces. These data are partially processed to provide primary surface features such as surface points and surface normals. With the use of tactile and force-torque sensors under position control, supplementary data are obtained and processed to generate surface features identical to those generated from the vision data. These two sets of data are integrated and processed at a higher level for surface representation and classification. The VTE process levels are described. The touch system has been implemented, and the resulting surface description is presented","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736334","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-08-09DOI: 10.1109/ICSYSE.1990.203204
T. Alameldin, N. Badler, T. Sobh
An efficient system for computing the 3D reachable workspace for redundant manipulators with joint limits is presented. In this system, the 3D reachable workspace problem is decomposed into two major subproblems. They are workspace point generation and surface computation. Different algorithms are described that are used to build these modules. The advantages offered by the system include modularity, flexibility, parallel implementation, adaptability, and generality
{"title":"An adaptive and efficient system for computing the 3D reachable workspace","authors":"T. Alameldin, N. Badler, T. Sobh","doi":"10.1109/ICSYSE.1990.203204","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203204","url":null,"abstract":"An efficient system for computing the 3D reachable workspace for redundant manipulators with joint limits is presented. In this system, the 3D reachable workspace problem is decomposed into two major subproblems. They are workspace point generation and surface computation. Different algorithms are described that are used to build these modules. The advantages offered by the system include modularity, flexibility, parallel implementation, adaptability, and generality","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896421","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-08-09DOI: 10.1109/ICSYSE.1990.203238
R. Mitchell, A. Shaw
A time-delay neural network (TDNN) architecture is used for speaker independent recognition of the long vowel sounds. A brief introduction to the TDNN architecture and a description of the data used for the simulation are given. Previously published work is extended by training the network with the linear predictive coding (LPC) coefficients of speech along with fast Fourier transform bin energies and by allowing longer and variable length utterances. The training has been performed with multiple speakers using English rather than Japanese speech. With these modifications, 100% recognition of all vowels spoken by two speakers was obtained
{"title":"Vowel recognition with a time-delay neural network","authors":"R. Mitchell, A. Shaw","doi":"10.1109/ICSYSE.1990.203238","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203238","url":null,"abstract":"A time-delay neural network (TDNN) architecture is used for speaker independent recognition of the long vowel sounds. A brief introduction to the TDNN architecture and a description of the data used for the simulation are given. Previously published work is extended by training the network with the linear predictive coding (LPC) coefficients of speech along with fast Fourier transform bin energies and by allowing longer and variable length utterances. The training has been performed with multiple speakers using English rather than Japanese speech. With these modifications, 100% recognition of all vowels spoken by two speakers was obtained","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129224191","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-08-09DOI: 10.1109/ICSYSE.1990.203205
M. Celenk, W. Sun
A 3D robot path planning algorithm for use in a time-varying environment, which uses octree data structures, is described. The algorithm operates in two steps. First, the moving obstacles are removed from the environment so that a collision-free path is planned in the 3D stationary workspace. Secondly, the 3D volume swept by the motion of the obstacles is represented by an octree, which is then used to modify the path at the collision places
{"title":"3D visual robot guidance in dynamic environment","authors":"M. Celenk, W. Sun","doi":"10.1109/ICSYSE.1990.203205","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203205","url":null,"abstract":"A 3D robot path planning algorithm for use in a time-varying environment, which uses octree data structures, is described. The algorithm operates in two steps. First, the moving obstacles are removed from the environment so that a collision-free path is planned in the 3D stationary workspace. Secondly, the 3D volume swept by the motion of the obstacles is represented by an octree, which is then used to modify the path at the collision places","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129249377","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-08-09DOI: 10.1109/ICSYSE.1990.203229
N. Hemati, J. Thorp, M. Leu
A robust control law is derived and examined for a direct-drive robot arm driven by a brushless DC motor (BLDCM). The complete dynamics of the motor and its interaction with the robot arm are accounted for. This is important, since in a direct-drive servo system the torque generated by the motor is directly transmitted to the load. Effects of magnetic saturation as well as reluctance variations are accounted for, in order to ensure accuracy. The effectiveness of the method is examined through computer simulations. The computational complexity of the overall control scheme is such that it can be readily used for real-time control
{"title":"Robust nonlinear control of brushless DC motors in the presence of magnetic saturation","authors":"N. Hemati, J. Thorp, M. Leu","doi":"10.1109/ICSYSE.1990.203229","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203229","url":null,"abstract":"A robust control law is derived and examined for a direct-drive robot arm driven by a brushless DC motor (BLDCM). The complete dynamics of the motor and its interaction with the robot arm are accounted for. This is important, since in a direct-drive servo system the torque generated by the motor is directly transmitted to the load. Effects of magnetic saturation as well as reluctance variations are accounted for, in order to ensure accuracy. The effectiveness of the method is examined through computer simulations. The computational complexity of the overall control scheme is such that it can be readily used for real-time control","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127256445","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-08-09DOI: 10.1109/ICSYSE.1990.203180
R. Karinthi, Dana S. Nau
An algebraic approach to handling feature interactions is presented. Given one valid interpretation of a machinable part as a collection of machinable features, all other valid interpretations of the part as other collections of machinable features can be derived through operations in the feature algebra. A subset of this feature algebra dealing with rectangular solids and cylinders has been implemented as the basis of a geometric reasoning system for use in communicating between a solid modeler and a process planning system
{"title":"Using a feature algebra in process planning","authors":"R. Karinthi, Dana S. Nau","doi":"10.1109/ICSYSE.1990.203180","DOIUrl":"https://doi.org/10.1109/ICSYSE.1990.203180","url":null,"abstract":"An algebraic approach to handling feature interactions is presented. Given one valid interpretation of a machinable part as a collection of machinable features, all other valid interpretations of the part as other collections of machinable features can be derived through operations in the feature algebra. A subset of this feature algebra dealing with rectangular solids and cylinders has been implemented as the basis of a geometric reasoning system for use in communicating between a solid modeler and a process planning system","PeriodicalId":259801,"journal":{"name":"1990 IEEE International Conference on Systems Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127664304","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
扫码关注我们
求助内容：
应助结果提醒方式：