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

Predicting building facade structures with multilinear Gaussian graphical models based on few observations

COMPUTERS ENVIRONMENT AND URBAN SYSTEMS 2015年第Nov.期54卷 68-81页

作者： Loch-Dehbi, Sandra Pluemer, Lutz Univ Bonn Inst Geodesy & Geoinformat Bonn Germany

This paper presents a new approach for the prediction of substructures in building facades based on sparse observations. We automatically generate a small number of most likely hypotheses and provide probabilities for each of them. Probability density functions of model parameters which in most cases are non Gaussian and multimodal are learned from training data and approximated by Gaussian mixtures. Relations between model parameters are represented by non-linear constraints. For stochastic reasoning we design and apply a special kind of Bayesian networks which involves both discrete as well as continuous variables, a scenario which often suggests the use of approximate inference which however is infeasible in the face of a huge number of competing model hypotheses. In order to be able to scan huge model spaces avoiding the pitfalls of approximate reasoning and to exploit the potential of both observations and models, we combined Bayesian networks with constraint logic programs. We designed a method which breaks down the problem into a feasible number of subproblems for which exact inference can be applied. We illustrate our approach with building facades and demonstrate that particularly for buildings with strong symmetries number and position of windows can be deduced on the basis of ground plans alone. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： 3D city models CityGML Stochastic reasoning Hybrid Bayesian networks constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards verification of computation orchestration

引用

FORMAL ASPECTS OF COMPUTING 2014年第4期26卷 729-759页

作者： Dong, Jin Song Liu, Yang Sun, Jun Zhang, Xian Natl Univ Singapore Sch Comp Singapore 117548 Singapore Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore Singapore

Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc programs. The practical implication is that existing tool supports for Timed Automata, e.g., Uppaal, can be used to simulate and model check Orc programs. An experimental tool has been implemented to automate this approach. Secondly, we start with encoding the operational semantics of Orc language in constraint logic programming (CLP), which allows a systematic translation from Orc to CLP. Powerful constraint solvers like CLP are then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, lower or upper bound of a time interval, etc. Counterexamples are generated when properties are not satisfied. Furthermore, the stepwise execution traces can be automatically generated as the simulation steps. The two different approaches give an insight into the verification problem of Web Service orchestration. The Timed Automata approach has its merits in visualized simulation and efficient verification supported by the well developed tools. On the other hand, the CPL approach gives better expressiveness in both modeling and verification. The two approaches com

关键词： Orc Web service orchestration Verification Timed automata Uppaal constraint logic programming CLP(R)

来源：评论

学校读者我要写书评

暂无评论

A pearl on SAT and SMT solving in Prolog

引用

THEORETICAL COMPUTER SCIENCE 2012年 435卷 43-55页

作者： Howe, Jacob M. King, Andy Univ Kent Sch Comp Canterbury CT2 7NF Kent England City Univ London Dept Comp London EC1V 0HB England

A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented as a programming pearl. Furthermore, the SAT solver can be integrated into an SMT framework which exploits the constraint solvers that are available in many Prolog systems. (C) 2012 Elsevier B.V. All rights reserved.

关键词： SAT solving SMT solving Prolog constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Test case generation for object-oriented imperative languages in CLP

引用

THEORY AND PRACTICE OF logic programming 2010年第4-6期10卷 659-674页

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid UPM DLSIIS E-28660 Madrid Spain

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that constraint logic programming (CLP) has a promising application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.

关键词： test case generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A novel approach to decision support and optimization of group job handling for multimodal processes in manufacturing and services 15

A novel approach to decision support and optimization of gro...

引用

15th IFAC Symposium on Information Control Problems in Manufacturing

作者： Sitek, Pawel Wikarek, J. Kielce Univ Technol Dept Control & Management Syst Kielce Poland

This study deals with decision support system and optimization of parallel handling of groups of jobs. All jobs in a group should be delivered at the same time after processing. The authors present a novel hybrid approach, which includes the modelling of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming) In addition to the iterative algorithm for solving the hybrid model under dynamic emergence of new orders, the paper proposes the transformation and linearization of the model in CLP/MP environment. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager. The paper proposes new CLP-based functionalities and an illustrative example with the model for service providers (a restaurant). (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： group processing mathematical programming constraint logic programming optimization decision support systems optimization multimodal processes

来源：评论

学校读者我要写书评

暂无评论

Formalizing CSCL Scripts with logic and constraints 13th

Formalizing CSCL Scripts with Logic and Constraints

引用

13th European Conference on Technology Enhanced Learning (EC-TEL)

作者： Papasalouros, Andreas Univ Aegean Dept Math Karlovassi 83200 Greece

ISBN: (纸本)9783319985725;9783319985718

CSCL (Computer-Supported Collaborative Learning) scripts describe pedagogically effective practices for organizing the experiences of individuals when engaged in collaborative activities. This paper presents a new language named COSTLy for describing certain mechanisms of CSCL scripts, namely, group formation and task distribution. The expressiveness of the proposed language is demonstrated by describing jigsaw, a well-known CSCL script. The proposed descriptions are automatically transformed into constraint logic programs which can be executed so as to support group formation in actual scenario instances.

关键词： Learning activity representation Collaborative scripts constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A model-based design-for-verification approach to checking for deadlock in multi-threaded applications

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2007年第2期17卷 207-230页

作者： Sarna-Starosta, Beata Stirewalt, R. E. K. Dillon, Laura K. Michigan State Univ Dept Comp Sci & Engn Software Engn & Network Syst Labs E Lansing MI 48824 USA

This paper explores an approach to design for verification in systems built atop a middleware framework which separates synchronization concerns from the "core-functional logic" of a program. The framework is based on a language-independent compositional model of synchronization contracts, called Szumo, which integrates well with popular OO design artifacts and provides strong guarantees of non-interference for a class of strictly exclusive systems. An approach for extracting models from Szumo design artifacts and analyzing the generated models to detect deadlocks is described. A key decision was to use constraint Handling Rules to express the semantics of synchronization contracts, which allowed a transparent model of the implementation logic.

关键词： concurrency analysis constraint logic programming design for verification

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Modeling and solving technical product configuration problems

引用

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2011年第2期25卷 115-129页

作者： Falkner, Andreas Haselboeck, Alois Schenner, Gottfried Schreiner, Herwig Siemens AG Corp Technol Cent & Eastern Europe Res & Technol A-1210 Vienna Austria

This paper describes and evaluates approaches to model and solve technical product configuration problems using different artificial intelligence methodologies. By means of a typical example, the benefits and limitations of different artificial intelligence methods are discussed and a flexible software architecture for integrating different solvers in a product configurator is proposed.

关键词： Artificial Intelligence constraint logic programming constraint Satisfaction Product Configuration SAT

来源：评论

学校读者我要写书评

暂无评论

Value constraints in the CLP Scheme

引用

constraints 1997年第2期2卷 163-183页

作者： Van Emden, M.H. Department of Computer Science University of Victoria Victoria BC V8W 3P6 P.O. Box 3055 Canada

We define value constraints, a method for incorporating constraint propagation into logic programming. It is a subscheme of the CLP scheme and is applicable wherever one has an efficient method for representing sets of possible values. As examples we present: small finite sets, sets of ground instances of a term, and intervals of reals with floating-point numbers as bounds. Value constraints are defined by distinguishing two storage management strategies in the CLP scheme. In value constraints the infer step of the CLP scheme is implemented by Waltz filtering. We give a semantics for value constraints in terms of set algebra that gives algebraic characterizations of local and global consistency. The existing extremal fixpoint characterization of chaotic iteration is shown to be applicable to prove convergence of Waltz filtering.

关键词： Arc consistency Chaotic iterations CLP constraint logic programming constraint propagation Fixpoints Interval constraints Waltz filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：