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

EXHAUSTIVE DETERMINATION OF BIQUAD CELLS WITH INFINITE-Q BY A PROLOG PROGRAM

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1986年第3-4期41卷 111-120页

作者： MOULY, JC NEIRYNCK, J 1.Dép. Electricité CIRC Ecole Polytechnique Fédérale de Lausanne 16. Chemin de Bellerive CH-1007 Lausanne Suisse

Cet article propose une nouvelle méthode de recherche pour des cellules biquadratiques qui s’appuie sur l’utilisation du langage Prolog qui permet de créer un programme débrouillant le grand nombre de cas possibles. L’article décrit seize cellules optimales extraites d’un ensemble de plus de deux millions de cellules. Ces seize cellules répondent à un ensemble de conditions réalistes mais hétérogènes, qui rendent très difficile l’approche algébrique.

关键词： Synthèse circuit Circuit biquadratique Langage programmation Conception assistée Filtre actif Circuit RC Stabilité circuit Circuit synthesis Biquad circuit programming language Computer aided design Active filter RC circuit Circuit stability

来源：评论

学校读者我要写书评

暂无评论

PARSING languageS BY PATTERN-MATCHING

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1988年第4期14卷 498-511页

作者： RUS, T Department of Computer Science University of Iowa Iowa City IA 52242

The language of universal algebras is used as an alternative approach for programming language specification. BNF rules are employed for specifying the signature of the language algebra instead of the context free syntax. The algorithm for program parsing is inductively defined by the following universal algebraic construction: Any function defined on the generators of a free algebra taking values in the carrier of another similar algebra can be uniquely extended to a homomorphism between the two algebras. Any conventional programming language can be specified by a finite set of BNF rules and its algebra of symbols is generated by a finite set of generator classes. Thus any function defined on the finite set of generators offers an algebraic mechanism for a universal algorithm for source language program parsing. The right-hand side of the BNF rules are the patterns searched by the algorithm in the source text of the program. The essential feature of this algorithm is that it can be used as a driver for code generation and optimization in a translator. This driver recognizes source language constructs in the source text. The code generator evaluates them into the target language regenerating the source language program inductively as a target language program. Therefore this parser is also called a program evaluator. [ABSTRACT FROM AUTHOR]

关键词： algorithm BNF-rule compiler complexity Index Terms-Algebraic model language pattern matching program evaluation program parsing programming language specification mechanism

来源：评论

学校读者我要写书评

暂无评论

A SOFTWARE-DESIGN METHOD AND ITS APPLICATION TO PROTOCOL AND COMMUNICATION SOFTWARE-DEVELOPMENT

COMPUTER NETWORKS AND ISDN SYSTEMS

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1988年第4期15卷 245-267页

作者： SHIRATORI, N TAKAHASHI, K NOGUCHI, S TOHOKU UNIV ELECT COMMUN RES INSTSENDAIMIYAGI 980JAPAN

This paper proposes an approach, called “the Harmonic Design Method”, to achieve an approximately ideal language that simultaneously serves the purposes or requirements of software specification, verification, implementation and so on. This approach is based on two important concepts—partitioning and unification. In the Harmonic Design Method, the collection of the problem-oriented languages and the transformation algorithms between the languages, provided through the process of the partitioning and unification, is regarded as the approximation to the target ideal language. As an application of the Harmonic Design Method, the design of a software support system for making the development of protocols and communication software easy is given. In this design, we provide three problem-oriented languages, viz., the protocol specification language NESDEL, the communication software oriented programming language IDL and the language EXPA which has both a framework for expressing protocols and an algorithm for verifying protocols, and three transformation algorithms between them, i.e., NESDEL-to-EXPA, EXPA-to-NESDEL and NESDEL-to-IDL. The details of these languages and transformation algorithms are also given. Finally, we introduce some software tools used for supporting these languages and transformation algorithms.

关键词： Software Design Method Protocols Communication Software Protocol Verification Protocol Implementation Specification language programming language Computer Networks Support System for Protocol Development

来源：评论

学校读者我要写书评

暂无评论

FROM MODULA TO OBERON

引用

SOFTWARE-PRACTICE & EXPERIENCE 1988年第7期18卷 661-670页

作者： WIRTH, N Institut für Informatik Eidgenössische Technische Hochschule Zürich ETH-Zentrum CH-8092 Zürich Switzerland

AbstractThe programming language Oberon is the result of a concentrated effort to increase the power of Modula‐2 and simultaneously to reduce its complexity. Several features were eliminated, and a few were added in order to increase the expressive power and flexibility of the language. This paper describes and motivates the changes. The language is defined in a concise report

关键词： programming language Modula‐2 Object‐oriented Extended data type Type inclusion Program modularity Extensibility

来源：评论

学校读者我要写书评

暂无评论

A bottom-up approach to verifiable embedded system information flow security

引用

IET INFORMATION SECURITY 2014年第1期8卷 12-17页

作者： Mu, Dejun Hu, Wei Mao, Baolei Ma, Bo Northwestern Polytech Univ Sch Automat Xian 710072 Peoples R China

With the wide deployment of embedded systems and constant increase in their inter-connections, embedded systems tend to be confronted with attacks through security holes that are hard to predict using typical security measures such as access control or data encryption. To eliminate these security holes, embedded security should be accounted for during the design phase from all abstraction levels with effective measures taken to prevent unintended interference between different system components caused by harmful flows of information. This study proposes a bottom-up approach to designing verifiably information flow secure embedded systems. The proposed method enables tight information flow controls by monitoring all flows of information from the level of Boolean gates. It lays a solid foundation to information flow security in the underlying hardware and exposes the ability to prove security properties to all abstraction levels in the entire system stack. With substantial amounts of modifications made to the instruction set architecture, operating system, programming language and input/output architecture, the target system can be designed to be verifiably information flow secure.

关键词： embedded systems formal verification instruction sets operating systems (computers) security of data bottom up approach verifiable embedded system information flow security security holes access control data encryption information flow controls instruction set architecture operating system programming language input-output architecture

来源：评论

学校读者我要写书评

暂无评论

ALGEBRAIC TOOLS FOR language PROCESSING

引用

COMPUTER languageS 1994年第4期20卷 213-238页

作者： RUS, T HALVERSON, T Department of Computer Science The University of Iowa Iowa City IA 52242 U.S.A.

A language space provides a unified framework to deal with the properties of language constructs by associating them with their specification rules. The concrete syntax is represented by segments of the language space. The semantics is given by derived operations of the algebras where these constructs are interpreted by the processing tools operating on the language space. We examine in this paper only processing tools that collect syntactic information over the language space. Tools involved in semantics processing such as translators and interpreters are also integrated in the language space but are not discussed here.

关键词： programming language language CONSTRUCTS language PROCESSING TOOLS PARSING

来源：评论

学校读者我要写书评

暂无评论

A STUDY OF DESIGNING A GRID-ENABLED EXPERT SYSTEM language

引用

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS 2008年第7期31卷 1165-1179页

作者： Wu, Chao-Chin Lai, Lien-Fu Chang, Yu-Shuo Natl Changhua Univ Educ Dept Comp Sci & Informat Engn Changhua 500 Taiwan

Because enriching grid applications is crucial to promote grid computing and grid economy, in this paper we focus on how to attract expert system programmers to run their applications on grid systems. CLIPS is a rule-based language designed to help construct expert systems more easily because it is not required to design all algorithm to solve any problem. Instead, it relies oil the CLIPS inference engine to draw a conclusion from the known facts and rules. However. because Of the language's characteristics. it is very time-consuming to execute a CLIPS application when compared with other algorithmic languages. To address the problem, we propose to execute a CLIPS-based expert system in parallel by emerging cluster and grid systems in this paper. To achieve the goal, CLIPS has to be extended with new syntax to be a parallel version. In addition, we propose to adopt the SPMD computational model for programming to maintain parallel CLIPS applications in an easier way. According to experimental results. it is appealing to run CLIPS-based expert systems in parallel oil Cluster and grid systems by adopting our approach because the performance improvements can be superlinear.

关键词： grid computing parallel computing expert system programming language

来源：评论

学校读者我要写书评

暂无评论

CPL: Failed Venture or Noble Ancestor?

引用

IEEE ANNALS OF THE HISTORY OF COMPUTING 2013年第3期35卷 55-63页

作者： Hartley, David Univ Cambridge Clare Coll Cambridge CB2 1TN England

In a personal account, the author chronicles the joint effort by the University Mathematical Laboratory at Cambridge and the Institute of Computer Science in London to develop the programming language CPL in the early 1960s. Although the project failed to achieve all its aspirations, it did lay important groundwork by establishing some of the basic principles that underlie today's programming languages.

关键词： Cambridge Christopher Strachey Computers CPL Educational institutions Ferranti Atlas High level languages history of computing Institute of Computer Science Laboratories Martin Richards Operating systems programming programming language University Mathematical Laboratory

来源：评论

学校读者我要写书评

暂无评论

Analysis of the programming languages Preferred by Novice Programmers for Solving programming Problem 23

Analysis of the Programming Languages Preferred by Novice Pr...

引用

Proceedings of the 2023 4th Asia Service Sciences and Software Engineering Conference

作者： Md Faizul Ibne Amin Md. Mostafizer Rahman Atsushi Shirafuji Yutaka Watanobe Department of Computer and Information Systems University of Aizu Japan Dhaka University of Engineering and Technology Bangladesh

ISBN: (纸本)9798400708534

In ICT education, most of the courses particularly those focused on programming, are designed to enhance computational and practical skills. However, the selection of appropriate programming languages holds great significance for novice programmers embarking on their journey of learning programming. This paper presents a comprehensive analysis utilizing real-world data to gain insights into the prevalent trends in programming language selection for problem-solving among novice programmers. The study leverages solution submission logs from an online judge (OJ) system, employed as an educational tool within an introductory programming course. The analysis specifically focuses on topic #1 consists of four problems of this course. Our investigation revolves around programmers’ first attempts to solve these problems, taking into account the programming languages they employ. The findings of our detailed statistical analysis shed light on the preferred programming languages used by programmers to tackle these problems. These insights not only aid fledgling novice programmers in making informed decisions when selecting a programming language, but also offer educators, instructors, and academic institutions valuable information for curating programming language choices within introductory programming courses.

关键词： Aizu Online Judge (AOJ). Big data Data Analysis language Selection Online judge programming language programming learning

来源：评论

学校读者我要写书评

暂无评论

Function Definition language FDL andIts Implementation

引用

Journal of Computer Science & Technology 1999年第4期14卷 414-421页

作者：陈海明 Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing P. R. China

A Function Definition language (FDL) is presented. Though de-signed for describing specifications, FDL is also a general-purpose functional pro-gramming language. It uses context-free language as data type, supports patternmatching definition of functions, offers several function definition forms, and is exe-cutable. It is shown that FDL has strong expressiveness, is easy to use and describesalgorithms concisely and naturally. An interpreter of FDL is introduced. Experi-ments and discussion are included.

关键词： programming language recursive function context-free language,interpreter parsing formal specification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：