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

Integrating on-line performance visualization and real-time system design

REAL-TIME SYSTEMS 2005年第3期30卷 163-185页

作者： Bakic, AM Mutka, MW Vlatacom Ltd Belgrade Serbia Monteneg Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

Emerging parallel or distributed, heterogeneous real-time computer systems with many disparate constraints and requirements would benefit from a unifying and comprehensive systems engineering support in the design, testing and deployment phases, which interfaces with a human at a very high level and efficiently handles the system complexity. We present an approach to integration of (1) a compiler- and constraint logic programming-based approach to design and engineering of real-time systems, and (2) an on-line performance analysis and visualization technology. An example distributed real-time system is used to help describe the integrated approach. Details are presented about how the involved technologies are used to help system developers and users achieve better system performance through on-line repair and reconfiguration.

关键词： constraint logic programming extension and glue language real-time design real-time linux real-time visualization

来源：评论

学校读者我要写书评

暂无评论

Predicting peptide interactions with model class II MHC structures

引用

INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 2005年第4期14卷 561-575页

作者： Swain, MT Brooks, AJ Kemp, GJL Univ Aberdeen Kings Coll Dept Comp Sci Aberdeen AB24 3UE Scotland

An automated method for constructing 3D models of class II MHC structures that uses constraint logic programming to select side-chain conformations is described. This method follows a comparative modeling approach in basing the model structures on experimentally determined MHC-peptide structures, but it uses constraints to ease open the peptide binding groove so that the modeled MHC structure is a less specific fit for the co-crystallized peptide in the starting structure. The resulting models are used by a "peptide threading" program that attempts to predict peptides from a protein sequence that will bind strongly to particular MHC alleles. Our results indicate that MHC models that have been constructed in this way enable the peptide threading program to make binding predictions that are comparable with those obtained when using experimentally determined MHC structures, suggesting that a combined modeling and peptide threading approach is worth pursuing for MHC molecules for which experimentally determined structures are not available.

关键词： constraint logic programming major histocompatibility complex binding predictions comparative modeling rotamer peptide threading

来源：评论

学校读者我要写书评

暂无评论

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

引用

COMPUTERS & CHEMICAL ENGINEERING 2005年第6期29卷 1277-1291页

作者： Roe, B Papageorgiou, LG Shah, N Univ London Imperial Coll Sci Technol & Med Ctr Proc Syst Engn Dept Chem Engn London SW7 2AZ England UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

This paper presents a novel hybrid constraint logic programming (CLP) and MILP algorithm for scheduling complex multipurpose batch processes. The scheduling problem is decomposed into two sub-problems: first an aggregate planning problem is solved using an MILP model, and then a sequencing problem is solved using CLP techniques. The CLP model avoids the complexity of explicitly stating complete material balance constraints by instead using precedence constraints between batches to ensure the schedule is feasible. The efficiency of the algorithm is demonstrated with four examples and areas for future improvement are identified. (c) 2005 Published by Elsevier Ltd.

关键词： MlLP/CLP algorithm constraint logic programming process scheduling

来源：评论

学校读者我要写书评

暂无评论

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

A hybrid MILP/CLP algorithm for multipurpose batch process s...

引用

14th European Symposium on Computer Aided Process Engineering (ESCAPE-14)

关键词： MlLP/CLP algorithm constraint logic programming process scheduling

来源：评论

学校读者我要写书评

暂无评论

Test Selection Strategies for Lustre Descriptions in GATeL

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年 111卷 93-111页

作者： Marre, Bruno Blanc, Benjamin CEA DRT DTSI SOL Lab Surete Logiciels F-91191 Gif Sur Yvette France

We describe various test selection techniques from Lustre descriptions using the tool GATeL. The Lustre language is declarative and describes synchronous data-flow computations. Our test generation tool interprets the language constructs as boolean and integer interval constraints. Test sequence generation is automated using constraint logic programming techniques. GATeL provides various mechanisms to allow testers to define their own selection strategies. They are illustrated on an simple example.

关键词： Lustre constraint logic programming test generation data-flow computation

来源：评论

学校读者我要写书评

暂无评论

Comparison of constraint logic programming and distributed problem solving: a case study for interactive, efficient and practicable job-shop scheduling

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2001年第1-2期39卷 187-211页

作者： Trentesaux, D Pesin, P Tahon, C CNRS UMR 8530 Lab Automat & Mecan Ind & Humaines Equipe Syst Prod F-59313 Le Mont Houy 09 Valenciennes France

The job-shop scheduling issue is more and more described not only in terms of efficiency (e.g. Makespan), but also in terms of interactivity and practicability. The aim of this paper is to evaluate the ability of two approaches inherited from artificial intelligence domain to contribute to the solving of this issue: constraint logic Program ming (CLP) on the one hand, and, on the other hand, Distributed Problem Solving (DPS) inherited from Distributed Artificial Intelligence (DAI). This analysis is achieved through the use of two specific computerised tools: constraint Handling In Prolog (CHIP) as a CLP software and the Distributed Production Scheduling System (DPSS) as a distributed problem solving system. These tools are then evaluated in terms of interactivity, efficiency and practicability. Interactivity is discussed according to qualitative points of view such as the ability to provide efficient decision support, a set of alternative solutions and the possibility to parameterise the algorithms. Efficiency is described in terms of optimality or sub-optimality by the analysis of the Makespan criterion vs. fixed computation time. Practicability is associated to the industrial viability of the methods: ability to cope with real industrial case study or ability to face real industrial contexts. Evaluation is then performed through a multiple criteria analysis. This analysis is achieved given an increasing number of operations to perform. The results highlight the high complementary level of these two approaches, allowing us to provide a framework for a joint integration, which shall be optimised when taking into account the assets of each approach according to the three evaluation criteria. (C) 2001 Elsevier Science Ltd. All rights reserved.

关键词： constraint logic programming distributed problem solving job-shop scheduling

来源：评论

学校读者我要写书评

暂无评论

ATGen: automatic test data generation using constraint logic programming and symbolic execution

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2001年第2期11卷 81-96页

作者： Meudec, C Inst Technol Carlow Comp Phys & Math Dept Carlow Ireland

The verification and validation of software through dynamic testing is an area of software engineering where progress towards automation has been slow. In particular the automatic design and generation of test data remains, by and large, a manual activity. This is despite the high promises that the symbolic execution technique engendered when it was first proposed as a method for automatic test data generation. This paper presents an automatic test data generator based on constraint logic programming and symbolic execution. After reviewing the symbolic execution technique, approaches for the resolution of the technical difficulties that have so far prevented symbolic execution from reaching its full potential in the area of automatic test data generation are presented. ATGen, an automatic test data generator, based on symbolic execution and that uses constraint logic programming, is then discussed. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： software testing automatic test data generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Constructive negation and constraint logic programming with sets

引用

NEW GENERATION COMPUTING 2001年第3期19卷 209-255页

作者： Dovier, A Pontelli, E Rossi, G Univ Verona Dip Sci Tecnol I-37134 Verona Italy New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Parma Dipartimento Matemat I-43100 Parma Italy

The aim of this paper is to extend the Constructive Negation technique to the case of CLP(SET), a constraint logic programming (CLP) language based on hereditarily (and hybrid) finite sets. The challenging aspects of the problem originate from the fact that the structure on which CLP(SET) is based is not admissible closed, and this does not allow to reuse the results presented in the literature concerning the relationships between CLP and constructive negation. We propose a new constraint satisfaction algorithm, capable of correctly handling constructive negation for large classes of CLP(SET) programs;we also provide a syntactic characterization of such classes of programs. The resulting algorithm provides a novel constraint simplification procedure to handle constructive negation, suitable to theories where unification admits multiple most general unifiers. We also show, using a general result, that it is impossible to construct an interpreter for CLP(SET) with constructive negation which is guaranteed to work for any arbitrary program;we identify classes of programs for which the implementation of the constructive negation technique is feasible.

关键词： constraint logic programming constructive negation programming with sets

来源：评论

学校读者我要写书评

暂无评论

Cane railway scheduling via constraint logic programming: Labelling order and constraints in a real-life application

引用

ANNALS OF OPERATIONS RESEARCH 2001年第1-4期108卷 193-209页

作者： Martin, F Pinkney, A Yu, XH Univ Cent Queensland Fac Informat & Commun Mackay Qld 4741 Australia

In Australia, cane transport is the largest unit cost in the manufacturing of raw sugar, making up around 35% of the total manufacturing costs. Producing efficient schedules for the cane railways can result in significant cost savings. This paper presents a study using constraint logic programming (CLP) to solve the cane transport scheduling problem. Tailored heuristic labelling order and constraints strategies are proposed and encouraging results of application to several test problems and one real-life case are presented. The preliminary results demonstrate that CLP can be used as an effective tool for solving the cane transport scheduling problem, with a potential decrease in development costs of the scheduling system. It can also be used as an efficient tool for rescheduling tasks which the existing cane transport scheduling system cannot perform well.

关键词： cane railway scheduling constraint logic programming labelling order

来源：评论

学校读者我要写书评

暂无评论

Model based testing in incremental system development

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2004年第3期70卷 315-329页

作者： Pretschner, A Lötzbeyer, H Philipps, J Tech Univ Munich Inst Informat D-85748 Garching Germany

The spiraling nature of evolutionary software development processes produces executable parts of the system at the end of each loop. It is argued that these parts should consist not only of programming language code, but of executable graphical system models. As a main benefit of the use of more abstract, yet formal, modeling languages, a method for model based test sequence generation for reactive systems on the grounds of constraint logic programming as well as its implementation in the CASE tool AUTOFOCUS is presented. (C) 2003 Elsevier Inc. All rights reserved.

关键词： cleanroom SW engineering constraint logic programming extreme programming incremental development rapid prototyping reactive systems test case generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：