作者：
高鸿勋Nankai University
Tianjinhis paper presents two algorithms for shift register M-sequences. The first follows the reasoning by mathematical induction and turns into the tabular form instead of graphical ones. The essentials are tabulation simplification and being axiomatized. The second follows the method of "cut-join" by an arithmetical means instead of graphical one which is available for a computer. Two remarks seem useful for programming. In the third part some comparisons and statements of the algorithms are given.
This paper presents two algorithms for shift register M-sequences. The first follows the reasoning by mathematical induction, and turns into the tabular form instead of graphical ones. The essentials are tabulation, s...
详细信息
This paper presents two algorithms for shift register M-sequences. The first follows the reasoning by mathematical induction, and turns into the tabular form instead of graphical ones. The essentials are tabulation, simplification and being axiomatized. The second follows the method of 'cut-join' by an arithmetical means instead of graphical one, which is available for a computer. Two remarks seem useful for programming. In the third part some comparisons and statements of the algorithms are given.
作者：
LENAT, DBComputer Science Department
Stanford University Stanford CA 94305 U.S.A.[∗]The author is an assistant professor of Computer Science at Stanford University a member of that university"s Heuristic Programming Project and a consultant for CIS at XEROX PARC.
Builders of expert rule-based systems attribute the impressive performance of their programs to the corpus of knowledge they embody: a large network of facts to provide breadth of scope, and a large array of informal ...
Builders of expert rule-based systems attribute the impressive performance of their programs to the corpus of knowledge they embody: a large network of facts to provide breadth of scope, and a large array of informal judgmental rules (heuristics) which guide the system toward plausible paths to follow and away from implausible ones. Yet what is the nature of heuristics? What is the source of their power? How do they originate and evolve? By examining two case studies, the am and eurisko programs, we are led to some tentative hypotheses: Heuristics are compiled hindsight, and draw their power from the various kinds of regularity and continuity in the world; they arise through specialization, generalization, and—surprisingly often—analogy. Forty years ago, Polya introduced Heuretics as a separable field worthy of study. Today, we are finally able to carry out the kind of computation-intensive experiments which make such study possible.
This paper sets some context, raises issues, and provides our initial thinking on the characteristics of effective rapid prototyping techniques. After discussing the role rapid prototyping techniques can play in the s...
详细信息
ISBN:
(纸本)089791094X
This paper sets some context, raises issues, and provides our initial thinking on the characteristics of effective rapid prototyping techniques. After discussing the role rapid prototyping techniques can play in the software lifecycle, the paper looks at possible technical approaches including: heavily parameterized models, reusable software, rapid prototyping languages, prefabrication techniques for system generation, and reconfigurable test harnesses. The paper concludes that a multi-faceted approach to rapid prototyping techniques is needed if we are to address a broad range of applications successfully - no single technical approach suffices for all potentially desirable applications.
This paper will be a joint presentation on an issue for both Academic Computing Support (ACS, the user services group at Clemson) and the Division of Administrative programming Services (DAPS, the administrative data ...
详细信息
Abstract We describe a program for verifying that a set of rules in an expert system eomprehensively spans the knowledge of a specialized domain. The program has been devised and tested within the context of the ONCOC...
Abstract We describe a program for verifying that a set of rules in an expert system eomprehensively spans the knowledge of a specialized domain. The program has been devised and tested within the context of the ONCOCIN System, a rule-based consultant for clinical oncology The stylized format of ONCOCIN's rules has allowed the automatic detection of a number of common errors as the knowledge base has been developed This capability suggests a general mechanism for correcting many problems with knowledge base completeness and consistency before they can cause performance errors
Summary Eurisko is an AI program that learns by discovery We are applying Eurisko to the task of inventing new kinds of three-dimensional microelectronic devices that can then be fabricated using recently developed la...
Summary Eurisko is an AI program that learns by discovery We are applying Eurisko to the task of inventing new kinds of three-dimensional microelectronic devices that can then be fabricated using recently developed laser recrystallization techniques Three experiments have been conducted, and some novel designs and design rules have emerged.
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 NBS Data Encryption Standard may be integrated into computer networks to protect personal (nonshared) files, to communicate securely both on- and off-line with local and remote users, to protect against key substi...
详细信息
The NBS Data Encryption Standard may be integrated into computer networks to protect personal (nonshared) files, to communicate securely both on- and off-line with local and remote users, to protect against key substitution, to authenticate system users, to authenticate data, and to provide digital signatures using a nonpublic key encryption algorithm. Key notarization facilities give users the capability of exercising a set of commands for key management as well as for data encryption functions. The facilities perform notarization which, upon encryption, seals a key or password with the identities of the transmitter and intended receiver. Thus, in order to decrypt a message, the receiver must authenticate himself and supply the correct identity of the transmitter. This feature eliminates the threat of key substitution which must be protected against to attain a high level of security.
暂无评论