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

14th World Congress on Medical and Health Informatics (MEDINFO)

作者： Wilk, Szymon Michalowski, Martin Michalowski, Wojtek Farion, Ken Lin, Di Hing, Marisela Mainegra Mohapatra, Subhra Poznan Univ Tech Fac Comp Sci Piotrowo 2 PL-60965 Poznan Poland Adventium Labs Minneapolis MN USA Univ Ottawa Telfer Sch Management Ottawa ON Canada Childrens Hosp Eastern Ontario Div Emergency Med Ottawa ON Canada McGill Univ Dept Elect & Comp Engn Montreal PQ Canada Univ Ottawa Fac Med Ottawa ON Canada

ISBN: (纸本)9781614992899;9781614992882

Managing a patient with comorbid diseases according to multiple clinical practice guidelines (CPGs) may result in adverse interactions that need to be mitigated (identified and addressed) so a safe therapy can be devised. However, mitigation poses both clinical and methodological challenges. It requires extensive domain knowledge and calls for advanced CPG models and efficient algorithms to process them. We respond to the above challenges by describing our algorithm that mitigates interactions between pairs of CPGs. The algorithm creates logical models of analyzed CPGs and uses constraint logic programming (CLP) together with domain knowledge, codified as interaction and revision operators, to process them. logical CPG models are transformed into CLP-CPG models that are solved to find a safe therapy. We represent these CLP-CPG models using MiniZinc, a standard language for CLP models. As motivation and illustration of our mitigation algorithm we use a clinical case study describing a patient managed for hypertension and deep vein thrombosis according to two individual CPGs. We apply the algorithm to this scenario and present MiniZinc representations of the constructed CLP-CPG models.

关键词： Clinical Practice Guideline Comorbidity Adverse Drug Event constraint logic programming MiniZinc Language

来源：评论

学校读者我要写书评

暂无评论

Decision support systems based on CLP approach in SMEs

Decision support systems based on CLP approach in SMEs

引用

11th IEEE International Conference on Emerging Technologies and Factory Automation

作者： Tomczuk-Pirog, Izabela Wojcik, Robert Banaszak, Zbigniew Tech Univ Opole Dept Management & Prod Engn PL-45370 Opole Poland Polish Acad Sci Syst Res Inst Lab Knowledge Syst & Artificial Intelligence PL-50449 Warsaw Poland Wroclaw Univ Technol Inst Comp Engn Control & Robot PL-50372 Wroclaw Poland

ISBN: (纸本)9780780397583

The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (constraint logic programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order, execution in a manufacturer's company (Archimedes S.A.).

关键词： constraint logic programming decision support flow planning constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

A Multi-level and Multi-agent Approach to Modeling and Solving Supply Chain Problems

A Multi-level and Multi-agent Approach to Modeling and Solvi...

引用

14th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Wikarek, Jaroslaw Sitek, Pawel Kielce Univ Technol Dept Informat Syst Kielce Poland

ISBN: (纸本)9783319393872;9783319393865

Supply chain problems cover several aspects at different levels and areas. There are decision on production allocation, resource allocation, production and inventory quantities, distributor selection, choice of transportation mode etc. There are many constraints in the supply chain problems. They concern the following areas ( production, distribution, transport, etc.) and types ( linear, non-linear, integer, logical, etc.). Therefore it is important effective modeling and solving constraints. We consider a multi-level and multi-agent approach to modeling and solving supply chain problems using constraint and mathematical programming environments. Its efficiency results from the multi-level presolving and multi-agent architecture. An illustrative example presents effectiveness of the proposed approach. The presented approach will be compared with classical mathematical programming on the same data sets.

关键词： constraint logic programming Mathematical programming Multi-agent Supply chain Optimization

来源：评论

学校读者我要写书评

暂无评论

Automated test generation for synchronous controllers 11

Automated test generation for synchronous controllers

引用

11th IEEE/ACM International Workshop in Automation of Software Test (AST)

作者： Mnad, Mouna Tka Deleuze, Christophe Parissis, Ioannis Launay, Jackie Gning, Jean Baptiste Univ Grenoble Alpes LCIS F-26000 Valence France InnoVista Sensors F-26902 Valence France

ISBN: (纸本)9781450341516

This paper addresses the problem of automating the production of test sequences for a particular class of Programmable logic Controllers (em4) produced by InnoVista Sensors (1). The latter are synchronous systems and are programmed by means of an ad hoc integrated development environment (IDE). People using and programming such controllers are not necessarily experienced programmers, so the development of software applications must be simple and intuitive. This should also be the case for testing. Until now, the design of test input sequences is informal and testing is interactively performed by programmers using a simulator included in the IDE. Based on previous investigations on testing of synchronous programs, we propose a method to automatically generate test inputs sequences for synchronous controllers. In a previous paper we presented a new test specification language, called SPTL (Synchronous Programs Testing Language) that makes possible to simply express test scenarios. In this paper, we present a prototype tool that we designed and developed, named "Testium", that translates a SPTL program into a set of constraints exploited by a Prolog solver to randomly choose test inputs.

关键词： Software testing synchronous approach automatic test data generation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

DELTASTAR - A GENERAL ALGORITHM FOR INCREMENTAL SATISFACTION OF constraint HIERARCHIES 11

DELTASTAR - A GENERAL ALGORITHM FOR INCREMENTAL SATISFACTION...

引用

11TH ANNUAL INTERNATIONAL PHOENIX CONF ON COMPUTERS AND COMMUNICATIONS ( IPCCC-92 )

作者： FREEMANBENSON, B WILSON, M BORNING, A University of Victoria Computer Science P.O. Box 3055 Victoria V8W3P6 BC Canada University of Washington Department of Computer Science and Engineering FR-35 Seattle 98195 WA United States

ISBN: (纸本)0780306058

The efficient satisfaction of constraints is crucial for the implementation of constraint programming languages and systems, such as ThingLab 11, CLP(R), CHIP, Prolog-111, and Kaleidoscope. Previously, we defined the notion of constraint hierarchies, which allow both required and preferential constraints. We have successfully used constraint hierarchies in a number of languages and systems. For our second generation implementation of these systems, we designed the DELTASTARin cremental constraint hierarchy solver. DELTASTARis a framework for incremental solvers built above an existing flat solver that provides the actual constraint solving techniques. By plugging different flat solvers into DELTASTARdi,f ferent hierarchical solvers can quickly be produced and experimented with. We discuss two implementations of DELTASTARa,s well as previous algorithms that can be viewed as instances of DELTASTAR. © 1992 IEEE.

关键词： NONTRADITIONAL LANGUAGES constraintS constraint HIERARCHIES constraint logic programming GRAPHICS AND OBJECT-ORIENTED programming

来源：评论

学校读者我要写书评

暂无评论

From programs to object code and back again using logic programming: Compilation and decompilation

引用

Journal of Software Maintenance: Research and Practice 1993年第4期5卷 205-234页

作者： Bowen, Jonathan Oxford University Computing Laboratory Programming Research Group Oxford OX1 3QD 11 Keble Road United Kingdom

A compiler may be specified by a description of how each construct of the source language is translated into a sequence of object code instructions. It is possible to produce a compiler prototype almost directly from this specification in the form of a logic program. This defines a relation between allowed high‐level and low‐level program constructs. Normally a high‐level program is supplied as input to a compiler and object code is returned. Because of the declarative nature of a logic program, it is possible for the object code to be supplied and the allowed high‐level programs returned, resulting in a decompiler, provided enough information is available in the object code. This paper discusses the problems of adopting such an approach in practice. A simple compiler and decompiler are presented in full as an example in the logic programming language Prolog, together with some sample output. The possible benefits of using constraint logic programming are also considered. Potential applications include reverse‐engineering in the software maintenance process, verification of safety‐critical object code, quality assessment of code and program debugging tools. Copyright © 1993 John Wiley & Sons, Ltd

关键词： Compiler constraint logic programming Decompilation logic programming Prolog prototyping Reverse‐engineering

来源：评论

学校读者我要写书评

暂无评论

Modeling Block Structured Project Scheduling with Resource constraints 12th

Modeling Block Structured Project Scheduling with Resource C...

引用

12th International Conference on Large-Scale Scientific Computations (LSSC)

作者： Badica, Amelia Badica, Costin Logofatu, Doina Buligiu, Ion Ciora, Liviu Univ Craiova Craiova Romania Univ Appl Sci Frankfurt Germany

ISBN: (纸本)9783030410322;9783030410315

We propose a formal model of block-structured project scheduling with resource constraints, with the goal of designing optimization algorithms. We combine block structured modeling of business processes with results from project scheduling literature. Differently from standard approaches, here we focus on block structured scheduling processes. Our main achievement is the formulation of an abstract mathematical model of block-structured resource-constrained scheduling processes. We tested the correctness and feasibility of our approach using an initial experimental prototype based on constraint logic programming.

关键词： Project scheduling Process algebra Ordering and resource constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Intensional sets in CLP

引用

19th International Conference on logic programming

作者： Dovier, A Pontelli, E Rossi, G Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Parma Dipartimento Matemat I-43100 Parma Italy

ISBN: (纸本)3540206426

We propose a parametric introduction of intensionally defined sets into any CLP(D) language. The result is a language CLP({D}), where constraints over sets of elements of D and over sets of sets of elements, and so on, can be expressed. The semantics of CLP({D}) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in CLP({D}) and propose algorithms for constraints simplification.

关键词： constraint logic programming sets aggregates

来源：评论

学校读者我要写书评

暂无评论

Solving functional constraints by variable substitution

引用

THEORY AND PRACTICE OF logic programming 2011年第2-3期11卷 297-322页

作者： Zhang, Yuanlin Yap, Roland H. C. Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Univ Singapore Sch Comp Singapore 117417 Singapore

Functional constraints and bi-functional constraints are an important constraint class in constraint programming (CP) systems, in particular for constraint logic programming (CLP) systems. CP systems with finite domain constraints usually employ constraint Satisfaction Problem(s)-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other nonfunctional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

关键词： constraint logic programming constraint satisfaction problem Functional constraints Variable substitution Arc consistency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：