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

25th Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Yang, Yu Stathis, Dimitrios Hemani, Ahmed KTH Royal Inst Technol Sch EECS Stockholm Sweden

ISBN: (纸本)9783981926361

With the growing demand for more efficient hardware accelerators for streaming applications, a novel Coarse-Grained Reconfigurable Architecture (CGRA) that uses a Distributed Two-Level Control (D2LC) system has been proposed in the literature. Even though the highly distributed and parallel structure makes it fast and energy-efficient, the single-issue instruction channel between the level-1 and level-2 controller in each D2LC cell becomes the bottleneck of its performance. In this paper, we improve its design to mimic a multi-issued architecture by inserting shadow instruction buffers between the level-1 and level-2 controllers. Together with a zero-overhead hardware loop, the improved D2LC architecture can enable efficient overlap between loop iterations. We also propose a complete constraint programming based instruction scheduling algorithm to support the above hardware features. The experiment result shows that the improved D2LC architecture can achieve up to 25% of reduction on the instruction execution cycles and 35% reduction on the energy-delay product.

关键词： Loop acceleration Instruction scheduling CGRA Two-level control constraint programming

来源：评论

学校读者我要写书评

暂无评论

UAVs? Dynamic Routing, Subject to Time Windows Variation 14th

UAVs? Dynamic Routing, Subject to Time Windows Variation

引用

14th IFAC Workshop on Intelligent Manufacturing Systems (IMS)

作者： Bocewicz, Grzegorz Radzki, Grzegorz Nielsen, Peter Banaszak, Zbigniew Koszalin Univ Technol Fac Elect & Comp Sci Koszalin Poland Aalborg Univ Dept Mat & Prod Aalborg Denmark

This paper presents a method for the multiple autonomous vehicles mission flight planning in changing weather conditions. We model UAVs fleet servicing spatially-dispersed customers in terms of declarative modelling framework. The considered problem boils down to a predictive and reactive planning of delivery missions within a specified timeframe. Due to the need to implement an emergency return of a UAV to its base, or to handle variations in delivery periods, conditions sufficient to allow eliminating unfeasible solutions, and thus allowing to speed up the calculations, have been developed. The results of numerous computer experiments have confirmed experiments these expectations. Copyright (c) 2022 The *** is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/)

关键词： multiple autonomous vehicles mission flight planning weathercast alternative routing constraint programming

来源：评论

学校读者我要写书评

暂无评论

Overhead-Aware Schedule Synthesis for Logical Execution Time (LET) in Automotive Systems 35

Overhead-Aware Schedule Synthesis for Logical Execution Time...

引用

35th IEEE International System-on-Chip Conference (SOCC)

作者： Lalo, Erjola Sailer, Andreas Mottok, Urgen Siemers, Christian Vector Informatik GmbH D-93053 Regensburg Germany Ostbayer Tech Hsch D-93053 Regensburg Germany Tech Univ Clausthal D-38678 Clausthal Zellerfeld Germany

ISBN: (数字)9781665459853

ISBN: (纸本)9781665459853

The Logical Execution Time (LET) has recently been integrated in multi-core automotive systems to ensure timing and dataflow determinism. Although buffering mechanisms are introduced to incorporate LET semantics, they do not guarantee that tasks are executed within their LET frames. In fact, LET and buffering semantics are violated if scheduling is not designed to execute all tasks within their LET frames and in a specific order. In this paper, we describe a scheduling synthesis technique for Fixed-Priority Scheduling (FPS) to achieve resource-efficient execution of LET systems. The proposed approach considers LET semantics, scheduling overheads, and delays caused by operating system operations and provides the possibility to optimize the schedule with respect to aspects like scheduling overheads. Our performance and feasibility evaluation shows that the proposed algorithm provides results in a reasonable amount of time for models of complex industrial applications. Thus, the integration of the proposed algorithm into an automated process is of high benefit to accelerate the development of vehicle applications.

关键词： schedule synthesis fixed-priority buffering logical execution time overheads constraint programming

来源：评论

学校读者我要写书评

暂无评论

A two-phase approach for the Radiotherapy Scheduling Problem

引用

HEALTH CARE MANAGEMENT SCIENCE 2022年第2期25卷 191-207页

作者： Pham, Tu-San Rousseau, Louis-Martin De Causmaecker, Patrick Polytech Montreal Montreal PQ Canada Katholieke Univ Leuven Leuven Belgium

The Radiotherapy Scheduling Problem (RTSP) focuses on optimizing the planning of radiotherapy treatment sessions for cancer patients. In this paper, we propose a two-phase approach for the RTSP. In the first phase, radiotherapy sessions are assigned to specific linear accelerators (linacs) and days. The second phase then decides the sequence of patients on each day/linac and the specific appointment times. For the first phase, an Integer Linear programming (IP) model is proposed and solved using CPLEX. For the second phase, a Mixed Integer Linear programming (MIP) and a constraint programming (CP) model are proposed. The test data is generated based on real data from CHUM, a large cancer center in Montreal, Canada, with an average of 3,500 new patients and 40,000 radiotherapy treatments per year. The results show that in the second phase, CP is better at finding good solutions quickly while MIP is better at closing optimality gaps with more run time. Lastly, a simulation is conducted to evaluate the impact of different scheduling strategies on the outcome of the scheduling. Preliminary results show that batch scheduling reduces patients' waiting time and overdue time.

关键词： Radiotherapy scheduling Integer programming constraint programming Simulation Operations research

来源：评论

学校读者我要写书评

暂无评论

Abstract Simulation of Reaction Networks via Boolean Networks 20th

Abstract Simulation of Reaction Networks via Boolean Network...

引用

20th International Conference on Computational Methods in Systems Biology (CMSB)

作者： Niehren, Joachim Vaginay, Athenais Versari, Cristian Univ Lille BioComp Team CRIStAL Lab Lille France Inria Lille Lille France Univ Lorraine CNRS CRAN F-54000 Nancy France Univ Lorraine CNRS INRIA LORIA F-54000 Nancy France

ISBN: (纸本)9783031150333;9783031150340

We propose to simulate chemical reaction networks with the deterministic semantics abstractly, without any precise knowledge on the initial concentrations. For this, the concentrations of species are abstracted to Booleans stating whether the species is present or absent, and the derivatives of the concentrations are abstracted to signs saying whether the concentration is increasing, decreasing, or unchanged. We use abstract interpretation over the structure of signs for mapping the ODEs of a reaction network to a Boolean network with nondeterministic updates. The abstract state transition graph of such Boolean networks can be computed by finite domain constraint programming over the finite structure of signs. constraints on the abstraction of the initial concentrations can be added naturally, leading to an abstract simulation algorithm that produces only the part of the abstract state transition graph that is reachable from the abstraction of the initial state. We prove the soundness of our abstract simulation algorithm, and show its applicability to reaction networks in the SBML format from the BioModels database.

关键词： Systems Biology Reaction networks SBML Boolean networks Abstract interpretation Logic constraint programming

来源：评论

学校读者我要写书评

暂无评论

Efficient and Effective Dimension Control in Automotive Applications

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2021年第3期17卷 1583-1591页

作者： Ma, Ye Chen, Gang Lv, Mingsong Yi, Wang Liu, Xue Chen, Hao Zhu, Bo Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Peoples R China Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Peoples R China Uppsala Univ Dept Informat Technol S-75236 Uppsala Sweden McGill Univ Sch Comp Sci Montreal PQ H3A 2A7 Canada BMW Brilliance Automot Ltd Shenyang 110143 Peoples R China

In automotive industry, the production line for assembling mechanical parts of vehicles must place and weld hundreds of components on the right positions of the platform. The accuracy of deploying the components has great impact on the quality and performance of the produced vehicle. To ensure the assembly accuracy, a critical task in the production process is the so-called dimension quality control. The current state of practice in automotive industries is mainly based on a manual process where experienced engineers use production data to identify accuracy problems and suggest solutions for corrections on fixture adjustment in the assembly line. It is an extremely inefficient process, which typically takes the engineers around ten days for one batch of vehicles and a year to achieve the required assembly accuracy for final production. In this article, we present an automatic technique for dimension control. We formulate the dimension control problem as a constraint programming problem and present a refinement method to prune the exploration space. Our technique can not only identify the wrongly deployed parts leading to dimensional defects, but also provide high-quality fixture adjustment decisions. Experiments conducted on industrial production data from BMW Brilliance Automotive demonstrate the significantly improved efficiency and effectiveness of dimension control in automotive industries with our approach.

关键词： Automobiles Automotive engineering Space exploration Process control Industries Welding Car body assembly constraint programming dimension control refinement

来源：评论

学校读者我要写书评

暂无评论

Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource constraint Revisited

引用

Operations Research Forum 2022年第4期3卷 65页

作者： Fetgo Betmbe, Sévérine Djamegni, Clémentin Tayou Department of Mathematics and Computer Science Faculty of Sciences University of Dschang P.O. Box 67 Dschang Cameroon IUT-FV de Bandjoun University of Dschang Dschang Cameroon

The success of constraint programming on scheduling problems comes from the low complexity and power of propagators. The data structure Profile recently introduced by Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, when applied to the edge-finder rule for the cumulative resource constraint (which we call horizontally elastic edge-finder) has improved the filtering power of this rule. In this paper, the algorithm proposed by Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016 is revisited. It is proved that the data structure Profile can be further used for more adjustments. A new formulation of the horizontally elastic edge-finder rule is put forward. Similar to Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, an O(kn²) algorithm (where n is the number of tasks sharing the resource and k≤ n, the number of distinct capacities required by tasks) based on new attributes of the Profile data structure is proposed for the new rule. Experimental results on instances of Resource-Constrained Project Scheduling Problems (RCPSPs) from the benchmark suites highlight that using this new algorithm reduces the number of backtracks for the majority of instances with a slight increase in running time. © 2022, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

关键词： constraint programming Cumulative constraint Edge-Finder Rule Profile RCPSP Scheduling

来源：评论

学校读者我要写书评

暂无评论

Combining DCOP and MILP for Complex Local Optimization Problems 20th

Combining DCOP and MILP for Complex Local Optimization Probl...

引用

20th International Conference of the Italian-Association-for-Artificial-Intelligence (AIxIA)

作者： Fernanda N T Furukita Fernando J M Marcellino Jaime Sichman Univ Sao Paulo Lab Tecn Inteligentes LTI Escola Politecn EP Av Prof Luciano Gualberto 158 Trav 3 BR-05508970 Sao Paulo SP Brazil

ISBN: (纸本)9783031084218;9783031084201

Supply chain management, which is composed of interdependent entities that have defined roles and responsibilities, shows several characteristics in common with Multi-Agent Systems (MAS). This type of problem may be divided into several local subproblems, which can be optimized separately. However, in general, the full problem cannot be solved in a centralized way due to its complexity or the need for information privacy. This work presents a distributed heuristic method which provides an acceptable optimization of this type of complex problem when compared to the centralized approach available for the considered instances, and better than a similar approach in the literature. It is based on modeling the considered problem first as a Distributed constraint Optimization Problem (DCOP), and then by integrating it with Mixed-Integer Linear programming (MILP) optimization models of its subproblems. We have obtained a value which is about 5% better than a similar distributed method in the literature and only about 7% worse than the actual optimum one. We consider a promising approach for increasingly real settings.

关键词： Agent Supply chain constraint programming Optimization

来源：评论

学校读者我要写书评

暂无评论

constraint Modeling for Forest Management

Constraint Modeling for Forest Management

引用

International Conference on Dynamical Control and Optimization(DCO)

作者： Eloy, Eduardo Bushenkov, Vladimir Abreu, Salvador Univ Evora Evora Portugal Univ Evora CIMA Evora Portugal Univ Evora NOVA LINCS Evora Portugal

ISBN: (纸本)9783031175602;9783031175589;9783031175572

Forest management is an activity of prime economic and ecological importance. Managed forest areas can span very large regions and their proper management is paramount to an effective development, in terms both of economic and natural resources planning. A managed activity consists of individual and mutually independent policy choices which apply to distinct patches of land-named stands-which, as a whole, make up the forest area. A forest management plan typically spans a period of time on the order of a century and is normally geared towards the optimisation of economic or environmental metrics (e.g. total wood yield.) In this article we present a method which uses a declarative programming approach to formalise and solve a long-term forest management problem. We do so based on a freely available state-of-the-art constraint programming system, which we extend to naturally express concepts related to the core problem and efficiently compute solutions thereto.

关键词： constraint programming Forest management Spatial restrictions Adjacency constraints

来源：评论

学校读者我要写书评

暂无评论

Optimising the flight turnaround schedules: An improved sliding time windows based on MILP and CP models

引用

COMPUTERS & OPERATIONS RESEARCH 2024年 161卷

作者： Zhang, Sicheng Li, Xiang Yuan, Xing Liu, Jiaming Peng, Jinlin Li, Dongmei China Rongtong Artificial Intelligence Res Ctr Chaoyang 100022 Beijing Peoples R China Changan Univ Sch Econ & Management Xian 710064 Shaanxi Peoples R China Beijing Technol & Business Univ Sch Int Econ & Management Chaoyang 100048 Beijing Peoples R China Natl Inst Def Sci & Technol Innovat Beijing 100071 Peoples R China

This paper addresses the scheduling of turnaround operations for flights in civil airports. A series of complex issues, including the heterogeneity of flights and operators, resource constraints on turnaround operations, temporal restrictions and alternative service patterns of turnaround operations, multi-functional operators, multi-trip services and multi-to-one services, are jointedly considered. We propose two formulations for the problem: A mixed-integer linear programming (MILP) model, and a constraint programming (CP) model. For comparison purpose, we also present simplified versions of the models in which the multi-to-one services are prohibited. The uncertainty are incorporated by modifying the models based on robust optimisation principles. The numerical experiments are conducted using instances generated based on real flight data at Beijing Capital International Airport. It is shown that under current computer configurations, small-scale instances can be solved to the optimum by CPLEX within an acceptable period of time using the MILP model, while moderate-scale instances can be tackled using the CP formulation. To cope with large-scale instances, an improved sliding time window method is developed, and evaluated with different parameter combinations, showing that practical turnaround schedule would best be updated two to three times per hour. Besides, after a case study in both static and stochastic scenarios, we illustrate that multi-to-one services should be specifically considered and highlighted, for their existence could significantly improve the operator utilisation rate and reduce flight delay, especially when the uncertainties are taken into account.

关键词： Flight ground service scheduling Flight turnaround scheduling constraint programming Mixed linear integer programming Airport management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：