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

SYSTEMS AND computerS IN JAPAN 1995年第7期26卷 1-12页

作者： FUJIWARA, E TANAKA, T Member Faculty of Engineering Tokyo Institute of Technology Tokyo Japan 152 Eui Fujiwara:received his B.S. and M.S. degrees in Electronics Engineering in 1968 and 1970 respectively and his Dr. of Eng. degree in 1981 all from Tokyo Institute of Technology. In 1970 he joined the NTT Musashino Electrical Communication Laboratories and engaged in developing PIPS-1 and PIPS-11 computer systems. In 1988 he joined the Department of Computer Science Tokyo Institute of Technology as an Associate Professor. In 1990 he became a full Professor. He was a Visiting Professor at the Center for Advanced Computer Studies the University of Southwestern Louisiana from June 1985 to July 1986. His current research interests include coding theory for computers fault-tolerant memories VLSI defect-toleranceand WSI systems. He is a co-author ofError Control Coding for Computer Systems(Prentice-Hall1989) EssentiaLF of Error-Correcting Coding Techniques (Academic Press 1990) and other books. Dr. Fujiwara received the Young Engineer Award from the I.E.I.C.E. in 1978 and the Teshima Memorial Research Award in 1991. He is a senior member of the IEEE and a member of the Information Processing Society Japan. Associate Member

Because of its capability of high-speed search, the associative memory (CAM) is expected to be used in a variety of information processing systems. In this paper, novel fault-tolerant techniques which are effective for on-line use are proposed for TLB which is an example of the application of CAM. First, fault and error models of the TLB consisting of the CAM part and the SRAM part are clarified. Then, the fault-tolerant techniques for these faults and errors, such as distance separable technique, cod-ing technique, simplified 1-out-of-n check and graceful degradation, are proposed. The distance separable technique which encodes the data stored in the CAM part is the one which masks the faulty CAM part and prevents errors from propagating to the subsequent circuits. The coding technique checks the one-to-one correspondence between the data in the CAM and those in SRAM by using the SEC-DED code with byte error detection capability, i.e., SEC-DED-SbED code, and at the same time it detects and corrects errors in the data stored in SRAM. The simplified 1-out-of-n check processes association errors. The graceful degradation gives a flag in the faulty memory section and prevents it from being used. The methods proposed in this paper are evaluated from area augmentation and error detection capability perspectives. The results show that the fault-tolerant TLB with 32 virtual address bits, 32 physical address bits and 128 entries gives single fault detection probability of nearly 99 percent with 28 percent area increase.

关键词： CAM TLB DISTANCE SEPARABLE TECHNIQUE CODING TECHNIQUE SIMPLIFIED 1-OUT-OF-N CHECK GRACEFUL DEGRADATION

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED MEDIA ACCESS PROTOCOL FOR PACKET RADIO NETWORKS AND PERFORMANCE ANALYSIS .2. NETWORK SET-UP TIME AND DATA RATE

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 1995年第1期8卷 49-63页

作者： POND, LC LI, VOK Communication Sciences Electrical Engineering Systems University of Southern California Los Angeles CA 90089-2565 U.S.A. Lawrence C. Pond received the M.Sc. and Ph.D. degrees in electrical engineering from the University of Southern California in 1983 and 1990 respectively. Dr. Pond is currently a scientist at Hughes Space and Communications Company having joined in 1980. He has worked in the fields of communication system design mobile communication network and spacecraft payload design. He is currently working on the development of satellite-based ATM transport and switching architectures for BISDN and Defense Information System Network amlications. Dr. Pond is a member of IEEE. Victor O. K. Li was born in Hong Kong in 1954. He received his SB SM and Sc.D. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology Cambridge Massachusetts in 1977 1979 and 1981 respectively. Since February 1981 he has been with the University of Southern California (USC) LOS Angeles California where he is Professor of Electrical Engineering and Director of the USC Communication Sciences Institute. He has published 150 technical papers and has lectured and consulted extensively around the world. His research interests include high-speed communication networks personal communication networks intelligent networks distributed databases queueing theory graph theory and applied probability. Dr. Li is very active in the Institute of Electrical and Electronic Engineers (IEEE) having been a member of the Computer Communications Technical Committee since 1983 and having served as Chairman from 1987–1989. He served as Chairman of the Los Angeles Chapter of the IEEE Information Theory Group from 1983–1985. He is the Steering Committee Chair of the International Conference on Computer Communications and Networks (IC3 N) General Chair of the 1st Annual IC3N held in San Diego California in June 1992 General Chair and Technical Program Chair of the 4th IEEE Workshop on Comp

In this, the second part of a two-part paper, the required time for establishing a mobile packet radio network using the virtual circuit and time division multiple access protocol developed in Part 1 is analysed. Tools are developed to determine the virtual circuit and network set-up times in terms of the channel bandwidth allocated to establish and maintain the network. The tools are then extended to include the effects of user mobility. Then these results are combined with the network capacity results of Part 1 to analyse the trade-off between the data rate and set-up time of the network. Next a hierarchical architecture is proposed and the network data rate versus set-up time trade-off of this architecture is analysed using these tools. This architecture is shown to both provide a higher data rate and establish faster than flat networks of the same number of nodes.

关键词： PACKET RADIO NETWORK EPLRS DISTRIBUTED NETWORK TDMA VIRTUAL CIRCUITS MULTIHOP NETWORK BOUNDED DELAY MOBILITY NETWORK SET-UP TIME HIERARCHICAL NETWORK NETWORK DATA RATE

来源：评论

学校读者我要写书评

暂无评论

Development and application of MCAL tools for marine radar instruction

引用

computer Applications in engineering Education 1995年第4期3卷 259-259页

作者： Guirguis, S. Korany, E. Abdel-Bary, A. Institute of Graduate Studies and Research Alexandria University Alexandria Egypt Shawkat K. Guirguis:obtained the BSc and M.Sc. degrees in Computer Science and Automatic Control Faculty of Engineering Alexandria University in 1981 and 1984 respectively. In 1988 he obtained a PhD degree in Electronics and Communications Faculty of Engineering Cairo University co-supervised by the Imperial College of Science and Technology University of London where he spent two years as an academic visitor. His current research interests include software quality management multimedia automatic programming and decision support systems. He is currently a lecturer of Computer Science at the Institute of Graduate Studies & Research Alexandria University. Ezzat A. Korany:received the BS degree in Electrical Engineering (Electronics Section) from the University of Alexandria Egypt in 1971 the MS degree in Electrical Engineering (Computer Section) from Ain Shams University Cairo Egypt in 1977 and the PhD degree in Electrical Engineering (Digital Systems) from Florida Institute of Technology U.S.A. in 1982. He is currently an associate professor of Computer Science at the Institute of Graduate Studies & Research University of Alexandria. His research interests are in data communications and multimedia applications computer networks image processing and pattern recognition. Abdel-Latif A. Abdel-Bary:obtained the BEng degree in Electronics Technology from Arab Maritime Transport Academy in 1986. In 1995 he obtained the MSc degree in Information Technology from the Institute of Graduate Studies & Research Alexandria University. His current research interests include ICAL hypermedia and automatic programming.

In this article a multimedia computer-assisted learning (MCAL) system is presented. The major objective of this work was to investigate the potential of using such systems as tools for transferring instructional course information through various types of computer media as opposed to the classic CAL systems. The philosophy and techniques employed to design the system are investigated. Usage of the implemented system and its merits have been illustrated through its application to teach engineering students and technicians the theory and concepts of marine radar. System design, implementation, test, and revision phases are presented and discussed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using an integrated toolset for program understanding 95

Using an integrated toolset for program understanding

引用

Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research

作者： Michael Whitney Morris Bernstein Renato De Mori Kostas Kontogiannis Brain Corrie Hausi Müller Scott Tilley Ettore Merlo John Mylopoulos Kenny Wong J. Howard Johnson James McDaniel Martin Stanley Department of Computer Science University of Victoria P.O. Box 3055 Victoria BC Canada V8W 3P6 School of Computer Science McGill University 3480 University Montréal Québec Canada H3A 2A7 School of Computer Science McGill University 3480 University Street Room 318 Montréal Québec Canada H3A 2A7 Software Engineering Institute Carnegie Mellon University Pittsburgh PA Département de Génie Électrique (DGEGI) École Polytechnique de Montréal C.P. 6079 Succ. Centre Ville Montréal Québec Canada H3C 3A7 Department of Computer Science University of Toronto 6 King's College Road Toronto Ontario Canada M5S 1A4 Institute for Information Technology National Research Council Canada Montreal Road Building M-50 Ottawa Ontario Canada K1A 0R6

This paper demonstrates the use of an integrated toolset for program understanding. By leveraging the unique capabilities of individual tools, and exploiting their power in combination, the resultant toolset is able to facilitate specific reverse engineering tasks that would otherwise be difficult or impossible. This is illustrated by applying the integrated toolset to several typical reverse engineering scenarios, including code localization, data flow analysis, pattern matching, system clustering, and visualization, using a mid-size production program as the reference system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Organizational issues in teaching project-oriented software engineering courses (abstract) 94

Organizational issues in teaching project-oriented software ...

引用

Proceedings of the twenty-fifth SIGCSE symposium on computer science education

作者： Renée A. McCauley Evans J. Adams Donald Gotterbarn Linda M. Northrop Hossein Saiedian Stuart Zweben Department of Computer Science Winthrop University Rock Hill SC Department of Computer Science Fort Lewis College Durango CO Department of Computer and Information Sciences East Tennessee State University Johnson City TN Software Engineering Institute Carnegie Mellon University Pittsburgh PA Department of Computer Science University of Nebraska Omaha NE Department of Computer and Information Science Ohio State University Columbus OH

No abstract available.

ISBN: (纸本)9780897916462

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model-based formal specification directed testing of abstract data types

Model-based formal specification directed testing of abstrac...

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： X. Jia Institute of Software Engineering Department of Computer Science and Information Systems DePaul University De Paul University Chicago IL USA

A model-based formal specification directed software testing approach is presented. It provides a test oracle and introduces a new coverage criterion for the functional (black-box) testing based on formal specifications. Given the source code of an implementation, its formal specification, and the retrieve functions, a test driver can be generated to conduct, evaluate, and measure the functional test. Although the complete specification conformance of an implementation cannot be established by testing alone, our approach provides a strong necessary condition of complete specification conformance.< >

关键词： Formal specifications software testing System testing software systems Concrete software engineering computer science information systems Application software Specification languages

来源：评论

学校读者我要写书评

暂无评论

Solving maximum likelihood equations for two-parameter software reliability models using grouped data 3

Solving maximum likelihood equations for two-parameter softw...

引用

3rd International Symposium on software Reliability engineering, ISSRE 1992

作者： Knafl, George J. Institute for Software Engineering Department of Computer Science and Information Systems DePaul University 243 South Wabash Avenue ChicagoIL60614 United States

Existence conditions are given for maximum likelihood parameter estimates for several commonly employed twoparameter software reliability models. For these models, the maximum likelihood equations can be expressed in terms of a single equation in one unknown. Bounds are given on solutions to these single equation problems to serve as initial intervals for search algorithms like bisection. Uniqueness of the solutions is established in some cases. Results are given for the case of grouped failure data. Index list. Maximum likelihood estimation, nonhomogeous Poisson processes, software reliability models, grouped failure data. © 1992 IEEE.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Solving maximum likelihood equations for two-parameter software reliability models using grouped data

Solving maximum likelihood equations for two-parameter softw...

引用

International Symposium on software Reliability engineering (ISSRE)

作者： G.J. Knafl Institute for Software Engineering Department of Computer Science & Information Systems De Paul University Chicago IL USA

Existence conditions are given for maximum likelihood parameter estimates for several commonly employed two-parameter software reliability models. For these models, the maximum likelihood equations can be expressed in terms of a single equation in one unknown. Bounds are given on solutions to these single equations problems to serve as initial intervals for search algorithms like bisection. Uniqueness of the solutions is established in some cases. Results are given for the case of grouped failure data.< >

关键词： software reliability Maximum likelihood estimation Poisson equations Random variables software engineering computer science information systems Parameter estimation Predictive models Bibliographies

来源：评论

学校读者我要写书评

暂无评论

REDUCTIONS TO SETS OF LOW information-CONTENT 19th

引用

19TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING ( ICALP 92 )

作者： ARVIND, V HAN, Y HEMACHANDRA, L KOBLER, J LOZANO, A MUNDHENK, M OGIWARA, M SCHONING, U SILVESTRI, R THIERAUF, T Department of Computer Science and Engineering Indian Institute of Technology New Delhi 110016 Delhi India Department of Computer Science University of Rochester Rochester 14627 NY United States Abteilung für Theoretische Informatik Universität Uhn Oberer Eselsberg Uhn D-W-7900 Germany Department of Software (L.S.I.) Universitat Politècnica de Catalunya Pau Gargallo 5 Barcelona E-08028 Spain Department of Computer Science and Information Mathematics University of Electro-Commmfications 1-5-1 Chofngaoka Chofu-si Tokyo 182 Japan Dipartimento Di Matematica Unlversits degli Studi di Roma La Sapienza Rome 00198 Italy

ISBN: (纸本)3540557199

In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very flexible reductions that NP cannot have sparse hard sets unless P = NP;an immediate consequence of our results is: If any NP-complete set conjunctively reduces to a sparse set, then P = NP. We also show that any set A that reduces to some sparse set (via various types of reductions) in fact reduces by the same type of reduction to a sparse set that is simple relative to A. We give a complete characterization of the sets of low instance complexity in terms of reductions to tally sets;it follows that if P ≠ NP, then no set of low instance complexity can be complete for NP with respect to disjunctive reductions or conjunctive reductions. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：