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

31st International Conference on logic programming (ICLP) Co-located with the 21st International Conference on Principles and practice of Constraint programming (CP)

作者： Prestwich, Steven D. Rossi, Roberto Tarim, S. Armagan Natl Univ Ireland Univ Coll Cork Insight Ctr Data Analyt Cork Ireland Univ Edinburgh Sch Business Edinburgh Midlothian Scotland Cankaya Univ Dept Management Ankara Turkey

ISBN: (纸本)9783319232195;9783319232188

Some optimisation problems require a random-looking solution with no apparent patterns, for reasons of fairness, anonymity, undetectability or unpredictability. Randomised search is not a good general approach because problem constraints and objective functions may lead to solutions that are far from random. We propose a constraint-based approach to finding pseudo-random solutions, inspired by the Kolmogorov complexity definition of randomness and by data compression methods. Our "entropy constraints" can be implemented in constraint programming systems using well-known global constraints. We apply them to a problem from experimental psychology and to a factory inspection problem.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining 21st

PREFIX-PROJECTION Global Constraint for Sequential Pattern M...

引用

31st International Conference on logic programming (ICLP) Co-located with the 21st International Conference on Principles and practice of Constraint programming (CP)

作者： Kemmar, Amina Loudni, Samir Lebbah, Yahia Boizumault, Patrice Charnois, Thierry Univ Oran 1 EPSECG Oran LITIO Oran Algeria Univ Caen GREYC CNRS UMR 6072 F-14032 Caen France Univ Paris 13 LIPN CNRS UMR 7030 F-93430 Villetaneuse France

ISBN: (纸本)9783319232195;9783319232188

Sequential pattern mining under constraints is a challenging data mining task. Many efficient ad hoc methods have been developed for mining sequential patterns, but they are all suffering from a lack of genericity. Recent works have investigated Constraint programming (CP) methods, but they are not still effective because of their encoding. In this paper, we propose a global constraint based on the projected databases principle which remedies to this drawback. Experiments show that our approach clearly outperforms CP approaches and competes well with ad hoc methods on large datasets.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

Spatial Symmetry Driven Pruning Strategies for Efficient Declarative Spatial Reasoning 12th

Spatial Symmetry Driven Pruning Strategies for Efficient Dec...

引用

12th International Conference on Spatial Information theory (COSIT)

作者： Schultz, Carl Bhatt, Mehul Univ Munster Inst Geoinformat D-48149 Munster Germany Univ Bremen Dept Comp Sci D-28359 Bremen Germany DesignSpace Grp Bremen Germany

ISBN: (纸本)9783319233741;9783319233734

Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR) based methods (e. g., logic programming and derivatives). One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i. e. the theory of real-closed fields). We present a new algorithm, implemented within the declarative spatial reasoning system CLP(QS), that drastically improves the performance of deciding the consistency of spatial constraint graphs over conventional polynomial encodings. We develop pruning strategies founded on spatial symmetries that form equivalence classes (based on affine transformations) at the qualitative spatial level. Moreover, pruning strategies are themselves formalised as knowledge about the properties of space and spatial symmetries. We evaluate our algorithm using a range of benchmarks in the class of contact problems, and proofs in mereology and geometry. The empirical results show that CLP(QS) with knowledge-based spatial pruning outperforms conventional polynomial encodings by orders of magnitude, and can thus be applied to problems that are otherwise unsolvable in practice.

关键词： Declarative spatial reasoning Geometric reasoning logic programming Knowledge representation and reasoning

来源：评论

学校读者我要写书评

暂无评论

A Practical Introduction to Fuzzy logic using LISP

引用

2015年

作者： Luis Argelles Mndez

ISBN: (纸本)9783319231853

This book makes use of the LISP programming language to provide readers with the necessary background to understand and use fuzzy logic to solve simple to medium-complexity real-world problems. It introduces the basics of LISP required to use a Fuzzy LISP programming toolbox, which was specifically implemented by the author to teach the theory behind fuzzy logic and at the same time equip readers to use their newly-acquired knowledge to build fuzzy models of increasing complexity. The book fills an important gap in the literature, providing readers with a practice-oriented reference guide to fuzzy logic that offers more complexity than popular books yet is more accessible than other mathematical treatises on the topic. As such, students in first-year university courses with a basic tertiary mathematical background and no previous experience with programming should be able to easily follow the content. The book is intended for students and professionals in the fields of computer science and engineering, as well as disciplines including astronomy, biology, medicine and earth sciences. Software developers may also benefit from this book, which is intended as both an introductory textbook and self-study reference guide to fuzzy logic and its applications. The complete set of functions that make up the Fuzzy LISP programming toolbox can be downloaded from a companion books website.

关键词：

来源：评论

学校读者我要写书评

暂无评论

18th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2015 Held as Part of the European Joint Conferences on theory and practice of Software, ETAPS 2015

18th International Conference on Foundations of Software Sci...

引用

18th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2015 Held as Part of the European Joint Conferences on theory and practice of Software, ETAPS 2015

ISBN: (纸本)9783662466773

The proceedings contain 38 papers. The special focus in this conference is on Semantics of programming Languages, Categorical Models, Temporal logics and Timed Systems. The topics include: Synthesis of strategies and the Hoare logic of angelic nondeterminism;game semantics and normalization by evaluation;a categorical semantics for linear logical frameworks;coalgebraic trace semantics via forgetful logics;on the total variation distance of semi-Markov chains;decidable and expressive classes of probabilistic automata;compositional metric reasoning with probabilistic process calculi;fragments of ml decidable by nested data class memory automata;step-indexed logical relations for probability;robust multidimensional mean-payoff games are undecidable;three variables suffice for real-time logic;on presburger arithmetic extended with modulo counting quantifiers;programming and reasoning with guarded recursion for coinductive types;the computational contents of ramified corecurrence and on the mints hierarchy in first-order intuitionistic logic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solving Project Scheduling with Calendars 21st

Modeling and Solving Project Scheduling with Calendars

引用

31st International Conference on logic programming (ICLP) Co-located with the 21st International Conference on Principles and practice of Constraint programming (CP)

作者： Kreter, Stefan Schutt, Andreas Stuckey, Peter J. Tech Univ Clausthal Inst Management & Econ Operat Res Grp D-38678 Clausthal Zellerfeld Germany Natl ICT Australia Optimisat Res Grp Melbourne Vic Australia Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia

ISBN: (纸本)9783319232195;9783319232188

Resource-constrained project scheduling with the objective of minimizing project duration (RCPSP) is one of the most studied scheduling problems. In this paper we consider the RCPSP with general temporal constraints and calendar constraints. Calendar constraints make some resources unavailable on certain days in the scheduling period and force activity execution to be delayed while resources are unavailable. They arise in practice from, e.g., unavailabilities of staff during public holidays and weekends. The resulting problems are challenging optimization problems. We develop not only four different constraint programming (CP) models to tackle the problem, but also a specialized propagator for the cumulative resource constraints taking the calendar constraints into account. This propagator includes the ability to explain its inferences so it can be used in a lazy clause generation solver. We compare these models, and different search strategies on a challenging set of benchmarks using a lazy clause generation solver. We close 83 of the open problems of the benchmark set, and show that CP solutions are highly competitive with existing Mip models of the problem.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

A Global Constraint for a Tractable Class of Temporal Optimization Problems 21st

A Global Constraint for a Tractable Class of Temporal Optimi...

引用

31st International Conference on logic programming (ICLP) Co-located with the 21st International Conference on Principles and practice of Constraint programming (CP)

作者： Derrien, Alban Fages, Jean-Guillaume Petit, Thierry Prud'homme, Charles TASC CNRS INRIA Mines Nantes F-44307 Nantes France COSLING SAS F-44307 Nantes France WPI Foisie Sch Business Worcester MA 01609 USA

ISBN: (纸本)9783319232195;9783319232188

This paper is originally motivated by an application where the objective is to generate a video summary, built using intervals extracted from a video source. In this application, the constraints used to select the relevant pieces of intervals are based on Allen's algebra. The best state-of-the-art results are obtained with a small set of ad hoc solution techniques, each specific to one combination of the 13 Allen's relations. Such techniques require some expertise in Constraint programming. This is a critical issue for video specialists. In this paper, we design a generic constraint, dedicated to a class of temporal problems that covers this case study, among others. ExistAllen takes as arguments a vector of tasks, a set of disjoint intervals and any of the 2(13) combinations of Allen's relations. ExistAllen holds if and only if the tasks are ordered according to their indexes and for any task at least one relation is satisfied, between the task and at least one interval. We design a propagator that achieves bound-consistency in O(n + m), where n is the number of tasks and m the number of intervals. This propagator is suited to any combination of Allen's relations, without any specific tuning. Therefore, using our framework does not require a strong expertise in Constraint programming. The experiments, performed on real data, confirm the relevance of our approach.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

24th European Symposium on programming, ESOP 2015 Held as Part of the European Joint Conferences on theory and practice of Software, ETAPS 2015

引用

24th European Symposium on programming, ESOP 2015 held as part of the European Joint Conferences on theory and practice of Software, ETAPS 2015

ISBN: (纸本)9783662466681

The proceedings contain 35 papers. The special focus in this conference is on programming Languages and Systems. The topics include: Static analysis of spreadsheet applications for type-unsafe operations detection;running probabilistic programs backwards;a verified compiler for probability density functions;segment abstraction for worst-case execution time analysis;automatic static cost analysis for parallel programs;sound, modular and compositional verification of the input/output behavior of programs;unrestricted termination and non-termination arguments for bit-vector programs;combining navigational and pattern matching approaches;the problem of PL concurrency semantics;trading efficiency and optimality in fence insertion for TSO;specifying and verifying concurrent algorithms with histories and subjectivity;automatically generating well-typed terms from the definition of a type-system;refinement types for incremental computational complexity;monotonic references for efficient gradual typing;inter-procedural two-variable herbrand equalities;desynchronized multi-state abstractions for open programs in dynamic languages;fine-grained detection of privilege escalation attacks on browser extensions;analysis of asynchronous programs with event-based synchronization;a new approach to practical complete predicate refinement;propositional reasoning about safety and termination of heap-manipulating programs;concurrent local subjective logic;a separation logic for fictional sequential consistency;binding structures as an abstract data type and type-based allocation analysis for co-recursion in lazy functional languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Recovery for Enterprise Services 9

Distributed Recovery for Enterprise Services

引用

9th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Clark, Shane S. Beal, Jacob Pal, Partha Raytheon BBN Technol Cambridge MA 02138 USA

ISBN: (纸本)9781467375351

Small-to medium-scale enterprise systems are typically complex and highly specialized, but lack the management resources that can be devoted to large-scale (e.g., cloud) systems, making them extremely challenging to manage. Here we present an adaptive algorithm for addressing a common management problem in enterprise service networks: safely and rapidly recovering from the failure of one or more services. Due to poorly documented and shifting dependencies, a typical industry practice for this situation is to bring the entire system down, then to restart services one at a time in a predefined order. We improve on this practice with the Dependency-Directed Recovery (DDR) algorithm, which senses dependencies by observing network interactions and recovers near-optimally from failures following a distributed graph algorithm. Our Java-based implementation of this system is suitable for deployment with a wide variety of networked enterprise services, and we validate its correct operation and advantage over fixed-order restart with emulation experiments on networks of up to 20 services.

关键词： computer networks graph theory small-to-medium enterprises DDR algorithm dependency-directed recovery algorithm distributed graph algorithm enterprise service recovery management resources networked enterprise services small-to medium-scale enterprise system Databases Electronic mail logic gates Monitoring Reliability Servers Sockets aggregate programming distributed algorithms enterprise systems protelis Power outlets Socket electronic mail distributed algorithms computer network logic gates Servers Graph theory management of resources Database Legal Services small and medium enterprises Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

编制顺序功能图的技巧与三种实现方法

引用

机械工程师 2016年第5期 129-132页

作者：陈青艳武汉软件工程职业学院武汉430205

在《机电设备电气控制系统安装与维护》的理实一体化课程开发中,学生很容易编制一般顺序控制系统的梯形图,但是顺序控制系统的结构变复杂时,自身调试非常不方便且绝大部分学生理不清内在的逻辑性而不能编制出梯形图,达不到机电设备的自... 详细信息

在《机电设备电气控制系统安装与维护》的理实一体化课程开发中,学生很容易编制一般顺序控制系统的梯形图,但是顺序控制系统的结构变复杂时,自身调试非常不方便且绝大部分学生理不清内在的逻辑性而不能编制出梯形图,达不到机电设备的自动控制要求。针对上述问题,采用FX系列的PLC编程,结合复杂并行序列结构的顺序控制系统实例,首先详尽阐述了顺序功能图(SFC)的组成、动作过程和绘制顺序功能图的注意事项;然后在顺序功能图的基础上,依次使用SFC功能编程、"启保停电路"编程和置位复位指令编程三种方法对结构复杂的顺序控制系统进行编程,为理实一体化课程开发和提高高职院校教师教学水平提供一定的参考价值。

关键词：顺序功能图(SFC) 理实一体化课程开发 FX系列 PLC编程方法

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：