Browsing by Author "YANG, C"

Now showing 1 - 6 of 6

COMPUTER OPERATING-SYSTEMS IN ELECTRICAL-ENGINEERING CURRICULUM
(1993-02-01)
YANG, C
;
交大名義發表
;
管理學院
;
National Chiao Tung University
;
College of Management
Diversified in their background knowledge, electrical engineering students cover a wide spectrum of strengths and weaknesses when they first attempt to study the subject of operating systems. Commonly, students are initially more concerned with the hardware design of digital systems and, therefore, less appreciative of the principles of software systems. In light of this, this paper presents and examines a practical syllabus for a course on operating systems. It also discusses possible derivations from this syllabus so as to provide versatility in implementation.
EXPERT-SYSTEMS FOR SEA MINE WARFARE
(1994-10-01)
LU, HC
;
MON, DL
;
YANG, C
;
管理科學系
;
Department of Management Science
In this paper, the probabilistic inference network (PIN) in a decision support systems environment is used to deal with several uncertain questions. The PM method is supported by the certainty factors. Calculations involving quantitative probabilities for answering concerned questions enable mine countermeasure (MCM) experts to offer suggestions:to a commander for reducing the ship's vulnerability at sea during wartime. For sea mine warfare scenarios, based on an analysis, we have a degree of confidence of 0.6568 to suggest the commander to deploy MCM forces.
LINEAR DEPENDENCY CHECK IN BUILT-IN TEST
(1993-04-01)
YANG, C
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
Given a characteristic polynomial p(x) and a sampling polynomial with respect to p(x), a designer likes to know whether the sampling polynomial is a dependency polynomial. A dependency polynomial gives low fault coverage in the built-in self test. The tool LDC computes the residue combinations of the factors in the set polynomial and advises designers if the sampling polynomial covers all the testing space. When the sampling polynomial is a dependency polynomial, LDC will try to find one, if any, independent polynomial at a minimum cost. In cases of short test vectors LDC can exhaustively enumerate all independent polynomials for the designers to choose from. This paper reviews the basics of the linear dependency computation, explains the LDC capabilities and its usefulness, and discusses the computational issues of the problem.
LINK ENHANCEMENT USING CONSTRAINED RANGE AND REDUCED CANDIDATE SET SEARCHES
(1992-11-01)
YANG, C
;
管理科學系
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Management Science
;
Department of Information Management and Finance
A communication network's survivability and routability are primarily based on the degree of interconnection between the existing nodes of the network Enhancement of these characteristics can be obtained by adding direct communication links between nodes of the network. This process is generally subject to a budget constraint We show that the link enhancement problem, for a given investment, is NP-complete. Explanation of the proposed heuristic, for near-optimal solution, is presented with several examples. Improvements on previous work using constrained range and reduced candidate set searches are introduced and clarified A review of pertinent previous work, problem formulation, algorithm presentation, and discussion of computational issues are also provided.
MANAGING SECURE COMMUNICATIONS WITH MULTILEVEL SECURITY AND RESTRICTED CHARACTER SET TRANSLATION
(1993-06-01)
YANG, C
;
TSAI, CC
;
管理科學系
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Management Science
Naval message traffic is transmitted with restricted character set, the files of which are optionally compressed. Often in this type of transmission, both character set translation and data compression can be used as add-on data encryption. In supporting the multilevel security management of access control in communication, this paper presents a possible implementation of master keys. The underlying basis of this key management scheme allows a set of keys to be maintained in either a floating or connected fashion, thus making the system tolerant to expansion. In doing this, it is discovered that a direct implementation for master keys is not possible as modulo arithmetic is required whereby only the arithmetic operations of addition and multiplication follow the commutative property-not division, where the results of modulo division are irreversible. As a solution to this problem, a recursive procedure of modulo exponentiation is employed via software which utilizes indexes. Along with this research, an algorithm has been implemented with restricted character set translation scheme and incorporated into a data compression program for military applications. The restricted character set translation algorithms investigated for the U.S. Navy are discussed in this paper. The application of character set translation will defer hardware changes, and the software implementation alleviates the need for expensive hardware.
MULTIGAUGE COMPUTERS AND THEIR APPLICATIONS
(1993-01-01)
YANG, C
;
管理科學系
;
Department of Management Science
A multigauge computer can have its data path split into independent data paths which execute operations on 'small' data concurrently. In this paper we explain how certain forms of multigauge processing can be implemented with little cost in hardware; we illustrate this 'low cost' implementation by describing the multigauging of the Quarter Horse microprocessor. and report on two practical applications from graphics for which 95% of the theoretically possible speedup is achieved. The measurements are based on the simulation of compiled code of the graphic applications. When instruction time is considered, the improvement is even more substantial: the super-linear is possible. We conclude that because multigauging can be used with other architectural structures, it is an effective way of exploiting parallelism.