One of the most serious problems encountered in Naval steam plants following World War II was the unreliable performance of boiler and main feedpump pneumatic control systems. In addition to control component and syst...
One of the most serious problems encountered in Naval steam plants following World War II was the unreliable performance of boiler and main feedpump pneumatic control systems. In addition to control component and system design deficiencies, these control systems suffered from inadequate methods to measure and adjust system alignment. This paper describes the development of a set of procedures for on-line alignment verification (OLV) of pneumatic main boiler and feedpump control systems. The procedures are designed for use by N avy control system technicians and, in addition to on-line alignment verification, provide guidance for troubleshooting and for performing system alignment. Procedure static checks measure steady state steaming performance and OLV procedure dynamic checks measure the ability of the boiler and control systems to respond to load changes. The paper describes typical control system characteristics that influence OLV procedure content and the supporting analysis that was used to establish alignment criteria ranges that satisfy both steady state and transient performance requirements. Also described is the alignment criteria tolerance analysis along with the steps involved in a typical OLV check procedure development. Descriptions of the various OLV checks, troubleshooting procedures and alignment procedures are provided. Typical shipboard implementation requirements are described and experience to date with the procedures is provided along with a status report on OLV procedure implementations.
The computer generation of pseudorandom variates from the beta distribution is discussed. Three exact methods applicable for parameter values p > 1 and q > 1 are presented. All three are acceptance/rejection met...
详细信息
The computer generation of pseudorandom variates from the beta distribution is discussed. Three exact methods applicable for parameter values p > 1 and q > 1 are presented. All three are acceptance/rejection methods, based on functions of the location of the mode and points of inflection. The methods differ in the amount of the set-up required, with higher set-up times generally resulting in lower marginal generation times. Generation times are compared to four methods in current use: ratio of gamma variates, and the methods of Johnk, Ahrens and Dieter, and Cheng. Over a wide range of parameter values marginal generation times are reduced. [ABSTRACT FROM AUTHOR]
作者：
BERTSEKAS, DPAssociate Professor
Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts
In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a ...
详细信息
In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a nonconvex problem is convexified and transformed into one which can be solved with the aid of primal-dual methods. Under this transformation, separability of the type necessary for application of decomposition algorithms is preserved. This feature extends the range of applicability of such algorithms to nonconvex problems. Relations with multiplier methods are explored with the aid of a local version of the notion of a conjugate convex function.
MACSYMA is a large LISP system which performs symbolic manipulations such as differentiation, simplification, integration and solution of equations with parametric coefficients. After exhibiting various examples of th...
ISBN:
(纸本)9781450374408
MACSYMA is a large LISP system which performs symbolic manipulations such as differentiation, simplification, integration and solution of equations with parametric coefficients. After exhibiting various examples of the system, we shall present some of the data representations used by MACSYMA to model abstract algebraic structures such as polynomial *** references are given for those wishing more introductory information about MACSYMA.
APL and LISP are very similar languages—both manipulate a complex data structure and the functional structure of the languages has been ideally chosen for convenient manipulation of these structures. Proposals have b...
ISBN:
(纸本)9781450374408
APL and LISP are very similar languages—both manipulate a complex data structure and the functional structure of the languages has been ideally chosen for convenient manipulation of these structures. Proposals have been made to combine them by embedding one within the other. Another approach is generalization of each into a common superior. This paper will argue that a superior language probably won't work and will then treat the issues by which the proper embedding choice should be *** talk will be followed by a panel discussion about the relationship between APL and LISP.
作者：
Y. T. ChienTheodosios PavlidisGuest Editor
Professor and Head of the Department of Electrical Engineering and Computer Science. Guest Editor
member of the Association for Computing Machinery and Sigma Xi member of the editorial committee of the IEEE TRANSACTIONS OF PATTERN ANALYSIS AND MACHINE INTELLIGENCE Associate Editor of the Bulletin of Mathematical Biology Computer Graphics and Image Processing and Pattern Recognition.
This Special Issue is composed of the papers selected from the 1978 IEEE computer Society Workshop on Pattern Recognition (PR) and Artificial Intelligence (Al) held in Princeton, NJ, April 12-14, 1978. The Workshop wa...
详细信息
This Special Issue is composed of the papers selected from the 1978 IEEE computer Society Workshop on Pattern Recognition (PR) and Artificial Intelligence (Al) held in Princeton, NJ, April 12-14, 1978. The Workshop was sponsored by the Technical Committee on Machine Intelligence and Pattern Analysis. Inevitably, the contributors to the Workshop determined, to a large degree, the tone and complexion of this Special Issue. For this reason, a brief account of the Workshop Proceedings, though now history, is given. About half of the papers presented at the Workshop were also submitted for the Special Issue, a total of 37. Those of high quality were far more than the number that could be accommodated within the available number of pages. We decided to choose three topics where the interaction between the methodologies of PR and Al was most prevelant: analysis of images, analysis of speech, and certain general algorithms. All the selected papers present either theoretical, or experimental results, or both. We felt that such results clearly demonstrate the progress achieved and can be seen as very impressive if measured against the difficult problem of emulating functions associated with human intelligence by machines. It is true that they often fall short from some of the earlier ambitious goals, but the time is probably ripe to reexamine such goals in view of the accumulated experience. The following is a brief scanning of the contents of this issue, especially as related to the integration and/or interaction of PR and Al methodologies.
暂无评论