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

International Conference on Automation

作者： Wikarek, Jaroslaw Sitek, Pawel Stefanski, Tadeusz Kielce Univ Technol Inst Management & Control Syst Al 1000 Lecia PP 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319771793;9783319771786

Distribution related problems in logistics have many decision variables and constraints that have to be considered simultaneously. Most often, these are the problems in the discrete optimization branch, modeled and optimized using operational research, in particular mathematical programming (MP) models and methods, such as mixed integer linear programming (MILP), integer programming (IP) and integer linear programming (ILP). These methods become ineffective very quickly in the case of larger size problems. Also, the number of decision variables and constraints may exceed the capacity of available MP solvers. To improve their efficiency and reduce the effective size of the solution space of a given problem, hybrid approaches are being developed, integrating MP with other environments. This article discusses the results of comparative analysis of several MP solvers (LINGO, SCIP, GUROBI) in the context of their use for optimization of selected distribution problems.

关键词： Discrete optimization Mathematical programming constraint logic programming Hybridization Distribution problems

来源：评论

学校读者我要写书评

暂无评论

PET: A Partial Evaluation-based Test Case Generation Tool for Java Bytecode 10

PET: A Partial Evaluation-based Test Case Generation Tool fo...

引用

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

作者： Albert, Elvira Gomez-Zamalloa, Miguel Puebla, German Univ Complutense Madrid E-28040 Madrid Spain

ISBN: (纸本)9781605587271

PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Partial Evaluations (PE). The first PE decompiles the Java bytecode program into an equivalent CLP (constraint logic programming) counterpart. The second PE generates a test-case generator from the CLP program. This generator captures interesting test coverage criteria and it is able to generate further test cases on demand. For the first PE. PET incorporates an existing tool which decompiles bytecode to CLP. The main contribution of this work is the implementation of the second PE and the proof of concept of the approach. This has required the development of a partial evaluator for CLP with appropriate control strategies to ensure the required coverage criteria and to generate test-case generators. PET can be downloaded as free software from its web site, where a repository of examples and a web interface are also provided. Though PET has to be extended to be applicable to larger programs, we argue that it provides some evidence that the approach can be of practical interest.

关键词： Testing Test-case generation Partial evaluation Symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Optimization of Message Encryption for Distributed Embedded Systems with Real-Time constraints

Optimization of Message Encryption for Distributed Embedded ...

引用

14th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Jiang, Ke Eles, Petru Peng, Zebo Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (纸本)9781424497560

In this paper we consider distributed embedded systems in which privacy or confidentiality of the internal communication is critical, and present an approach to optimizing cryptographic algorithms under strict timing constraints. We have developed a technique to search for the best system-affordable cryptographic protection for the messages transmitted over the internal communication bus. Towards this, we formulate the optimization technique in constraint logic programming (CLP), which returns optimal results. However, CLP executions are computationally expensive and hence, we propose an efficient heuristic as an alternative. Extensive experiments demonstrate the efficiency of the proposed heuristic approach.

关键词： Automotive engineering CLP Embedded systems Encryption Optimization Program processors constraint logic programming cryptography distributed embedded system distributed processing field buses internal communication bus message encryption optimisation optimization technique real-time constraints

来源：评论

学校读者我要写书评

暂无评论

Semi-dynamic demand in a non-permutation flowshop with constrained resequencing buffers

引用

6th International Conference on Large-Scale Scientific Computing (LSSC 2007)

作者： Faerber, Gerrit Salhi, Said Coves Moreno, Anna M. Univ Politecn Cataluna Inst Org Control Sistemes Ind Barcelona Spain Univ Kent Kent Business Sch Ctr Heurist Optimisat Canterbury Kent England

ISBN: (纸本)9783540788256

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using constraint logic programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.

关键词： semi-dynamic demand constraint logic programming genetic algorithm non-permutation flowshop mixed model assembly line

来源：评论

学校读者我要写书评

暂无评论

On Detecting Semantic Clones in constraint logic Programs 16

On Detecting Semantic Clones in Constraint Logic Programs

引用

16th IEEE International Workshop on Software Clones (IWSC)

作者： Yernaux, Gonzague Vanhoof, Wim Univ Namur Fac Comp Sci Namur Digital Inst Namur Belgium

ISBN: (数字)9781665484473

ISBN: (纸本)9781665484473

Deciding whether two code fragments are semantic clones, or type-4 clones, is a problem with many ramifications. Current research often focuses on the problem in an imperative or object-oriented setting and most existing work uses abstract syntax trees, program dependency graphs, program metrics or text-based, token-based and machine learning-based approaches to identify semantic clones. In this work, we adopt a fundamentally different point of view and express clone detection as a search problem in a logic programming setting. Due to their restricted syntax and semantics, (constraint) logic programs are by nature simple and elegant candidates for automated analysis. After having formalized the clone detection problem at the level of predicates, we develop a study of the different parameters that come into play in the resulting framework. We try and identify the complexity issues involved in a general semantic clone detection procedure that essentially computes so-called most specific generalizations for predicates written in constraint logic programming (CLP). Even though well-known for basic structures such as literals and terms, generalization (or anti-unification) of more complex structures such as clauses and predicates has received very little attention. We show that the anti-unification allows both to control the search and guide the detection of cloned predicates. We pinpoint where efficient approximations are needed in order to be able to identify semantic code clones in a manageable time frame.

关键词： Semantic Clone Detection constraint logic programming Complexity Anti-unification

来源：评论

学校读者我要写书评

暂无评论

Reason to Explain: Interactive Contrastive Explanations (REASONX) 1st

Reason to Explain: Interactive Contrastive Explanations (REA...

引用

1st World Conference on Explainable Artificial Intelligence (XAI)

作者： State, Laura Ruggieri, Salvatore Turini, Franco Univ Pisa Pisa Italy Scuola Normale Super Pisa Pisa Italy

ISBN: (纸本)9783031440632;9783031440649

Many high-performing machine learning models are not interpretable. As they are increasingly used in decision scenarios that can critically affect individuals, it is necessary to develop tools to better understand their outputs. Popular explanation methods include contrastive explanations. However, they suffer several shortcomings, among others an insufficient incorporation of background knowledge, and a lack of interactivity. While (dialogue-like) interactivity is important to better communicate an explanation, background knowledge has the potential to significantly improve their quality, e.g., by adapting the explanation to the needs of the end-user. To close this gap, we present reasonx, an explanation tool based on constraint logic programming (CLP). reasonx provides interactive contrastive explanations that can be augmented by background knowledge, and allows to operate under a setting of under-specified information, leading to increased flexibility in the provided explanations. reasonx computes factual and contrastive decision rules, as well as closest contrastive examples. It provides explanations for decision trees, which can be the ML models under analysis, or global/local surrogate models of any ML model. While the core part of reasonx is built on CLP, we also provide a program layer that allows to compute the explanations via Python, making the tool accessible to a wider audience. We illustrate the capability of reasonx on a synthetic data set, and on a well-developed example in the credit domain. In both cases, we can show how reasonx can be flexibly used and tailored to the needs of the user.

关键词： explainable AI Contrastive Explanations Background Knowledge Interactivity constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Refinement of a typed WAM extension by polymorphic order-sorted types

引用

Formal Aspects of Computing 1996年第5期8卷 539-564页

作者： Beierle, Christoph Börger, Egon Fachbereich Informatik Fern Universität Hagen Hagen Germany Dipartimento di Informatica Università di Pisa Pisa Italy Fachbereich Informatik LG Praktische Informatik VIII Fern Universität Hagen D-58084 Hagen Bahnhofstr. 48 Germany

We refine the mathematical specification of a WAM extension to type-constraint logic programming given in [BeB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic order-sorted unification as required by the logic programming language PROTOS-L, by refining the abstract type constraints used in [BeB96] to the polymorphic order-sorted types of PROTOS-L. This allows us to develop a detailed and mathematically precise account of the PAM's compiled type constraint representation and solving facilities, and to extend the correctness theorem to compilation on the fully specified PAM.

关键词： constraint logic programming Correctness proof Evolving algebras Order-sorted types Polymorphism Types WAM

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Test Case Generation for White-Box Method-Level Unit Testing

Constraint-Based Test Case Generation for White-Box Method-L...

引用

International Computer Symposium (ICS)

作者： Chang, Cheng-Hung Lin, Nai-Wei Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi Taiwan

ISBN: (纸本)9781509034383

This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case consists of a test input and an expected output. The program is automatically transformed into a constraint model called constraint logic graph. The constraint logic graph is a succinct graphical representation of the system of constraints that defines the relationships between the test inputs and actual outputs. The suite of test inputs can be solved from the conjunction of constraints on each complete path of the constraint logic graph by a constraint logic programming language. The specification of a method is defined by the Object constraint Language. This non-executable specification is automatically transformed into an executable specification defined by a constraint logic programming language. This executable specification serves as the test oracle to automatically generate the corresponding expected output for a given test input.

关键词： test case generation white-box testing constraint-based testing constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Evolution of Region Connection Calculus to VRCC-3D+

引用

NEW MATHEMATICS AND NATURAL COMPUTATION 2014年第2期10卷 103-141页

作者： Sabharwal, Chaman L. Leopold, Jennifer L. Missouri Univ S&T Comp Sci Dept Rolla MO 65409 USA

Qualitative spatial reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not available. QSR theories have applications in areas such as geographic information systems, spatial databases, robotics, and cognitive sciences. The existing QSR theories have been applied primarily to 2D. The ability to perform QSR over a collection of 3D objects is desirable in many problem domains. Here we present the evolution (VRCC-3D+) of RCC-based QSR from 2D to both 3D (including occlusion support) and 4D (a temporal component). It is time consuming to construct large composition tables manually. We give a divideand- conquer algorithm to construct a comprehensive composition table from smaller constituent tables (which can be easily handcrafted). In addition to the logical consistency entailment checking that is required for such a system, clearly there is a need for a spatio-temporal component to account for spatial movements and path consistency (i.e. to consider only smooth transitions in spatial movements over time). Visually, these smooth movement phenomena are represented as a conceptual neighborhood graph. We believe that the methods presented herein to detect consistency, refine uncertainty, and enhance reasoning about 3D objects will provide useful guidelines for other studies in automated spatial reasoning.

关键词： Qualitative spatial reasoning region connection calculus composition smooth transition constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Model Transformation Method for Hybrid Approach 38th

Model Transformation Method for Hybrid Approach

引用

38th International Conference on Information Systems Architecture and Technology (ISAT)

作者： Sitek, Pawel Wikarek, Jaroslaw Stefanski, Tadeusz Kielce Univ Technol Inst Management & Control Syst Al 1000 Lecia PP 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319672298;9783319672281

This paper presents a universal model transformation method for the problem which is represented in the form of facts. This method is the key element of the hybrid approach. In this approach, two environments of constraint logic programming (CLP) and mathematical programming (MP) were integrated and hybridized. Hybrid approach is very effective method for modeling and solving different kinds of decision and optimization problems in manufacturing, transportation, logistics etc. These problems are characterized by large numbers of integer variables and constraints, which build a large space of possible solutions. The model transformation method makes it possible to significantly reduce this space even before looking for a solution. The paper also presents an author's illustrative model for variant of CVRP (Capacity Vehicle Routing Problem) and many numerical experiments to test the model transformation method and evaluate its effectiveness when using a hybrid approach.

关键词： constraint logic programming Mathematical programming Hybrid methods CVRP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：