Pub Date : 1989-11-14DOI: 10.1109/ICSMC.1989.71259
B. Brandin, T. Chen, C. Derventzis, G. Pang
A novel approach to the control and supervision problem for groups of elevators has been successfully developed and tested by simulation. The control and supervisory tasks have been implemented using the blackboard approach to problem solving in which several knowledge sources cooperate, providing a very flexible problem solving framework. The blackboard shell control unit developed in this study uses a dual-level control structure and a comprehensive data structure for the knowledge source descriptors. The modularity of the control and supervisory system allows the control and supervisory strategies to be modified or extended simply by adjoining additional knowledge sources to the existing ones and tuning different knowledge source descriptors.<>
{"title":"The control and supervision of groups of elevators using the blackboard architecture approach","authors":"B. Brandin, T. Chen, C. Derventzis, G. Pang","doi":"10.1109/ICSMC.1989.71259","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71259","url":null,"abstract":"A novel approach to the control and supervision problem for groups of elevators has been successfully developed and tested by simulation. The control and supervisory tasks have been implemented using the blackboard approach to problem solving in which several knowledge sources cooperate, providing a very flexible problem solving framework. The blackboard shell control unit developed in this study uses a dual-level control structure and a comprehensive data structure for the knowledge source descriptors. The modularity of the control and supervisory system allows the control and supervisory strategies to be modified or extended simply by adjoining additional knowledge sources to the existing ones and tuning different knowledge source descriptors.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"80 1","pages":"99-104 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88272647","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71318
R. Jha, M. Jernigan
A novel adaptive filter for edge-preserving smoothing of noisy images is introduced. The novelty of the filter is that its region of support is tuned simultaneously in its size and orientation. An edge strength measure is extracted from the local variance and used to control the size of the window. The gradient direction is used to adapt the orientation of the window. The use of both edge strength and edge detection information allows large windows to be used even in the vicinity of edges. The filter has been tested for additive white Gaussian noise with the mean as the point estimator over local windows, and for additive white impulse noise with the median as the point estimator. Results, particularly for the adaptive median filter, are very promising. The results show that the filter does greater smoothing in the vicinity of edges without compromising performance away from edges and the edge structure of the image.<>
{"title":"Edge adaptive filtering: how much and which direction?","authors":"R. Jha, M. Jernigan","doi":"10.1109/ICSMC.1989.71318","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71318","url":null,"abstract":"A novel adaptive filter for edge-preserving smoothing of noisy images is introduced. The novelty of the filter is that its region of support is tuned simultaneously in its size and orientation. An edge strength measure is extracted from the local variance and used to control the size of the window. The gradient direction is used to adapt the orientation of the window. The use of both edge strength and edge detection information allows large windows to be used even in the vicinity of edges. The filter has been tested for additive white Gaussian noise with the mean as the point estimator over local windows, and for additive white impulse noise with the median as the point estimator. Results, particularly for the adaptive median filter, are very promising. The results show that the filter does greater smoothing in the vicinity of edges without compromising performance away from edges and the edge structure of the image.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"73 1","pages":"364-366 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87279198","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71325
H. Arsenault
Pathological behavior of some recently proposed neural net models is shown to depend on how the similarity is defined. The obvious binary interconnection schemes using weights of
最近提出的一些神经网络模型的病理行为取决于如何定义相似性。的二元互连方案
{"title":"Similarity and pathology in neural nets","authors":"H. Arsenault","doi":"10.1109/ICSMC.1989.71325","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71325","url":null,"abstract":"Pathological behavior of some recently proposed neural net models is shown to depend on how the similarity is defined. The obvious binary interconnection schemes using weights of","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"59 1","pages":"401-404 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79237800","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71402
C. Ganesh, Gregor Dietz, J. Jambor
A two-level hierarchical control structure is used to achieve motion-control of a robotic manipulator. A highly-directional ultrasonic distance ranging device is utilized to measure features of interest in the workspace of the robot arm. Off-line trajectory planning is combined with online motion guidance by the supervisory controller to formulate and execute the desired path movement. In a demonstration application, the vertical distance from a workpiece surface was measured and utilized to perform online trajectory adjustment for the robot cutting-tool motion. This makes it possible to compensate for factors such as robot performance limitations, inaccurate fixturing and inexact object location. The hardware implementation and control strategy used to provide verification of the concept are presented, along with the experimental results achieved.<>
{"title":"Ultrasonic sensor-based motion control for robotic manipulators","authors":"C. Ganesh, Gregor Dietz, J. Jambor","doi":"10.1109/ICSMC.1989.71402","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71402","url":null,"abstract":"A two-level hierarchical control structure is used to achieve motion-control of a robotic manipulator. A highly-directional ultrasonic distance ranging device is utilized to measure features of interest in the workspace of the robot arm. Off-line trajectory planning is combined with online motion guidance by the supervisory controller to formulate and execute the desired path movement. In a demonstration application, the vertical distance from a workpiece surface was measured and utilized to perform online trajectory adjustment for the robot cutting-tool motion. This makes it possible to compensate for factors such as robot performance limitations, inaccurate fixturing and inexact object location. The hardware implementation and control strategy used to provide verification of the concept are presented, along with the experimental results achieved.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"32 1","pages":"796-797 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84658257","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71327
E. Paek, J. Wullert, A. Lehmen, J. S. Patel, A. Scherer, J. Harbison, H. J. Yu, R. Martin
Several experimental demonstrations of neural networks using coherent optics are demonstrated. An associative memory for word-break recognition and a learning machine for multicategory classification are discussed. Finally, a compact and robust coherent optical processor using a recently developed SELDA (surface emitting micro-laser diode array) is described. Although the applications are different, all these implementations are based on the VanderLugt correlator.<>
{"title":"VanderLugt correlator and neural networks","authors":"E. Paek, J. Wullert, A. Lehmen, J. S. Patel, A. Scherer, J. Harbison, H. J. Yu, R. Martin","doi":"10.1109/ICSMC.1989.71327","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71327","url":null,"abstract":"Several experimental demonstrations of neural networks using coherent optics are demonstrated. An associative memory for word-break recognition and a learning machine for multicategory classification are discussed. Finally, a compact and robust coherent optical processor using a recently developed SELDA (surface emitting micro-laser diode array) is described. Although the applications are different, all these implementations are based on the VanderLugt correlator.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"207 1","pages":"408-414 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75458625","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71418
J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore
An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<>
{"title":"The usability of lists versus graphs for representing the relationships between frames","authors":"J. Hary, Tim P. McCollum, M. J. Darnell, Gene Moore","doi":"10.1109/ICSMC.1989.71418","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71418","url":null,"abstract":"An experiment was conducted to compare user's performance using a list or graph in tasks which required users to verify statements about relationships between frames. The results showed a response time advantage for the graph that depended on the type of task performed. For tasks which involved simply verifying that a given frame existed or verifying a direct relationship between two frames, use of the list and graph resulted in about equal response time. For tasks which involved verifying indirect relationships between frames, or verifying that a particular frame occurred in a navigational pathway between two other frames, the graph was much faster than the list. The magnitude of the advantage depended on the number of direct relationships that had to be navigated to perform the task; the more the direct relationships that had to be navigated, the greater was the advantage for the graph. These results suggest that the relationships between frames should be presented to users as a graph.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"5 1","pages":"867-871 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83323831","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71457
A. Perry, D. Lowe
A method for unsupervised segmentation of textured regions is presented. Rather than identifying boundaries between texture patches, this method detects regions of uniform texture in real images. No a priori knowledge regarding the image, the texture types, or their scales is assumed. The images may contain an unknown number of texture regions including regions with no texture at all. The method is most useful for identifying textures in which sharp intensity changes constitute the most distinctly perceived characteristic. Texture features are computed over image subregions from the distributions of local orientations and the separations of zero-crossing points. The segmentation algorithm establishes the existence of texture regions by finding neighboring subregions that share one or more nonaccidental properties of the computed features, e.g., a distribution of local orientations with a significant peak. Regions' accurate boundaries are identified by extending the seed regions using a region-growing technique that is applied to the computed texture features. The growth is directed by a region-specific self-adaptive thresholding scheme. No assumption is made regarding the texture scale, and the feature analysis is performed across multiple neighborhood (window) sizes. As a result different textures in the image may be segmented using different window sizes.<>
{"title":"Segmentation of nonrandom textures using zero-crossings","authors":"A. Perry, D. Lowe","doi":"10.1109/ICSMC.1989.71457","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71457","url":null,"abstract":"A method for unsupervised segmentation of textured regions is presented. Rather than identifying boundaries between texture patches, this method detects regions of uniform texture in real images. No a priori knowledge regarding the image, the texture types, or their scales is assumed. The images may contain an unknown number of texture regions including regions with no texture at all. The method is most useful for identifying textures in which sharp intensity changes constitute the most distinctly perceived characteristic. Texture features are computed over image subregions from the distributions of local orientations and the separations of zero-crossing points. The segmentation algorithm establishes the existence of texture regions by finding neighboring subregions that share one or more nonaccidental properties of the computed features, e.g., a distribution of local orientations with a significant peak. Regions' accurate boundaries are identified by extending the seed regions using a region-growing technique that is applied to the computed texture features. The growth is directed by a region-specific self-adaptive thresholding scheme. No assumption is made regarding the texture scale, and the feature analysis is performed across multiple neighborhood (window) sizes. As a result different textures in the image may be segmented using different window sizes.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"103 1","pages":"1051-1054 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83423113","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71377
Y. Fainman, Liqiang Feng, Y. Koren
A mobile system with a hybrid opto-electronic processor has been studied. The position estimation is based on analysis of landmarks being detected by a TV-camera attached to the mobile system. The difference between the known real shape of the landmark and its image provides the information necessary for determining the relative position of the mobile system to the landmark. The parameters of the landmark image are extracted at high speed using an optical processor that performs an optical Hough transform, while the coordinates of the mobile system are computed from these parameters in a digital coprocessor using fast and simple algorithms. Different sources of errors have been analyzed, and algorithms to improve the performance of the mobile system have been developed and evaluated by computer simulation.<>
{"title":"Estimation of absolute spatial position of mobile systems by hybrid opto-electronic processor","authors":"Y. Fainman, Liqiang Feng, Y. Koren","doi":"10.1109/ICSMC.1989.71377","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71377","url":null,"abstract":"A mobile system with a hybrid opto-electronic processor has been studied. The position estimation is based on analysis of landmarks being detected by a TV-camera attached to the mobile system. The difference between the known real shape of the landmark and its image provides the information necessary for determining the relative position of the mobile system to the landmark. The parameters of the landmark image are extracted at high speed using an optical processor that performs an optical Hough transform, while the coordinates of the mobile system are computed from these parameters in a digital coprocessor using fast and simple algorithms. Different sources of errors have been analyzed, and algorithms to improve the performance of the mobile system have been developed and evaluated by computer simulation.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"41 1","pages":"651-657 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78889124","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71342
A. D. Greenberg
The theoretical basis and the practical architecture are presented for a distributed error monitor (DEM) in an intelligent interface, extended as necessary to provide error tolerance in a multioperator environment. DEM will contain several knowledge-based models: a distributed intent model, an organizational model, a local and distributed task model, a consequence model, and a heuristic model of error forms. The architecture will also include two kinds of dynamic conceptual memory. Finally, an intelligent data network (DN) will communicate distributed situation awareness.<>
{"title":"Distributed error monitoring","authors":"A. D. Greenberg","doi":"10.1109/ICSMC.1989.71342","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71342","url":null,"abstract":"The theoretical basis and the practical architecture are presented for a distributed error monitor (DEM) in an intelligent interface, extended as necessary to provide error tolerance in a multioperator environment. DEM will contain several knowledge-based models: a distributed intent model, an organizational model, a local and distributed task model, a consequence model, and a heuristic model of error forms. The architecture will also include two kinds of dynamic conceptual memory. Finally, an intelligent data network (DN) will communicate distributed situation awareness.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"13 1","pages":"484-488 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78382835","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 : 1989-11-14DOI: 10.1109/ICSMC.1989.71296
M. F. Hassan, M. I. Younis, M. Sultan
Hierarchical control theory is applied to the problem of management of passengers and luggage in an airport terminal. For this purpose, the airport system is analyzed and a mathematical model representing the dynamics of the controlled sections is proposed. A well-known interaction prediction method is utilized to achieve optimal performance of the system through the minimization of the queue lengths and hence the waiting time of passengers. Simulation results from a case study of Cairo Airport are presented and discussed.<>
{"title":"Management and control of a complex airport terminal","authors":"M. F. Hassan, M. I. Younis, M. Sultan","doi":"10.1109/ICSMC.1989.71296","DOIUrl":"https://doi.org/10.1109/ICSMC.1989.71296","url":null,"abstract":"Hierarchical control theory is applied to the problem of management of passengers and luggage in an airport terminal. For this purpose, the airport system is analyzed and a mathematical model representing the dynamics of the controlled sections is proposed. A well-known interaction prediction method is utilized to achieve optimal performance of the system through the minimization of the queue lengths and hence the waiting time of passengers. Simulation results from a case study of Cairo Airport are presented and discussed.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"42 1","pages":"274-279 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72930066","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
扫码关注我们
求助内容：
应助结果提醒方式：