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

4TH INTERNATIONAL SYMP ON programming LANGUAGE IMPLEMENTATION AND LOGIC programming ( PLILP 92 )

作者： NILSSON, H FRITZSON, P Programming Environments Laboratory Department of Computer and Information Science Linköping University Linköping S-581 83 Sweden

ISBN: (纸本)3540558446

Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side effects. Traditional debugging techniques are, however, not suited for lazy functional languages since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. In this paper we present an algorithmic debugger for a lazy functional language and some experience in using it. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

HOW WELL ARE NON-HORN CLAUSES HANDLED 6th

HOW WELL ARE NON-HORN CLAUSES HANDLED

引用

6TH INTERNATIONAL SYMP ON METHODOLOGIES FOR INTELLIGENT SYSTEMS ( ISMIS 91 )

作者： NIE, XM Institute for Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States

ISBN: (纸本)3540545638

We analyze the search space of two clause-based proof procedures, the Model Elimination procedure and Near-Horn Prolog, both of Loveland. We study how the search space changes with respect to the degree of how “non-Horn” a clause set is. The “non-Hornness” of a clause set is measured by the average number of negative subgoals in a clause. We show that Near-Horn Prolog performs better at the very beginning of the “non-Hornness” scale. But when the clause set becomes more and more non-Horn, model elimination has a clear advantage over Near-Horn Prolog. We also observe an interesting symmetrical property of the search space of model elimination. The reason for this symmetry is that model elimination treats positive literals and negative literals in the same way. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Complexity of unification problems with associative-commutative operators

引用

Journal of Automated Reasoning 1992年第2期9卷 261-288页

作者： Kapur, Deepak Narendran, Paliath Institute of Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States

The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of determining whether two such terms are unifiable was known to be NP-hard. It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorithm for it. The case where the terms are linear and have no common variables is shown to be in P. The NP-completeness of other similar unification problems, in particular, when a function symbol is also idempotent and/or has a unit (identity), is also discussed. Finally, a table of the complexity of E-matching and E-unification problems is given. © 1992 Kluwer Academic Publishers.

关键词： associative commutative complexity equational theories idempotent identity matching NP-complete set matching Unification unit word equations

来源：评论

学校读者我要写书评

暂无评论

Formal specification of virtual process topologies 1

Formal specification of virtual process topologies

引用

1st IEEE computer Society International Workshop on Cluster Computing, IWCC 1999

作者： Kazemi, K. McDonald, C. Programming Languages and Systems Group Department of Computer Science University of Western Australia NedlandsWA6907 Australia

ISBN: (纸本)0769503438

A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for interprocess communication, relieving the application developer of the cumbersome task of mapping logical neighbours to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server which then is used in the generation of the topological specification. © 1999 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Automated Reasoning with Analytic Tableaux and Related Methods 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Neil V. Murray

来源：评论

学校读者我要写书评

暂无评论

Alternatives to construct-based programming misconceptions 86

Alternatives to construct-based programming misconceptions

引用

1986 SIGCHI Conference on Human Factors in Computing Systems, CHI 1986

作者： Spohrer, James C. Soloway, Elliot Department of Computer Science Cognition and Programming Project Yale University New HavenCT06520 United States

ISBN: (纸本)0897911806

In this paper, we investigate whether or not most novice programming bugs arise because students have misconceptions about the semantics of particular language constructs. Three high frequency bugs are examined in detail - one that clearly arises from a construct-based misconception, one that does not, and one that is less cut and dry. Based on our empirical study of 101 bug types from three programming problems, we will argue that most bugs are not due to misconceptions about the semantics of language constructs. © 1986 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Boolean differential calculus

Boolean differential calculus

引用

作者： Steinbach, Bernd Posthoff, Christian Department of Computer Science Software Engineering and Programming Freiberg University of Mining and Technology Germany

ISBN: (纸本)9781608451821

Boolean Differential Calculus (BDC) extends Boolean *** Boolean algebra is focused on values of logic functions,BDC allows the evaluation of changes of the function values. Such changes can be investigated between certain pairs of function values as well as regarding whole subspaces. Due to the same basic data structures, BDC can be applied to any task described by logic functions and equations together with the Boolean *** used is BDC in analysis, synthesis, and testing of digital circuits. In this chapter, we introduce basic definitions of BDC together with some typical applications.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Comparative Study for Classification Methods to Predict and Detect Epilepsy Seizure 5

Comparative Study for Classification Methods to Predict and ...

引用

5th IEEE Middle East and Africa Conference on Biomedical Engineering, MECBME 2020

作者： El Halabi, Nashaat Abi Zeid Daou, Roy Achkar, Roger Hayek, Ali Boercsoek, Josef American University of Science and Technology Department of Computer and Communications Engineering Faculty of Engineering Beirut Lebanon Faculty of Public Health Biomedical Technologies Department Jounieh Lebanon American University of Science and Technology Department of Computer and Communications Engineering Faculty of Engineering Beirut Lebanon Computer Science University of Kassel Department of Computer Architecture and System Programming Faculty of Electrical Engineering Germany Computer Science University of Kassel Department of Computer Architecture and System Programming Faculty of Electrical Engineering Germany

ISBN: (纸本)9781728123585

Epilepsy is a medical problem that tackles lots of patients. It limits the life activity of such patients due to the seizures that occur anytime and anywhere. Thus, creating a monitoring system that could make their life easier and allow them to perform daily life activities as safe as possible has been studied. This paper is a continuity for a project where a system monitors epileptic patients using a set of wearable sensors connected to several processing units, the main sensors are Electroencephalogram (EEG) for the electrical activity of the brain, electrocardiogram (ECG) for the electrical activity of the heart, and accelerometers to monitor the posture of the patient, features extracted from EEG and ECG signals are used for prediction/detection of seizures. Thus, the objective of this paper is to present a comparative study in order to choose the appropriate classification method for seizure prediction and detection. Five classification methods were studied: Decision Trees, Discriminant Analysis, Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Ensemble Learning. For each of the classification methods, the accuracy, the specificity, the sensitivity, the precision, the false detection rate and the Fmeasure were studied and compared. The results for seizure prediction system show that the highest accuracy, specificity and F-Measure, and lowest false detection rate were achieved with Bagged Trees Ensemble Learning, the highest sensitivity and precision were achieved with Quadratic Support Vector Machine. However, for seizure detection system, the highest accuracy and F-Measure were achieved with Linear Support Vector, the highest sensitivity and specificity were achieved with Fine Gaussian Support Vector Machine, and the highest precision and lowest false detection rate were achieved with Subspace Discriminant Ensemble Learning. © 2020 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Rewriting for Monoidal Closed Categories 7

Rewriting for Monoidal Closed Categories

引用

7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022

作者： Alvarez-Picallo, Mario Ghica, Dan Sprunger, David Zanasi, Fabio Programming Languages Laboratory Huawei Research Centre United Kingdom Department of Computer Science University of Birmingham United Kingdom Programming Languages Laboratory Huawei Research Centre Reading United Kingdom Department of Computer Science University College London United Kingdom

ISBN: (纸本)9783959772334

This paper develops a formal string diagram language for monoidal closed categories. Previous work has shown that string diagrams for freely generated symmetric monoidal categories can be viewed as hypergraphs with interfaces, and the axioms of these categories can be realized by rewriting systems. This work proposes hierarchical hypergraphs as a suitable formalization of string diagrams for monoidal closed categories. We then show double pushout rewriting captures the axioms of these closed categories. © Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Initial thoughts on rapid prototyping techniques

Initial thoughts on rapid prototyping techniques

引用

Workshop on Rapid Prototyping 1982

作者： Taylor, Tamara Standish, Thomas A. Irvine Programming Environment Project Computer Science Department University of California IrvineCA92717 United States

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.

关键词： Rapid prototyping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：