{"title":"Some Novel Properties of Wiener's Canonical Expansion","authors":"N. Ahmed","doi":"10.1109/TSSC.1969.300205","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300205","url":null,"abstract":"An expression of Wiener's orthogonal functionals {Fn} for an arbitrary variance parameter is presented along with some of its salient properties. A necessary and sufficient condition for the convergence of the corresponding Wiener series is given. Introduction of the variance parameter enables us to discuss some interesting algebraic properties of Wiener's canonical networks also. It is shown that they form a Boolean algebra, each element of which represents a whole family of Wiener's canonical networks for a fixed variance parameter. Applicability of the Wiener theory to time-variable systems and to non-Gaussian processes is briefly discussed.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126666059","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":"Sequential Algorithm for the Design of Piecewise Linear Classifiers","authors":"R. Hoffman, M. Moe","doi":"10.1109/TSSC.1969.300210","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300210","url":null,"abstract":"A sequential algorithm for designing piecewise linear classification functions without a priori knowledge of pattern class distributions is described. The algorithm combines adaptive error correcting linear classifier design procedures and clustering techniques under control of a performance criterion. The classification function structure is constrained to minimize design calculations and increase recognition through-put for many classification problems. Examples from the literature are used to evaluate this approach relative to other classification algorithms.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121695086","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":"Constraint Theory, Part II: Model Graphs and Regular Relations","authors":"G. Friedman, C. Leondes","doi":"10.1109/TSSC.1969.300204","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300204","url":null,"abstract":"The foundations of a \"constraint theory\" whose goal is the systematic analysis of consistency and computability in heterogeneous mathematical models of very high dimension were established in a previous paper [1]. The eventual objective of this theory is to automate the automatic determination of whether a complex mathematical model and its required computations are \"well posed.\" This part concentrates on the topological properties of the bipartite model graph defined in [1] and the application of these properties to the location of intrinsic constraint in large mathematical models composed of \"regular\" relations. In particular, the model graph concepts of connected components, trees, circuits, circuit rank, circuit index, and constraint potential are defined with sufficient precision to allow automatic computation. Regular relations, the most commonly employed for scientific models, are defined and the sources of constraint are identified with the \"basic nodal square,\" a special subgraph embedded within the total model graph. A procedure is then developed which uses the topological properties developed earlier to locate the basic nodal squares within a large complex model graph. The ultimate use of the sources of intrinsic constraint is to check the consistency of the model and the allowability of the computations put to it.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129583781","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":"Open-Hearth and Basic-Oxygen Furnaces: An Allocation Model for Production Planning","authors":"R. Bandyopadhyay","doi":"10.1109/TSSC.1969.300202","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300202","url":null,"abstract":"In a steelworks where both open-hearth and basic-oxygen furnaces are available, there is a genuine problem of allocation of total steel production between the two processes. After briefly explaining the two processes, an attempt is made to develop a linear programming model for obtaining optimum allocation of total steel production between the two processes for production planning purposes. Equations and inequations describing the various technological constraints for the furnaces have been incorporated in the model. A linear cost function is minimized. Procedures for evaluating various technological and cost coefficients (used in the model) have been explained indicating the nature of the difficulties that are encountered in such evaluations under normal operational conditions. The model can also predict the required operation levels of blast furnaces and lime burning plants at different levels of total steel production.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127816569","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":"Increased Efficiency of Neighborhood Storage","authors":"M. Mickle, F. T. Duda","doi":"10.1109/TSSC.1969.300211","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300211","url":null,"abstract":"A technique called neighborhood storage has been developed previously to store and regenerate extensive lists of sequential steps of a decision process such as all the shortest routes in a transportation system. The original formulation can reduce the required storage by more than an order of magnitude over classical techniques. The purpose of this correspondence is to provide a more efficient technique through a modification of the means of selecting feasible intermediate vertices. The revisions for the more efficient storage technique are presented along with comparisons in terms of the original formulation as well as a classical technique.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880169","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":"Hypercorrelation: A Concept for System Characterization","authors":"K. K. K. Kutty, P. Sadanandan, N. Seshagiri","doi":"10.1109/TSSC.1969.300209","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300209","url":null,"abstract":"The concept of \"hypercorrelation\" is introduced as a method for the statistical characterization of systems. It is shown that there exists a minimal set of hypercorrelation coefficients which uniquely characterizes a system for a given transfer function. The method of hypercorrelation is applied to management models and it is shown that certain useful economic conclusions can be drawn from the analysis. Also, a brief mention is made of its application to the characterization of simple multiport systems.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133972947","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 Technique for On-Line Steady-State Optimizing Control","authors":"J. Burghart, Irving Lefkowitz","doi":"10.1109/TSSC.1969.300203","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300203","url":null,"abstract":"A technique for on-line steady-state optimizing control is developed for systems subject to disturbance inputs. The parameters of the control algorithm are updated so as to maximize the expected system performance, based on a prediction of the frequency distribution of the disturbance inputs over the next time interval of operation. The statistical parameters of the distribution are assumed to be slowly time-varying and the adaptation procedure includes their updating, based on past observations of the disturbance variables. Some of the advantages and limitations of the technique are demonstrated by application to the control of a simulated stirred-tank reactor.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114073997","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":"Randomly Generated Nonlinear Transformations for Pattern Recognition","authors":"T. Calvert, T. Young","doi":"10.1109/TSSC.1969.300218","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300218","url":null,"abstract":"In many mathematical and engineering problems the solution is simpler after a transformation has been applied. A general method is proposed to find suitable transformations for discrete data in information processing problems. The main feature of the method is random perturbation of the data subject to constraints which ensure that, in the transformed space, the problem is in some sense simpler and that the local structure of the data is preserved. An application of this technique to pattern recognition is discussed where a transformation is found for the feature space such that classes, which are not linearly separable in the original space, become so in the transformed space. The transformation considerably simplifies the problem and allows well-developed linear discriminant techniques to be applied. This application was implemented and tested with a number of examples which are described.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584681","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":"Stochastic Automata Games","authors":"B. Chandrasekaran, D. Shen","doi":"10.1109/TSSC.1969.300206","DOIUrl":"https://doi.org/10.1109/TSSC.1969.300206","url":null,"abstract":"The collective behavior of finite state stochastic automata is considered, which is of interest in view of the possibility of modeling group behavior of subjects in terms of these automata. The natural language for considering the collective behavior is that of game theory. After a brief introduction to a class of deterministic automata, the stochastic automaton is formulated and a nonlinear reinforcement specified. The finite state stochastic automaton is first considered in a game with nature, and conditions under which the automaton's winnings reach the Von Neumann value of the game are established. Next, two stochastic automata with an arbitrary number of states for each are considered in a game, the game matrix being specified. Performance of the automata for various conditions on the elements of the game matrix is considered. In a comparison of performance with deterministic automata, it is established that, for performance comparable to that of the finite state stochastic automaton, the deterministic automaton needs an infinite number of states. Finally, some games are simulated on a computer which verifies the general analysis and further sheds light on the details of the game.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132632655","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":"An Antisubmarine Warfare Model for Convoy Protection","authors":"W. Fenn","doi":"10.1109/TSSC.1968.300168","DOIUrl":"https://doi.org/10.1109/TSSC.1968.300168","url":null,"abstract":"A scheme for using helicopters to protect convoys of merchant ships against attack by enemy submarines has been modeled to study the equipment characteristics and tactics. The model handles multiple convoys, helicopters, enemy submarines, and false targets and deals with the detailed interactions and geometric relationships among them. The model contains a complete situation: convoys leave port at intervals to cross an ocean area; submarines leave their port and navigate to a patrol area; sonar detections are made, weapons are launched, survivors continue in the model until port is reached or supplies run low; etc. The conflict can continue for any number of convoy crossings as predetermined by the modeler.","PeriodicalId":120916,"journal":{"name":"IEEE Trans. Syst. Sci. Cybern.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1968-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588477","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号
