检索结果-内蒙古大学图书馆

Coating mass control on No. 2 galvanizing line at LTV Steel's Indiana Harbor works

Iron and Steel Engineer 1996年第1期73卷 22-22页

作者： Adams, J. Miles, L. Bohney Parker, D.J. Conway, G. Wallace, G. Computer Systems Technology Center Independence OH United States Indiana Harbor Works LTV Steel Co. Inc. East Chicago IN United States Software Engineering Special Projects Indust. Automat. Services Pty. Ltd. Toronto NSW Australia

A high-performance coating mass control system was designed using an analytical first principles model and advanced control methods. This computer control system was installed and successfully commissioned in March 1994 on the No. 2 continuous galvanizing line at LTV Steel's Indiana Harbor works. Commissioning was fast and smooth due to the use of a process simulator, task partitioning for parallel subsystem development, good project management methods and close cooperation of the three participating companies. Significant improvements were achieved for coating mass uniformity, reduced skew coating footage, reduced order change footage, reduced rejects for coating reasons and reduced zinc usage. This control system and the line upgrade projects that preceded it have made the No. 2 continuous galvanizing line a state of the art hot dip facility for producing the highest quality galvannealed and galvanized products that meet the needs of the most demanding customers and applications. Current work is focused on enhancing product performance, achieving additional zinc savings, and development of new products made possible by improved coating uniformity and tighter coating control. Additional projects in progress for this line include upgrading the air supply system, the knife positioning and measuring systems, and running trials for new products. Upgrading programs for LTV's other coating lines are following the example set by the No. 2 CGL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing the NASA technical report server

引用

INTERNET RESEARCH-ELECTRONIC NETWORKING APPLICATIONS AND POLICY 1996年第1期6卷 64-&页

作者： Nelson, ML Maa, MH Michael L. Nelson is the “webmaster” for NASA Langley Research Center Computer Systems Branch Mail Stop 157A 15 Langley Boulevard Hampton VA 23681‐0001 USA. Tel: 804 8648511 Fax: 804 8648342 E‐mail: <m.l.nelson@larc.nasa.gov> . He has also worked with others to implement report servers software servers technology transfer databases and other World Wide Web services and is also the technical lead for NASA Langley Research Center’s workstation clustering activities. Ming‐Hokng Maa is a NASA Langley Research Center Cooperative Education Student e‐mail: <m.h.maa@larc.nasa.gov> pursuing his BS in computer engineering/computer science at the Massachusetts Institute of Technology. He has previously held research positions at nView Corp. and the Inter‐National Research Institute Inc Ming‐Hokng Maa is a NASA Langley Research Center Cooperative Education Student e‐mail: <m.h.maa@larc.nasa.gov> pursuing his BS in computer engineering/computer science at the Massachusetts Institute of Technology. He has previously held research positions at nView Corp. and the Inter‐National Research Institute Inc

Explains how the NASA Technical Report Server, a World Wide Web report distribution NASA technical publications service, has been modified for performance enhancement, greater protocol support and human interface optimization. Results include: parallel database queries, significantly decreasing user access times by an average factor of 2.3;access from clients behind firewalls and/or proxies which truncate excessively long Uniform Resource Locators;access to non-Wide Area Information Server (WAIS) databases and compatibility with the Z39-50.3 protocol;and a streamlined user interface.

关键词： distribution information retrieval information services Internet

来源：评论

学校读者我要写书评

暂无评论

A method for understanding intentions of indirect speech acts in natural language interfaces

引用

systems AND COMPUTERS IN JAPAN 1996年第1期27卷 77-91页

作者： Mima, H Aoe, J Fuketa, M Hayashi, Y Member Faculty of Engineering The University of Tokushima Tokushima Japan 770 Jun-ichi Aoe received his B.E. and M.E. degrees in Electronic Engineering from the University of Tokushima Tokushima Japan in 1974 and 1976 respectively and his Ph.D. degree in Communication Engineering from the University of Osaka Japan in 1980. Since 1976 he has been with the University of Tokushima. He is currently a Professor in the Department of Information Science and Intelligent Systems at the University of Tokushima. He is the author of about 50 scientific papers. His research interests include computer algorithms in software engineering and natural language processing. Dr. Aoe is editing Computer Algorithms Series of the IEEE Computer Society Press and author of two books: Computer Algorithms-Key Search Strategies in 1991 and String Pattern Matching Strategies in 1994. He received a Best Author Award from the Information Processing Society of Japan in 1993. He is a member of the Association for Computing Machinery the American Association for Artificial Intelligence the Association for Computational Linguistics and the Information Processing Society of Japan the Society for Software Science and Technology the Japanese Society for Artificial Intelligence and the Association for Natural Language Processing of Japan. Nonmember

In an attempt to propose a robust method for understanding natural language (NL) interface commands, a scheme is proposed that infers intentions from an indirect speech-act that does not express users' real intentions explicitly. This method classifies the real intentions of the indirect speech-act into: 1) refusal;2) reversal;3) restriction;4) benefit;and 5) disability. Further, concepts are abstracted for operations, e.g., displaying, moving, and deleting information systems;and constructing the operation knowledge base. This knowledge based comprises operational concepts and the relationships between them. These relationships are assigned the foregoing classifications for intentions. In addition, we construct the knowledge base of objects for the target of operations, e.g., files, figures, strings. This knowledge base contains the relationships: a) antonym;b) exclusive;c) part-of, between the objects;and uses these relations to infer the transitions between the objects. An algorithm is the proposed to infer concepts for operations and concepts for target objects of operations that may represent the user's actual intentions. This proposal scheme was tested with requests on UNIX and a commercially available Japanese Word Processor. The system successfully inferred the intentions for approximately 80 percent of the user's indirect speech-act.

关键词： natural language interface indirect speech act inference of intention

来源：评论

学校读者我要写书评

暂无评论

A high-speed high-density array-multiplier-accumulator for digital signal processing

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS 1996年第2期79卷 86-97页

作者： Minami, T Kasai, R Matsuda, H Kusaba, R Member NTT LSI Laboratories Atsugi Japan 243-01 Graduated in 1980 from the Department of Electrical Engineering Kyushu University where he received his Master's degree in 1982 and joined NTT. Until March 1986 he was engaged in the development of application software for electronic switching systems. He then engaged in research and development of LSIs for image signal processing. At present he is Senior Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of IEEE. Graduated in 1972 from the Department of Electrical Engineering Osaka University where he received his Master's degree in 1974 and his Ph.D. in 1992. He joined NTT in 1974. He is engaged in research and development of analysis of MOS devices and design of ASIC for communication. At present he is Executive Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of IEEE. Graduated in 1987 from the Department of Communications Tohoku University where he received his Master's degree in 1989 and joined NTT. He is engaged in research and development of high-speed design for image processing LSIs. At present he is Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of the Information Processing Society. Graduated in 1985 from the Department of Electrical Engineering Keio University where he received his Master's degree in 1987 and joined NTT. He is engaged in CAD research. At present he is Senior Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of the Information Processing Society and IEEE.

This paper discusses the downsizing and speed improvement of short-word multiplier-accumulators, which are frequently used in digital signal processors. As a first step, the optimal configuration for an array-type carry-save adder is considered where the shortest path in the full-adder is used to propagate the sum signal and the carry signal is sent to the full-adder of the two lower stages by skipping a stage. A configuration of the full-adder suitable for the structure is proposed. The case of eight partial product additions shows that the delay can be reduced by 22 percent compared to a simple array-type carry-save adder. Then the short-word carry look-ahead adder using the pass-transistor logic is considered. It is shown that a single-stage carry look-ahead circuit with a four-bitwise iterative structure exhibits nearly the same delay as a two-stage carry look-ahead circuit. In other words, the former is better suited to downsizing. This paper intends to examine the effectiveness of the foregoing new array-type carry-save adder and the single-stage carry look-ahead circuit using the 0.5-mu m CMOS technology. A 16-bit x 14-bit + 31-bit multiplier-accumulator has been designed and is evaluated for cases where the array-type carry-save adder is used to handle accumulation as well as partial products. The resulting area and delay are 0.77 x 0.78 mm(2) and 6.8 ns, respectively. The effectiveness of the approach used in this paper is evaluated by constructing a multiplier-accumulator, but the method is also useful in constructing a multiplier.

关键词： product-sum operation array multiplier carry-save adder full-adder carry look-ahead adder

来源：评论

学校读者我要写书评

暂无评论

A step-down frequency-modulated zero-current switching quasi-resonant converter-fed DC drive

引用

EUROPEAN TRANSACTIONS ON ELECTRICAL POWER 1996年第1期6卷 61-66页

作者： Reddy, SR Lakshmikanth, A Raj, VB Chellamuthu, C Salhi Rama Reddy (1963) received AMIE in Electrical Engineering from the institution of Engineers (India) in 1984. He received M.E. degree from Anna University Madrid India in 1986. He worked at Tab Consulting Engineers Bangalodndia from 1987 to 1989 when he was appointed as Assistant Engineer. Subsequently he worked as a lecturer at Madras University from 1990 to 1992. Presently he is working as a lecturer in the Power Systems Division College of Engineering Madras. His current research activities are. in the area of power electronics and microprocessor control of electrical drives. (College of Engineering Madras - 600025 India T +9144/2351723-3352 Fax + 009144/2350397) Ananta Lakshmikanth (1970) received the B.E. in Electrical Engineering from the College of Engineering Anna University Maddndia. in 199 I. Presently he is a post graduate scholar at Power Electronics division Anna University. His fields of interest are electrical drives design and sirnulation of power electronic circuits. (Power Electronics Division Anna University Madras 600 025 India T +9144/235 17233349 Fax +9144/2350397) Vasu Babu Raj (1969) received the B.E. in Electrical Engineering from the Regional Engineering College Trichy/ India in 1991. He received the M.E. degree from Anna University Madras/ India in 1993. Since January 1994 he is working as a Software Engineer at Tata Consultancy Services (TCS) New Delhflndia. (TCS Gulab Bhawan 6 Bahadur Shah Zabar Marg New Delhi-110002 T+91 11/3318402) Chinasamy Chellamuthu (1942) received B.E. degree in Electrical Engineering and M.Sc (Engng.) in Power Systems from Madras University and Ph.D. degree in Power Electronics from Indian Institute of Technology Madradndia in 1965. 1967 and 1982 respectively. He worked as a faculty member of Govt. College of Technology Coimbatore. from 1967 to 1977. Presently he is working as Professor of Power Electronics at Anna University Madras. His fields of interest include simulation of power-semiconductor controlled drives an

The simulation and implementation of a step-down frequency-modulated zero-current switching quasi-resonant converter (FM-ZCS-QRC) fed DC drive are presented. A parallel resonant QRC is used for the speed control of a DC motor. The FM-ZCS-QRC-fed DC drive is modelled and simulated. A microprocessor-based prototype system is also implemented for controlling the drive speed and the results predicted by simulation are verified experimentally. It is found that the FM-ZCS-QRC-fed DC drive has several advantages over those fed from phase-controlled converters, DC choppers and PWM converters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Experiences in object-oriented programming

Experiences in object-oriented programming

引用

International Conference on TRI-Ada 1995: Ada's Role in Global Markets: Solutions for a Changing Complex World, TRI-Ada 1995

作者： Barbey, Stéphane Balfour, Brad Beckwith, Bill Weller, David Switzerland CACI Switzerland Objective Interface Systems Switzerland Hughes Training Inc. Switzerland Swiss Federal Institute of Technology Software Engineering Laboratory Lausanne Ecublens1015 Switzerland

来源：评论

学校读者我要写书评

暂无评论

Knowledge acquisition and integration on specification change-a method for systematic reuse

Knowledge acquisition and integration on specification chang...

引用

Asia-Pacific Conference on software engineering

作者： S. Matsuura S. Honiden Lab. for New Software Archit. Inf.-technology Promotion Agency Tokyo Japan Systems and Software Engineering Laboratory Toshiba Corporation Kawasaki Kanagawa Japan

Our research goal is to construct an environment that mechanically supports human intellectual activities through software development with reuse. We propose a model of software development with systematic reuse in which the existing program can be altered to meet the given specification change using the program derivation process from the specification. We consider what kinds of knowledge must be acquired when a specification is changed and how they have to be integrated so well as to implement our method on a computer system. In particular, we focus on the following points in terms of program synthesis. First, a wide spectrum language, Extended IML, defines a framework in which specifications, program and the elaborate derivation process can be expressed formally on a computer system. This forms a basic unit of reusable knowledge for specification change. Second, a reuse process is formulated in which a new requirement changes the efficient specification and its program is altered to meet this requirement correctly. Third, we consider some conditions and a mechanism by which the knowledge can be integrated so as to obtain an objective program automatically, implying that we will yet profit from reusing the knowledge.

关键词： Knowledge acquisition Programming Humans software architecture software engineering Laboratories Artificial intelligence Problem-solving Knowledge representation Formal specifications

来源：评论

学校读者我要写书评

暂无评论

Runtime support for data parallel tasks

Runtime support for data parallel tasks

引用

Frontiers of Massively Parallel Computation

作者： M. Haines B. Hess P. Mehrotra J. Van Rosendale H. Zima Institute for Computer Applications in Science and Engineering NASA-Langley Research Center Hampton VA USA Institute for Software Technology and Parallel Systems University of Technology Vienna Vienna Austria

We have recently introduced Opus, a set of Fortran language extensions that provide shared data abstractions (SDAs) as a mechanism for communication and synchronization among coarse-grain data parallel tasks. In this paper, we discuss the design and implementation issues of the runtime system necessary to support SDAs, and outline the underlying requirements for such a runtime system. We explore the feasibility of this approach by implementing a prototype of the runtime system. We give preliminary results of the prototype on the Intel Paragon, outline the current status of the project, and discuss future plans.< >

关键词： Runtime Aircraft propulsion NASA Prototypes Data structures Parallel languages Parallel processing Design optimization Aerospace control Computer applications

来源：评论

学校读者我要写书评

暂无评论

PARALLEL DATABASE ALGORITHMS FOR SOLVING PLANNING PROBLEMS ON VERY LARGE DATABASES

引用

systems AND COMPUTERS IN JAPAN 1995年第11期26卷 12-25页

作者： OHMORI, T MATSUMOTO, Y Member Faculty of Engineering Kyoto University Kyoto Japan 606 Nonmember Koukichi Matsumoto:received his B.E. and Ph.D. degrees in 1954 and 1974 respectively from the University of Tokyo. He joined Toshiba in 1954. He became a Director at Toshiba in 1985 and a Professor at Kyoto University in 1989. He has been engaged in development of control systems for engineeringcomputers development of software productivity technology research in software development support environment etc. He received awards from Japan Electric Industry Society Invention Society Science and Technology Agency etc. He is the author ofsoftware Engineering and 12 other books. He is a lifetime member of Denki Gakkai IEEE Fellow and a member of Japan Society for Software Science and Technology and the Information Processing Society of Japan.

This paper discusses cooperative distributed planning problems using multiple agents that share a very large database. It is an important framework for planning by multiple agents with incomplete information, and for evaluating behavior strategies and negotiation manners. The specific issue involves distributed constraint-satisfying problems on databases. The problem is described as concurrent execution and repetitive execution of transactions, where each agent is deemed as a transaction that operates on a very large database. Therefore, we propose a highly efficient parallel database processing algorithm for these two basic operations.

关键词： PARALLEL DATABASE PROCESSING CONSTRAINT-SATISFYING PROBLEM COOPERATIVE DISTRIBUTED PROCESSING

来源：评论

学校读者我要写书评

暂无评论

ON A METHOD OF CRYPTANALYSIS FOR CRYPTOSYSTEM WITH INVOLUTION

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 1995年第5期78卷 1-11页

作者： TSUNOO, Y OKAMOTO, E UEMATSU, T Member NEC Software Hokuriku Ltd. Ishikawa Japan 920-21 School of Information Science Japan Advanced Institute of Science and Technology Ishikawa Japan 923-12 Members Tomohiko Uyematsu graduated in Electrical Engineering from Tokyo Institute of Technology in 1982 and received a Master's degree from the same university in 1984 after whichhe became an assistant in the Electrical and Electronics Engineering Department there. In1990 he became a Lecturer and in 1991 an Assistant Professor. In 1992 he became Assistant Professor at the School of Information Science Japan Advanced Institute of Science and Technology. He holds a doctorate in engineering. Among his research interests are signal theory optical communications theory coding theory and data compression algorithms. In 1988 he received a Shinohara Commemorative Science Encouragement Prize and in 1992 a Best Paper Award. He is the author of the bookIntroduction to Record Data Compression Algorithms. He is a member of the Measurement Control Society and the Society for Information Theory and Its Applications.

Cryptology provides the technological basis for guaranteed network security. In the field of business, to guarantee the security of information, everyone needs easy-to-use cryptology. Starting with the announcement by the U.S. National Bureau of Standards of the DES cryptosystem and the proposal by NTT of the FEAL cryptosystem, secret-key cryptographic algorithms have been published, involution-type block cryptosystems which use secret key to encipher 64 bits of plain text as 64 bits of cipher text [2, 3, 9, 10, 12]. NTT has proposed the one-way function MAP, which is also an involution-type transform. In this paper, we study a new cryptanalytic method for involution-type cryptosystems and show by example that it can be applied practically in a ciphertext-only attack on the one-way function MAP. For an involution-type cryptosystem, by increasing the amount of construction in the data-randomization phase and by increasing the size of the secret key, we can guarantee the computational security by preventing the estimation of the secret key. However, if we study the properties of the function used in the design of the data-randomization phase, by specifying input/output values of the function which are independent of the secret key, it may be possible to use the inverse function [11] to calculate the secret key. This method is called the intermediate cipher method. The intermediate cipher method differs from previous methods in the small quantity of data required for breaking.

关键词： INVOLUTION BLOCK CIPHER INTERMEDIATE CIPHER CIPHERTEXT-ONLY ATTACKS

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：