交通大學機構典藏 類別: 交大學刊;;Science Bulletin National Chiao-Tung University
http://hdl.handle.net/11536/137391
交大學刊;;Science Bulletin National Chiao-Tung University2024-10-03T20:18:51ZFORTRAN中文輸入輸出程式
http://hdl.handle.net/11536/137510
標題: FORTRAN中文輸入輸出程式
作者: 戚樹紅
摘要: 本篇主要介紹的是一個以Fortran 語言來設計中文字根合成中文字的程式，此程式是綜合參考資料(1)、(2)、(3)所得之結果。中文字根是用relative line segment的方法表示的。1974-03-01T00:00:00ZA Study on Measures on Nonmeasurable Subsets
http://hdl.handle.net/11536/137511
標題: A Study on Measures on Nonmeasurable Subsets
作者: 林妙英; Maiow-Ing Lin1974-03-01T00:00:00ZAn On-Line Circuit Design System
http://hdl.handle.net/11536/137513
標題: An On-Line Circuit Design System
作者: 郭南宏; 鍾乾癸; 黃炎松; Nan-Hung Kuo; Chyan Goei Chung; Yen Son Huang
摘要: The purpose of this paper is two folds: (1)To introduce an on-line computer system for circuit analysis and design, which will be set up in Chiao-Tung University (2) To outline the basic method employed by us for developing an entire software system from system design to mask preparation.1974-03-01T00:00:00ZA FORTRAN Program for Calculating the Mean Square Values of the Electron Momenta in N-Electron Atoms He-Kr
http://hdl.handle.net/11536/137512
標題: A FORTRAN Program for Calculating the Mean Square Values of the Electron Momenta in N-Electron Atoms He-Kr
作者: 李維銘; Lee Wei Ming
摘要: The one-electron part of the total mean square values of electron momenta in N-elevtron atoms can be expressed as <Ψ|Σ1 to N P|Ψ>. The total wave function Ψis a linear combination of spin-orbitals ø. Ø is expanded in terms of Slater type orbital (STO) . In this paper, a Fortran program was designed to solve this lengthy calculation.1974-03-01T00:00:00ZSome Fundamental Problems in the Theory of Queues
http://hdl.handle.net/11536/137507
標題: Some Fundamental Problems in the Theory of Queues
作者: 陳華燦; Wah-Chun Chan
摘要: The purpose of this article is an attempt to introduce some fundamental ideas and problems to the young engineers and scientists and to draw their attention to the queuing problems which they may encounter in every day life. It is with the hope that the references may provide a minimum guide for one to get into the field of queuing theory. When the population of a city is getting larger, it is natural to expect that the congestion phenomena in many aspects would become more severe. For the study of various types of queuing problems it is the theory of queues to serve as the most valuable means for such investigations.1974-03-01T00:00:00ZOptimal Singular Control Computation by Epsilon Technique
http://hdl.handle.net/11536/137508
標題: Optimal Singular Control Computation by Epsilon Technique
作者: 李茂全; 唐明月; M.C.Lee; M.Y.Tarng
摘要: This paper extends the ε-technique which was proposed by A.V. Balakrishnan in 1968 to optimal singular control problems and shows that the extended technique can solve the singular control problem in a straight- forward way. A set of necessary conditions for optimality by using ε-technique for singular optimal control problems is derived and a computational algorithm is presented.1974-03-01T00:00:00ZA Self-biased Replacement Algorithm using the Characteristics of Markovean Program Model
http://hdl.handle.net/11536/137506
標題: A Self-biased Replacement Algorithm using the Characteristics of Markovean Program Model
作者: 鄭武皇; 許濬; Wu-Haung Cheng; Jiunn Hsu
摘要: In this paper a self-biased replacement algorithm is developed. The algorithm is mostly suited for allocating system programs and library programs under multiprogramming and/or time-sharing environment. With biasing, the system performance is improved. It is also proved that the algorithm is optimal on macroscopic viewpoint. Since each reference string behaves a static referencing pattern, so it is feasible that the algorithm makes the optimal choice in selecting the candidate for replacement by using the characteristics of Markovean program model. And since in the present time and in the future time , system programs and library programs constitute dorminant part of software system, so it is worthy to develop a replacement algorithm using the characteristics of Markovean program model, although pre-runnings of programs are required.1974-03-01T00:00:00ZStability of Nonlinear Systems with Characteristic Equations Having Complex Coefficients
http://hdl.handle.net/11536/137509
標題: Stability of Nonlinear Systems with Characteristic Equations Having Complex Coefficients
作者: 蔡義從; 韓光渭; Y.T.Tsay; K.W.Han
摘要: Stability criteria for nonlinear systems with linearized characteristic equations having complex coefficients are presented. The presented criteria are more general and the proofs are more complete than that in the current literature.1974-03-01T00:00:00ZOn the Modeling of Paging Algorithm by Finite Automata
http://hdl.handle.net/11536/137505
標題: On the Modeling of Paging Algorithm by Finite Automata
作者: 楊超植; C.C.Yang
摘要: Two finite automata are devised for modeling two classes of demand paging algorithms. The first one of one input and three outputs models the class of algorithms each with a constant amount of allocated space. The second one of one input and six outputs models the class of algorithms each with a variable amount of allocated space. Some evaluation techniques are developed following each model. The memory states of the first class algorithm with the LRU, FIFO or FILO replacement policy or of the second class algorithm like the working set model or the page-turning rate algorithm are recursively defined by strings of the loaded pages. The adopted replacement policy and the state string updating procedure are imbedded in the recursive definition of a memory state. The operations like loading, tagging,reutilizing, etc. are reflected and differentiated by different outputs. Properties of some algorithms are developed. Sime such properties confirm with previous results and some others are updated to fit the finiteness assumtion of a reference string.1974-03-01T00:00:00ZMinimum Test Sets for Fan-Out Free Networks and Two-Level Networks
http://hdl.handle.net/11536/137501
標題: Minimum Test Sets for Fan-Out Free Networks and Two-Level Networks
作者: 李新滿; Shin-Maan Lee; Charles A. Harlow
摘要: Algorithms are preaented for generating minimum multiple-fault detection test lets for fan-out free networks and nonredundant two-level networks. A test set is minimum in the sense that there is no set with a smaller number of test patterns that detects all the faults in the network.1974-03-01T00:00:00Z