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

Specification, implementation, and verification of Domain Specific Languages: A logic programming-based approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年 2407卷 211-239页

作者： Gupta, Gopal Pontelli, Enrico Applied Logic Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States

ISBN: (纸本)3540439595

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logic programming-based framework for specification, efficient implementation, and automatic verification of domain specific languages (DSLs). Our framework is based on using Horn logic (or pure Prolog), and eventually constraints, to specify denotational semantics of domain specific languages. Both the syntax as well as the semantic specification of the DSL in question are directly executable in our framework: the specification itself serves as an interpreter for the DSL. More efficient implementations of this DSL-a compiler-can be automatically derived via partial evaluation. Additionally, the executable specification can be used for automatic or semi-automatic verification of programs written in the DSL as well as for automatically obtaining traditional debuggers and profilers. The ability to verify DSL programs is a distinct advantage of our approach. In this paper we give a general outline of our approach, and illustrate it with practical examples. © 2002 Springer-Verlag Berlin Heidelberg.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a domain specific language for phylogenetic inference.

引用

Journal of bioinformatics and computational biology 2003年第2期1卷 201-230页

作者： Pontelli, Enrico Ranjan, Desh Gupta, Gopal Milligan, Brook Knowledge Representation Logic and Advanced Programming Laboratory Department of Computer Science New Mexico State University Box 30001/CS Las Cruces 88003 NM United States

Domain experts think and reason at a high level of abstraction when they solve problems in their domain of expertise. We present the design and motivation behind a domain specific language, called phi LOG, to enable biologists to program solutions to phylogenetic inference problems at a very high level of abstraction. The implementation infrastructure (interpreter, compiler, debugger) for the DSL is automatically obtained through a software engineering framework based on Denotational Semantics and Logic programming.

关键词： Domain specific languages logic programming phylogenetic inference

来源：评论

学校读者我要写书评

暂无评论

Classification of a bank data set on various data mining platforms 4

Classification of a bank data set on various data mining pla...

引用

4th Electric Electronics, Computer Science, Biomedical Engineerings' Meeting, EBBT 2018

作者： Basarslan, Muhammet Sinan Argun, Irem Duzdar Computer Programming School of Advanced Vocational Studies Doǧuş University Istanbul Turkey Industry Engineering Department Engineering Faculty Düzce University Düzce Turkey

ISBN: (纸本)9781538651353

The process of extracting meaningful rules from big and complex data is called data mining. Data mining has an increasing popularity in every field today. Data units are established in customer-oriented industries such as marketing, finance and telecommunication to work on the customer churn and acquisition, in particular. Among the data mining methods, classification algorithms are used in studies conducted for customer acquisition to predict the potential customers of the company in question in the related industry. In this study, bank marketing data set in UCI Machine Learning Data Set was used by creating models with the same classification algorithms in different data mining programs. Accuracy, precision and f- measure criteria were used to test performances of the classification models. When creating the classification models, the test and training data sets were randomly divided by the holdout method to evaluate the performance of the data set. The data set was divided into training and test data sets with the 60-40%, 75, 25% and 80-20% separation ratios. Data mining programs used for these processes are the R, Knime, RapidMiner and WEKA. And, classification algorithms commonly used in these platforms are the k-nearest neighbor (k-nn), Naive Bayes, and C4.5 decision tree. © 2018 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Reasoning (on) service component ensembles in rewriting logic

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8373卷 188-211页

作者： Belzner, Lenz De Nicola, Rocco Vandin, Andrea Wirsing, Martin Programming and Software Engineering LMU Munich Germany IMT Institute for Advanced Studies Lucca Italy

programming autonomic systems with massive number of heterogeneous components poses a number of challenges to language designers and software engineers and requires the integration of computational tools and reasoning tools. We present a general methodology to enrich SCEL, a recently introduced language for programming systems with massive numbers of components, with reasoning capabilities that are guaranteed by external reasoners. We show how the methodology can be instantiated by considering the Maude implementation of SCEL and a specific reasoner, Pirlo, implemented in Maude as well. Moreover we show how the actual integration can benefit from the existing analytical tools of the Maude framework. In particular, we demonstrate our approach by considering a simple scenario consisting of a group of robots moving in an arena aiming at minimising the number of collisions. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

LAR-CC: Large atomic regions with conditional commits

LAR-CC: Large atomic regions with conditional commits

引用

作者： Borin, Edson Wu, Youfeng Breternitz, Mauricio Wang, Cheng Institute of Computing University of Campinas Brazil Programming Systems Lab. Intel Labs. United Kingdom Advanced Software and Analytics Technology Group - AMD United Kingdom

ISBN: (纸本)9781612843551

HW/SW Co-designed systems rely on dynamic binary translation and optimizations for efficient execution of binary code. Due to memory ordering properties and other architectural constraints, most binary optimizations are applied to regions of code that are atomically executed. To ensure that the underlying hardware has enough speculative resources to execute the whole atomic region, these systems typically form short atomic regions, with only 20 to 30 instructions. However, the shorter is the atomic region the smaller is the scope for optimizations. We present LAR-CC, a novel technique that enables HW/SW co-designed systems to optimize large atomic regions and dynamically fit them into the available speculative hardware resources by means of conditional commits. The LAR-CC technique consists of two major components: 1) conditional branch instructions to conditionally skip commit operations;2) code transformations that replace commit operations by conditional commits and enable optimizations to be applied on the large atomic regions. Our experiments show that LAR-CC can effectively achieve dynamic atomic region sizes larger than 1000 instructions, providing sufficiently large scope to apply many advanced optimizations on HW/SW co-designed systems. © 2011 IEEE.

关键词： Cosine transforms

来源：评论

学校读者我要写书评

暂无评论

ST2: Small-data Text Style Transfer via Multi-task Meta-Learning

arXiv

引用

arXiv 2020年

作者： Chen, Xiwen Zhu, Kenny Q. Advanced Data and Programming Technologies Lab Shanghai Jiao Tong University

Text style transfer aims to paraphrase a sentence in one style into another style while preserving content. Due to lack of parallel training data, state-of-art methods are unsupervised and rely on large datasets that share content. Furthermore, existing methods have been applied on very limited categories of styles such as positive/negative and formal/informal. In this work, we develop a meta-learning framework to transfer between any kind of text styles, including personal writing styles that are more fine-grained, share less content and have much smaller training data. While state-of-art models fail in the few-shot style transfer task, our framework effectively utilizes information from other styles to improve both language fluency and style transfer accuracy. Copyright © 2020, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

The chase of datalog programs 16th

The chase of datalog programs

引用

16th British National Conference on Databases, BNCOD 1998

作者： Brisaboa, Nieves R. González, Agustin Hernández, Héctor J. Paramá, José R. Univ. da Coruna A Coruña Spain Laboratory for Logic Databases and Advanced Programming Dept. of Co. Science NMSU Las CrucesNM88003-0001 United States

ISBN: (纸本)3540646590

The chase of datalog programs is anew way to reason about datalog programs that are evaluated on databases consistent with a set of constraints. It is an equivalence-preserving program transformation that uncovers properties of datalog programs that must hold when they are evaluated on consistent databases. Here, we summarizes our research. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Nested parallel call optimization

Nested parallel call optimization

引用

International Symposium on Parallel Processing

作者： E. Pontelli G. Gupta Laboratory for Logic Databases and Advanced Programming New Mexico State University NM USA

We present a novel optimization called Last Parallel Call Optimization (LPCO) for parallel systems. The last parallel call optimization can be regarded as a parallel extension of last call optimization found in sequential systems. While the LPCO is fairly general, we use and-parallel logic programming systems to illustrate it and to report its performance on multiprocessor systems. The last parallel call optimization leads to improved time and space performance for a majority of and-parallel programs. We also present a generalization of the Last Parallel Call Optimization called Nested Parallel Call Optimization (NPCO). A major advantage of LPCO and NPCO is that parallel systems designed for exploiting control parallelism can automatically exploit data parallelism efficiently.

关键词： Logic programming Multiprocessing systems Automatic control Control systems

来源：评论

学校读者我要写书评

暂无评论

Expert system shells: Tools to aid human performance

引用

Journal of Instructional Development 1987年第2期10卷 15-19页

作者： Welsh, Jack R. Wilson, Brent G. Advanced Systems Inc. Arlington Heights 60005 IL 155 E. Algonquin Road United States Programming Instructional Technology GA 219-LEPS Northern Illinois University DeKalb 60115 IL United States

The purpose of this article is to examine the role an expert system can play as an intelligent job aid. The use of expert system shells for microcomputers is discussed. We argue that instructional designers, with their competencies in consulting with experts and representing content, are an ideal constituency for learning how to develop expert systems within organizations. The paper concludes by presenting some issues that are important for instructional designers to keep in mind as they begin using expert systems to support job performance. © 1987 Association for Educational Communications and Technology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Containment of conjunctive queries with built-in predicates with variables and constants over any ordered domain 2nd

Containment of conjunctive queries with built-in predicates ...

引用

2nd East European Symposium on Advances in Databases and Information Systems, ADBIS 1998

作者： Brisaboa, Nieves R. Hernández, HÉctor J. Paramá, José R. Penabad, Miguel R. Departamento de Computación Universidade da Coruña Corufia15071 A Spain Laboratory for Logic Databases and Advanced Programming New Mexico State University Las CrucesNM88003-8001 United States

In this paper, we consider conjunctive queries with built-in predicates of the form X © Springer-Verlag Berlin Heidelberg 1998.

ISBN: (纸本)3540649247

In this paper, we consider conjunctive queries with built-in predicates of the form X © Springer-Verlag Berlin Heidelberg 1998.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：