In ToSC'20, a new approach combining Mix-Integer Linear programming (MILP) tool and constraint programming (CP) tool to search for boomerang distinguishers is proposed and later used for rebound attack in ASIACRYP...
详细信息
ISBN:
(纸本)9783031230196;9783031230202
In ToSC'20, a new approach combining Mix-Integer Linear programming (MILP) tool and constraint programming (CP) tool to search for boomerang distinguishers is proposed and later used for rebound attack in ASIACRYPT'21 and CRYPTO'22. In this work, we extend these techniques to mount collision attacks on SKINNY-128-256 MMO hashing mode in classical and quantum settings. The first results of 17-round (and 15-round) free-start collision attack on this variant of SKINNY hashing mode are presented. Moreover, one more round of the inbound phase is covered leading to the best existing classical free-start collision attack of 19-round on the SKINNY-128-384 MMO hashing.
Across the world, cardiovascular diseases (CVD) are among the leading causes of death. In Iran, it is estimated that about 46% of all the reported deaths is related to CVD. This article focuses on the patient scheduli...
详细信息
Across the world, cardiovascular diseases (CVD) are among the leading causes of death. In Iran, it is estimated that about 46% of all the reported deaths is related to CVD. This article focuses on the patient scheduling practices of a private cardiology clinic in Iran. Several complaints from the patients and staff members of the clinic are reviewed. The study shows that the patients in the clinic are classified into six major groups;the steps each group must undergo in the clinic as well as the time related to each operation is measured. A constraint programming model is developed to schedule the patients and rectify the complaints. Computational results based on 30 days of actual data from the clinic reveals that the proposed model manages to significantly improve the efficiency measures and is successful in resolving the causes of complaints. Furthermore, the developed constraint programming generates optimum solutions in a rather short amount of time. Copyright (C) 2022 The Authors.
Traditional approaches to fairness in operations research and social choice, such as the egalitarian/Rawlsian, the utilitarian or the proportional-fair rule implicitly assume that the voters' utility functions are...
详细信息
ISBN:
(数字)9783031080111
ISBN:
(纸本)9783031080111;9783031080104
Traditional approaches to fairness in operations research and social choice, such as the egalitarian/Rawlsian, the utilitarian or the proportional-fair rule implicitly assume that the voters' utility functions are - to a certain degree - comparable. Otherwise, statements such as "maximize the worst-off voter's utility" or "maximize the sum of utilities" are void. But what if the different valuations should truly not be compared or converted into each other? Voting theory only relies on ordinal information and can help to provide democratic rules to define winning solutions. Copeland's method is a well-known generalization of the Condorcet criterion in social choice theory and asks for an outcome that has the best ratio of pairwise majority duel wins to losses. If we simply ask for a feasible solution to a combinatorial problem that maximizes the Copeland score, we are at risk to encounter intractability (due to having to explore all solutions) or suffer from (the lack of) irrelevant alternatives. We present first results from optimizing for a Copeland winner to a constraint problem formulated in MiniZinc in a local search fashion based on a changing solution pool. We investigate the effects of diversity constraints on the quality of the estimated Copeland score as well as the gap between the best reported Copeland scores to the actual Copeland scores.
Terrain analysis in Real-Time Strategy games is a necessary step to allow spacial reasoning. The goal of terrain analysis is to gather and process data about the map topology and properties to have a qualitative spati...
详细信息
ISBN:
(数字)9781665467087
ISBN:
(纸本)9781665467087
Terrain analysis in Real-Time Strategy games is a necessary step to allow spacial reasoning. The goal of terrain analysis is to gather and process data about the map topology and properties to have a qualitative spatial representation. On StarCraft games, all previous works on terrain analysis propose a crisp analysis based on connected component detection, Voronoi diagram computation and pruning, and region merging. Those methods have been implemented as game-specific libraries, and they can only offer the same kind of analysis for all maps and all users. In this paper, we propose a way to consider terrain analysis as a combinatorial optimization problem. Our method allows different kinds of analysis by changing constraints or the objective function in the problem model. We also present a library, TAUNT, implementing our method and able to handle both StarCraft 1 and StarCraft 2 maps. This makes our library a universal tool for StarCraft bots with different spatial representation needs. We believe our library unlocks the possibility to have real adaptive AIs playing StarCraft, and can be the starting point of a new wave of bots.
The Tokeneer project was an initiative set forth by the National Security Agency (NSA, USA) to be used as a demonstration that developing highly secure systems can be made by applying rigorous methods in a cost-effect...
详细信息
The Tokeneer project was an initiative set forth by the National Security Agency (NSA, USA) to be used as a demonstration that developing highly secure systems can be made by applying rigorous methods in a cost-effective manner. Altran UK was selected by NSA to carry out the development of the Tokeneer ID Station. The company wrote a Z specification later implemented in the SPARK Ada programming language, which was verified using the SPARK Examiner toolset. In this paper, we show that the Z specification can be readily and naturally encoded in the {log} set constraint language, thereby generating a functional prototype. Furthermore, we show that {log}'s automated proving capabilities can discharge all the proof obligations concerning state invariants as well as important security properties. As a consequence, the prototype can be regarded as correct with respect to the verified properties. This provides empirical evidence that Z users can use {log} to generate correct prototypes from their Z specifications. In turn, these prototypes enable or simplify some verification activities discussed in the paper.
Bipartite b-matching is a classical model that is used for utility maximization in various applications such as marketing, healthcare, education, and general resource allocation. Multi-attribute diverse weighted bipar...
详细信息
ISBN:
(纸本)9783031080111;9783031080104
Bipartite b-matching is a classical model that is used for utility maximization in various applications such as marketing, healthcare, education, and general resource allocation. Multi-attribute diverse weighted bipartite b-matching (MDWBM) balances the quality of the matching with its diversity. The recent paper by Ahmadi et al. (2020) introduced the MDWBM but presented an incorrect mixed integer quadra-tic program (MIQP) and a flawed local exchange algorithm. In this work, we develop two constraint programming (CP) models, a binary quadratic programming (BQP) model, and a quadratic unconstrained binary optimization (QUBO) model for both the unconstrained and constrained MDWBM. A thorough empirical evaluation using commercial solvers and specialized QUBO hardware shows that the hardware-based QUBO approach dominates, finding best-known solutions on all tested instances up to an order of magnitude faster than the other approaches. CP is able to achieve better solutions than BQP on unconstrained problems but under-performs on constrained problems.
Motivated by Boeing 777 fully autonomous upright build project, orchestration of human and robotic agents are studied. Tasks must be precisely allocated, sequenced, and coordinated among agents subject to temporal and...
详细信息
Motivated by Boeing 777 fully autonomous upright build project, orchestration of human and robotic agents are studied. Tasks must be precisely allocated, sequenced, and coordinated among agents subject to temporal and spatial constraints. The problem is formulated as a flexible job shop with sequence-dependent setup to capture heterogeneous agents and travel time. Two exact central approaches are proposed: a mixed integer programming and a constraint programming, and tested for real-time perspective. The computational study demonstrates the proposed method can generate optimal schedules up to 100 agents with 1000 subtasks that requires 10 subtasks per agent on average, within 183 seconds, a substantial improvement over all other benchmark approaches in the literature.
U-shaped assembly lines are widely encountered in contemporary JIT systems. Unlike presumptions of deterministic studies, task times may vary according to a probability distribution. In this study, a stochastic U-type...
详细信息
U-shaped assembly lines are widely encountered in contemporary JIT systems. Unlike presumptions of deterministic studies, task times may vary according to a probability distribution. In this study, a stochastic U-type assembly line balancing problem (ALBP) is considered. For this purpose, two new chance-constrained nonlinear models are proposed. While the first model belongs to the mixed-integer programming (MIP) category, the other is constraint programming (CP). The linearized chance-constrained counterparts are developed using a transformation approach to reduce the model complexity and solve the models linearly. Several numerical experiments are performed to test the effectiveness of the proposed models. The results are compared with the results of modified ant colony optimization and a piecewise-linear programming model. The numerical results demonstrate that the proposed CP and MIP models are more effective and successful in solving stochastic U-type ALBP.
This paper focuses on designing a diameter - constrained network where the maximum distance between any pair of nodes is bounded. The objective considered is to minimise a weighted sum of the total length of the links...
详细信息
This paper focuses on designing a diameter - constrained network where the maximum distance between any pair of nodes is bounded. The objective considered is to minimise a weighted sum of the total length of the links followed by the total length of the paths between the pairs of nodes. First, the problem is formulated in terms of Mixed Integer Linear programming and constraint programming to provide two alternative exact approaches. Then, an adaptive large neighbourhood search (LNS) to overcome memory and runtime limitations of the exact methods in large size instances is proposed. Such approach is based on computing an initial solution and repeatedly improve it by solving relatively small subproblems. We investigate various alternatives for finding an initial solution and propose two different heuristics for selecting subproblems. We have introduced a tighter lower bound, which demonstrates the quality of the solution obtained by the proposed approach. The performance of the proposed approach is assessed using three real-world network topologies from Ireland, UK and Italy, which are taken from national telecommunication operators and are used to design a transparent optical core network. Our results demonstrate that the LNS approach is scalable to large networks and it can compute very high quality solutions that are close to being optimal.
The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities with profits being associated with pairs of items packed into the same knapsack. This prob...
详细信息
The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities with profits being associated with pairs of items packed into the same knapsack. This problem has been solved by various heuristics since its inception, and more recently it has also been solved with an exact method. We introduce a generalization of this problem that includes pairwise conflicts as well as balance constraints, among other particularities. We present and compare constraint programming and integer programming approaches for solving this generalized problem. Summary of Contribution: The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities - with profits being associated with pairs of items packed into the same knapsack. This problem has been solved by various heuristics since its inception, and more recently it has also been solved with an exact method. We introduce a generalization of this problem which includes pairwise conflicts as well as balance constraints, among other particularities. We present and compare constraint programming and integer programming approaches for solving this generalized problem. The problem we address is clearly in the core of the operations research applications in which subsets have to be built and, in particular, we add the concept of fairness to the modeling and solution process by computationally evaluating techniques to take fairness into account. This is clearly at the core of computational evaluation of algorithms.
暂无评论