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

A multi-criteria logical based approach for optimal planning and assessment of rule-based hybrid load following micro combined heat and power systems

引用

ENERGY CONVERSION AND MANAGEMENT 2021年 243卷 114338-114338页

作者： Mohammadi, Hesam Mohammadi, Mohammad Shiraz Univ Sch Elect & Comp Engn Dept Power & Control Engn Shiraz Iran

This study presents a logical based approach with constraint programming technique for applying rule-based hybrid strategies in the optimal planning of the micro cogeneration systems. Moreover, in this paper, a novel operation strategy that relied on the comparison of loss of supply probabilities for reducing the dependency on auxiliary systems and minimizing the production of redundant energy in micro cogeneration systems is also introduced. The presented approach is applied to evaluate the effectiveness of five operation strategies namely two basic, two common hybrid and the proposed hybrid strategy under three single optimization criteria for the total annual cost (TAC), primary energy consumption (PEC) and greenhouse gas generation (GHG) as well as one integrated criterion based on Utopia tracking method for the combination of these criteria. Three energy matching parameters are exploited to assess the performance of each strategy in matching the cogenerated energy carriers with the building demand requirements. The analysis of the obtained results for four types of residential buildings indicates that the common hybrid strategy which maximizes the exploitation of cogeneration system, and the proposed strategy as the most suitable strategies for integrated criterion have been able to achieve the best compromise solutions with over 55%, 14% and 9% reductions in TAC, PEC and GHG respectively. While the proposed strategy can achieve higher reductions for TAC (up to 4.6%) as well as higher overall performance for energy matching (up to 2.5%) with the same limitations bounds for GHG and PEC in comparison to this common hybrid strategy. By analyzing the model uncertainties, the feed-in tariff for power generation with near 60% decrement in TAC is found as the most dominant economic parameter for sensitivity analysis while the capacity of the micro cogeneration unit with over 3% increment is detected as the most affected outcome for stochastic analysis.

关键词： Micro cogeneration Logic-based optimization framework constraint programming Hybrid operation strategy Utopia tracking method Energy matching performance

来源：评论

学校读者我要写书评

暂无评论

Towards a Social-media Driven Multi-Drone Tasking platform

Towards a Social-media Driven Multi-Drone Tasking platform

引用

International Conference on Unmanned Aircraft Systems (ICUAS)

作者： Terzi, Maria Kolios, Panayiotis Panayiotou, Christos Theocharides, Theocharis Univ Cyprus KIOS Res & Innovat Ctr Excellence KIOS CoE CY-1678 Nicosia Cyprus Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus

ISBN: (纸本)9781728142784

We present a framework for utilising social-media for tasking drone swarms in search and rescue missions. As elaborated in this work, social-media are a source of timely and valuable information regarding the occurrence, the evolution and the damage produced in disasters. Exploiting this source of knowledge can be very valuable in planning search and rescue missions and identifying tasks to be conducted. In this work a novel multi-drone search and rescue framework is developed that considers social-media signals in the creation of search tasks. The key design challenges of implementing the proposed framework are discussed and a simulated scenario based on a real-life Twitter data set is presented as a means of providing evidence of the effectiveness of the proposed framework.

关键词： Multi-agent systems constraint programming emergency response UAS swarms social sensing

来源：评论

学校读者我要写书评

暂无评论

Automatic Demirci-Selcuk Meet-in-the-Middle Attack on SKINNY with Key-Bridging 21st

Automatic Demirci-Selcuk Meet-in-the-Middle Attack on SKINNY...

引用

21st International Conference on Information and Communications Security (ICICS)

作者： Chen, Qiu Shi, Danping Sun, Siwei Hu, Lei Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing Peoples R China Chinese Acad Sci Data Assurance & Commun Secur Res Ctr Beijing Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing Peoples R China

ISBN: (纸本)9783030415792;9783030415785

Demirci-Selcuk meet-in-the-middle (DS - MITM) attack is an effective and generic method for analyzing iterative block ciphers. It reaches the best results on attacking AES in the single-key model. In ASIACRYPT 2018, a tool for finding VS - MITM attack automatically based on general constraint programming was put forward, which can not only enumerate VS - MITM distinguishers, but also partly automate the key-recovery process. However, the constraint programming models generated by this tool do not consider the key-bridging technique, which has been shown to be effective in reducing the complexities of many cryptanalytic attacks. In this work, we build a general constraint model for SKINNY-128-384 (the same target as the ASIACRYPT 2018 paper) integrated with the key-bridging technique. As a result, the time complexity of the key recovery attack on SKINNY-128-384 is significantly reduced from 2(382)(.)(46) to 2(366)(.)(28).

关键词： Demirci-Selcuk meet-in-the-middle attack constraint programming MILP Key-bridging SKINNY

来源：评论

学校读者我要写书评

暂无评论

Non-overlapping Sequence-Dependent Setup Scheduling with Dedicated Tasks 8th

Non-overlapping Sequence-Dependent Setup Scheduling with Ded...

引用

8th International Conference on Operations Research and Enterprise Systems (ICORES)

作者： Vlk, Marek Novak, Antonin Hanzalek, Zdenek Malapert, Arnaud Charles Univ Prague Fac Math & Phys Dept Theoret Comp Sci & Math Log Prague Czech Republic Czech Tech Univ Czech Inst Informat Robot & Cybernet Prague Czech Republic Czech Tech Univ Fac Elect Engn Dept Control Engn Prague Czech Republic Univ Cote dAzur I3S CNRS Nice France

ISBN: (纸本)9783030375843;9783030375836

The paper deals with a parallel machines scheduling problem with dedicated tasks with sequence-dependent setup times that are subject to the non-overlapping constraint. This problem emerges in the productions where only one machine setter is available on the shop floor. We consider that setups are performed by a single person who cannot serve more than one machine at the same moment, i.e., the setups must not overlap in time. We show that the problem remains NP-hard under the fixed sequence of tasks on each machine. To solve the problem, we propose an Integer Linear programming formulation, five constraint programming models, and a hybrid heuristic algorithm LOFAS that leverages the strength of Integer Linear programming for the Traveling Salesperson Problem (TSP) and the efficiency of constraint programming at sequencing problems minimizing makespan. Furthermore, we investigate the impact of the TSP solution quality on the overall objective value. The results show that LOFAS with a heuristic TSP solver achieves on average 10.5% worse objective values but it scales up to 5000 tasks with 5 machines.

关键词： Constrained setup times constraint programming Hybrid heuristic

来源：评论

学校读者我要写书评

暂无评论

Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP 17th

Discriminating Instance Generation from Abstract Specificati...

引用

17th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Akgun, Ozgur Dang, Nguyen Miguel, Ian Salamon, Andras Z. Spracklen, Patrick Stone, Christopher Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9783030589424;9783030589417

We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate that it is possible to completely automate the search for benchmark instances that help to discriminate between solvers. Our system starts from a high level human-provided problem specification, which is translated into a specification for valid instances. We use the automated algorithm configuration tool Trace to search for instances, which are translated into inputs for both MIP and CP solvers by means of the CONJURE, Savile Row, and MiniZinc tools. These instances are then solved by CPLEX and Chuffed, respectively. We constrain our search for instances by requiring them to exhibit a significant advantage for MIP over CP, or vice versa. Experimental results on four optimisation problem classes demonstrate the effectiveness of our method in identifying instances that highlight differences in performance of the two solvers.

关键词： Instance generation MIP constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint-based Diversification of JOP Gadgets

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2021年 72卷 1471-1505页

作者： Tsoupidi, Rodothea Myrsini Lozano, Roberto Castaneda Baudry, Benoit KTH Royal Inst Technol Stockholm Sweden Univ Edinburgh Edinburgh Midlothian Scotland

Modern software deployment process produces software that is uniform, and hence vulnerable to large-scale code-reuse attacks, such as Jump-Oriented programming (JOP) attacks. Compiler-based diversification improves the resilience and security of software systems by automatically generating different assembly code versions of a given program. Existing techniques are efficient but do not have a precise control over the quality, such as the code size or speed, of the generated code variants. This paper introduces Diversity by Construction (DivCon), a constraint-based compiler approach to software diversification. Unlike previous approaches, DivCon allows users to control and adjust the conflicting goals of diversity and code quality. A key enabler is the use of Large Neighborhood Search (LNS) to generate highly diverse assembly code efficiently. For larger problems, we propose a combination of LNS with a structural decomposition of the problem. To further improve the diversification efficiency of DivCon against JOP attacks, we propose an application-specific distance measure tailored to the characteristics of JOP attacks. We evaluate DivCon with 20 functions from a popular benchmark suite for embedded systems. These experiments show that DivCon's combination of LNS and our application-specific distance measure generates binary programs that are highly resilient against JOP attacks (they share between 0.15% to 8% of JOP gadgets) with an optimality gap of <= 10%. Our results confirm that there is a trade-off between the quality of each assembly code version and the diversity of the entire pool of versions. In particular, the experiments show that DivCon is able to generate binary programs that share a very small number of gadgets, while delivering near-optimal code. For constraint programming researchers and practitioners, this paper demonstrates that LNS is a valuable technique for finding diverse solutions. For security researchers and software engineers, DivCon extend

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A Model-based Synthesis approach to system design correct by construction under environmental impact requirements

引用

Procedia CIRP 2021年 103卷 85-90页

作者： Pierre-Alain Yvars Laurent Zimmer ISAE-Supméca QUARTZ EA7393 3 rue Fernand Hainaut 93407 Saint Ouen Cedex France Dassault Aviation Direction de la prospective 78 quai Marcel Dassault 92552 Saint Cloud France

This paper presents an integrated approach for the preliminary design of complex systems and for the generation of correct by construction system architectures with respect to the requirements to be satisfied. These requirements can be functional and/or non-functional (safety, sustainability ...). The approach presented is complementary to the usual approaches based on system analysis, performance evaluation and optimization. It focuses on the simultaneous consideration of functional and non-functional requirements such as environmental impact. The originality of the approach consists in modeling the design problem rather than the system and then solving the problem in such a way as to obtain necessarily admissible solutions. The DEPS (Design Problem Specification) language is used for modeling the problem. DEPS models are generic and reusable. The DEPS Studio environment is used to edit, compile, debug and solve problems expressed in DEPS. It integrates a mixed constraint programming solver. A case-study of a design of a mechanical power transmission system under functional and environmental requirements illustrates the approach. The DEPS modeling, the problem solving and the results obtained are detailed.

关键词： Model-based approach System Synthesis constraint programming environmental impact requirements

来源：评论

学校读者我要写书评

暂无评论

Practical constraints in the container loading problem: Comprehensive formulations and exact algorithm

引用

COMPUTERS & OPERATIONS RESEARCH 2021年 128卷 105186-105186页

作者： do Nascimento, Oliviana Xavier de Queiroz, Thiago Alves Junqueira, Leonardo Univ Fed Goias Inst Math & Technol Campus Catalao BR-1120 Catalao Go Brazil Univ Sao Paulo Polytech Sch Dept Prod Engn Av Prof Luciano Gualberto 1380 BR-05508010 Sao Paulo SP Brazil

This paper addresses the Single Container Loading Problem. We present an exact approach that considers the resolution of integer linear programming and constraint programming models iteratively. A linear relaxation of the problem based on packing in planes is proposed. Moreover, a comprehensive set of mathematical formulations for twelve practical constraints that arise in this problem are discussed. These constraints include complete shipment, conflicting items, priorities, weight limit, cargo stability, load-bearing, multi-drop, load-balancing, manual loading, grouping, separation, and multiple orientations. Extensive computational experiments are carried out on instances from the literature to show the performance of the proposed approach and state how each practical constraint affects the container?s occupancy, the approach runtime, and the number of packing patterns evaluated. In general, the approach could optimally solve instances with around ten items types and a total of 110 items, besides obtaining the optimal solution for more than 70% of all instances. ? 2020 Elsevier Ltd. All rights reserved.

关键词： Container loading problem Practical constraints Integer linear programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

The generalized flexible job shop scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2021年 160卷 107542-107542页

作者： Boyer, Vincent Vallikavungal, Jobish Cantu Rodriguez, Xavier Angelica Salazar-Aguilar, M. Univ Autonoma Nuevo Leon Grad Program Syst Engn San Nicolas De Los Garza Nuevo Leon Mexico Univ Autonoma Nuevo Leon Sch Phys & Math San Nicolas De Los Garza Nuevo Leon Mexico Univ Autonoma Nuevo Leon Grad Program Informat Technol San Nicolas De Los Garza Nuevo Leon Mexico

In this work, we introduce a generalized flexible job-shop scheduling problem in which, besides the classical constraints of the flexible job shop scheduling problem other hard constraints such as machine capacity, time lags, holding times, and sequence-dependent setup times are taken into account. This problem is inspired by a real situation observed in a seamless rolled ring manufacturer. We propose a mixed integer linear programming (MILP) and a constraint programming (CP) models to represent the problem. Additionally, we develop a metaheuristic based on a Greedy Randomized Adaptive Search Procedure (GRASP) able to tackle efficiently large instances of the problem. The results show that CP outperforms the MILP and the proposed GRASP outperforms the CP when solving instances with more than 100 jobs.

关键词： Flexible job-shop scheduling problem constraint programming Time lag constraints Machine capacity Holding times

来源：评论

学校读者我要写书评

暂无评论

Experiments with Declarative Modeling of Maximum Clique Problem Using Solvers Supported by MiniZinc 24

Experiments with Declarative Modeling of Maximum Clique Prob...

引用

24th International Conference on System Theory, Control and Computing (ICSTCC)

作者： Muraretu, Ionut Badica, Costin Univ Craiova Dept Comp & Informat Technol Craiova Romania

ISBN: (纸本)9781728198095

In this paper, we present the results of solving the Maximum Clique Problem using declarative modeling approaches. Our goal is to create a single reusable model that can be utilized to compare several solvers supported by MiniZinc. For the comparison, we have used data sets from the DIMACS benchmarks. We present the performance results of the solvers used in experiments using single as well as 16-threaded configurations on data set instances of 125, 250, 500, 1000, and 2000 nodes. Our initial results revealed that the Gurobi solver handles the small data sets better than the Gecode or COIN-OR, but the Gecode solver is better over the larger data sets. We found that COIN-OR was not able to find a solution for data sets of more than 500 nodes, on the single thread configuration, within our chosen time limit of 120s.

关键词： maximum clique declarative modeling constraint programming mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：