{"title":"Neural implementation of tree classifiers","authors":"I. Sethi","doi":"10.1109/21.398685","DOIUrl":"https://doi.org/10.1109/21.398685","url":null,"abstract":"Tree classifiers represent a popular non-parametric classification methodology that has been successfully used in many pattern recognition and learning tasks. However, \"is feature-value/spl ges/thrsh\" type of tests used in tree classifiers are often found sensitive to noise and minor variations in the data. This has led to the use of soft thresholding in decision trees. Following the decision tree to feedforward neural network mapping of the entropy net, three neural implementation schemes for tree classifiers, that allow soft thresholding, are presented in this paper. Results of several experiments using well-known data sets are described to compare the performance of the proposed implementations with respect to decision trees with hard thresholding. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"131 1","pages":"1243-1249"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82255132","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}
{"title":"Including probabilistic uncertainty in fuzzy logic controller modeling using Dempster-Shafer theory","authors":"R. Yager, Dimitar Filev","doi":"10.1109/21.398683","DOIUrl":"https://doi.org/10.1109/21.398683","url":null,"abstract":"Discusses some basic ideas from the Dempster-Shafer theory of evidence. The authors describe the concept of fuzzy systems modeling used in fuzzy logic control. The authors use the Dempster-Shafer framework to provide a machinery for including randomness in the fuzzy systems modeling process. The authors show how to represent additive noise in this combined framework. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"111 5 1","pages":"1221-1230"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89399526","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}
{"title":"Efficient dynamic simulation of an underwater vehicle with a robotic manipulator","authors":"S. McMillan, D. Orin, R. McGhee","doi":"10.1109/21.398681","DOIUrl":"https://doi.org/10.1109/21.398681","url":null,"abstract":"In this paper, an efficient dynamic simulation algorithm is developed for an underwater robotic vehicle (URV) with a manipulator. It is based on previous work on efficient O(N) algorithms, where N is the number of links in the manipulator, and has been extended to include the effects of a mobile base (the URV body). In addition, the various hydrodynamic forces exerted on these systems in underwater environments are also incorporated into the simulation. The effects modeled in this work are added mass, viscous drag, fluid acceleration, and buoyancy forces. With efficient implementation of the resulting algorithm, the amount of computation with inclusion of the hydrodynamics is almost double that of the original algorithm for a six degree-of-freedom land-based manipulator with a mobile base. Nevertheless, the amount of computation still only grows linearly with the number of degrees of freedom in the manipulator. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"45 1","pages":"1194-1206"},"PeriodicalIF":0.0,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78572662","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}
{"title":"Optimization of traffic dynamic route guidance with drivers' reactions in a queue-based model","authors":"J. Weymann, J. Farges, J. Henry","doi":"10.1109/21.391297","DOIUrl":"https://doi.org/10.1109/21.391297","url":null,"abstract":"This correspondence presents an optimal guidance algorithm which takes into account the driver's compliance to route advice. The optimal control consists of minimizing the travel time of guided vehicles using a queue-based model. The optimization is based on the use of forward dynamic programming and decomposition-coordination methods. Driver's compliance is modeled by a linear function of the guidance advice (control). An assessment of the criteria degradation induced by nonperfect compliance is performed. Results show that this degradation of the criteria is low in fluid traffic conditions but high in congested situations. Thus human factors cannot be neglected in route guidance systems. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"25 1","pages":"1161-1165"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81780314","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}
{"title":"Information systems: a construct of transformations","authors":"I. Spiegler","doi":"10.1109/21.391292","DOIUrl":"https://doi.org/10.1109/21.391292","url":null,"abstract":"The paper provides a classification and typology of various configurations which make up the definition of an information system (IS). It is based on five basic building blocks: source, data, prediction, value, and action. Using those building blocks, it is possible to formally outline many configurations including data base management systems (DBMS), decision support systems (DSS), expert systems (ES), and autonomous intelligent machines (AIM). This paper formally defines the building blocks, functions and operators of systems that fall into the class of information system. The result is a cohesive construct of transformations for IS through which a variety of new configurations and systems are enumerated and explained. Such model, may make it possible to assemble an information system from \"off the shelf\" components rather than constructing it as done today. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"48 1","pages":"1121-1129"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91356974","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}
{"title":"A best-first search algorithm guided by a set-valued heuristic","authors":"J. Lark, C. White, Kirsten Syverson","doi":"10.1109/21.391289","DOIUrl":"https://doi.org/10.1109/21.391289","url":null,"abstract":"Presents an algorithm, called A/sup G/, for finding the least-cost path from start node to goal node set in an OR-graph, where arc costs are scalar-valued and the cost of each path is the sum of the concomitant arc costs. Search is guided by a set, H, of real-valued functions on the node set. Such a heuristic set can be a useful representation of knowledge acquired from human knowledge sources. If H. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"47 1","pages":"1097-1101"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85434269","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}
{"title":"Human-computer cooperative problem solving: theory, design, and evaluation of an intelligent associate system","authors":"P. M. Jones, C. Mitchell","doi":"10.1109/21.391286","DOIUrl":"https://doi.org/10.1109/21.391286","url":null,"abstract":"One approach to aiding the human supervisory controller of a complex dynamic system is to provide an intelligent operator's associate. We propose a prescriptive theory of human-computer cooperative problem solving and describes the design and evaluation of a prototype system based on the theory. The theory consists of five principles: human-in-charge, mutual intelligibility, openness and honesty, management of trouble, and multiple perspectives. A prototype intelligent associate system, the Georgia Tech Mission Operations Cooperative Assistant (GT-MOCA), is an embodiment of these principles that provides a collection of context-sensitive resources for the human operator of a simulated satellite ground control system. These resources include an interactive visualization of current activities, an organized message lists of important events, and interactive graphics depicting the current state of the controlled system. An evaluation study utilizing actual NASA satellite ground controllers showed that GT-MOCA was perceived to be useful and provided performance benefits for certain portions of the control task. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"91 1","pages":"1039-1053"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82143262","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}
{"title":"Mixture decomposition for distributions from the exponential family using a generalized method of moments","authors":"S. T. Sum, B. Oommen","doi":"10.1109/21.391294","DOIUrl":"https://doi.org/10.1109/21.391294","url":null,"abstract":"A finite mixture distribution consists of the superposition of a finite number of component probability densities, and is typically used to model a population composed of two or more subpopulations. Mixture models find utility in situations where there is a difficulty in directly observing the underlying components of the population of interest. This paper examines the method of moments as a general estimation technique for estimating the parameters of the component distributions and their mixing proportions. It is shown that the same basic solution can be applied to any continuous or discrete density from the exponential family with a known common shape parameter. Results of an empirical study of the method are also presented. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"1 1","pages":"1139-1149"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76412290","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}
{"title":"Distributed simulated annealing algorithms for job shop scheduling","authors":"K. Krishna, K. Ganeshan, D. Ram","doi":"10.1109/21.391290","DOIUrl":"https://doi.org/10.1109/21.391290","url":null,"abstract":"Job shop scheduling belongs to the class of NP-hard problems. There are a number of algorithms in literature for finding near optimal solution for the job shop scheduling problem. Many of these algorithms exploit the problem specific information and hence are less general. However, the simulated annealing algorithm for job shop scheduling is general and produces better results in comparison with other similar algorithms. But one of the major drawbacks of the algorithm is that the execution time is high. This makes the algorithm inapplicable to large scale problems. One possible approach to reduce the execution time of the algorithm is to develop distributed algorithms for simulated annealing. In the paper, the authors discuss approaches to developing distributed algorithms for simulated annealing for solving the job shop scheduling problem. Three different algorithms have been developed. These are the temperature modifier, the locking edges and the modified locking edges algorithms. These algorithms have been implemented on the distributed task sharing system (DTSS) running on a network of 18 Sun workstations. The observed performance showed that each of these algorithms performs well depending on the problem size. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"20 1","pages":"1102-1109"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73078326","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}
{"title":"Wholes and parts-a systems approach","authors":"J. Boardman","doi":"10.1109/21.391296","DOIUrl":"https://doi.org/10.1109/21.391296","url":null,"abstract":"This paper examines some of the properties of abstract systems. Structures of physical systems (such as atoms, buildings, etc.) are easy to understand and study, but abstract systems (human centered) can not be studied so easily. Ideas concerning parts, wholes and structures are presented, together with system diagrams (systemigrams). This paper outlines three examples where technology management has been analyzed with a systems approach. It is important to view the whole system under observation when considering its parts and its environment. Its environment is set by its boundaries, so deciding where boundaries lie in an abstract system is also discussed. >","PeriodicalId":79994,"journal":{"name":"IEEE transactions on systems, man, and cybernetics","volume":"35 1","pages":"1150-1161"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81442275","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}