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

Optimization based on the minimum maximal k-partial-matching problem of finite states machines with input multiplexing

引用

DESIGN AUTOMATION FOR EMBEDDED SYSTEMS 2022年第2期26卷 83-103页

作者： Garcia-Vargas, Ignacio Senhadji-Navarro, Raouf Univ Seville Dept Comp Architecture & Technol ETS Ingn Informat Avda Reina Mercedes S-N Seville 41012 Spain

Finite State Machines with Input Multiplexing (FSMIMs) were proposed in previous work as a technique for efficient mapping Finite State Machines (FSMs) into ROM memory. In this paper, we present new contributions to the optimization process involved in the implementation of FSMIMs in Field Programmable Gate Array (FPGA) devices. This process consists of two stages: (1) the simplification of the bank of input selectors of the FSMIM, and (2) the reduction of the depth of the ROM. This has a significant impact both on the number of used Look-Up Tables (LUTs) and on the number of the Embedded Memory Blocks (EMBs) required by the ROM. For the first stage, we present two approaches to optimize FSMIM implementations based on the Minimum Maximal k-Partial Matching (MMKPM) problem: one of them applies the greedy algorithm for the MMKPM problem, and the other based on a new multiobjetive variant of the MMKPM and its corresponding integer linear Programing formulation. We also propose a modification of the second stage, in which the characteristics of EMBs are taken into account to improve implementation results. The new optimization process significantly reduces the number of used FPGA resources with respect to the previous one. In addition, the proposed approaches achieve an adequate trade-off between the usage of EMBs and LUTs with respect to conventional FSM implementations based on ROM and to those based on LUT.

关键词： Finite state machine Finite state machine with Input multiplexing FPGA ROM integer linear programming Minimum maximal k-partial-matching

来源：评论

学校读者我要写书评

暂无评论

Uniform Approximation by Polynomials with integer Coefficients via the Bernstein Lattice 20th

Uniform Approximation by Polynomials with Integer Coefficien...

引用

20th Combinatorial and Additive Number Theory, New York Number Theory Seminar, CANT 2022 and 21st Combinatorial and Additive Number Theory, New York Number Theory Seminar, CANT 2023

作者： Sinan Güntürk, C. Li, Weilin NYU Courant Institute New YorkNY United States CUNY City College New YorkNY United States

ISBN: (纸本)9783031650635

Let (Formula Presented) be the metric space of real-valued continuous functions on [0, 1] with integer values at 0 and 1, equipped with the uniform (supremum) metric d∞. It is a classical theorem in approximation theory that the ring (Formula Presented) of polynomials with integer coefficients, when considered as a set of functions on [0, 1], is dense in (Formula Presented). In this paper, we offer a strengthening of this result by identifying a substantially small subset (Formula Presented) which is still dense in (Formula Presented)). Here Bn, which we call the "Bernstein lattice," is the lattice generated by the polynomials (Formula Presented) where ω f. stands for the modulus of continuity of f. We also offer a more general bound which can be optimized to yield better decay of approximation error for specific classes of continuous functions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Integration of FDIR Practices in Distribution Optimal Network Reconfiguration Routines 24

Integration of FDIR Practices in Distribution Optimal Networ...

引用

24th EEEIC International Conference on Environment and Electrical Engineering and 8th I and CPS Industrial and Commercial Power Systems Europe, EEEIC/I and CPS Europe 2024

作者： Cometa, Roberto Nasab, Mohammad Rajabi Lorusso, Francesco Velini, Angelo La Scala, Massimo Bruno, Sergio Politecnico di Bari Dei Bari Italy

ISBN: (纸本)9798350355185

The adoption of optimal network reconfiguration (ONR) tools is crucial in enhancing the operational efficiency, security and reliability of smart distribution grids, since ONR can be used to ensure grid integrity and quality of supply among end-users. However, in order to improve ONR applicability in a SCADA/DMS framework, the actual practices in fault detection, isolation, and recovery (FDIR) must be taken into account. For this reason, this paper proposes a ONR formulation, based on Mixed-integer linear programming, aimed at optimizing quality of supply indicators, while respecting connectivity and radiality constraints, together with other constraints on selectivity and coordination of protection devices. In order to validate its feasibility in a realistic scenario, the proposed approach has been tested on the model of an actual primary distribution grid which supplies energy to about 60,000 inhabitants and 30,000 customers in the South of Italy. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Load Restoration Approach in Biogas Powered Microgrid 4

Load Restoration Approach in Biogas Powered Microgrid

引用

4th IEEE International Conference on Sustainable Energy and Future Electric Transportation, SEFET 2024

作者： Verma, Shubham Sharma, Ankush Bajpai, Prabodh Indian Institute of Technology Department of Electrical Engineering Uttar Pradesh Kanpur208016 India

ISBN: (纸本)9798350383997

This study addresses the critical need for a robust approach to load restoration in an active distribution network (ADN), with a focus on the utilization of Bio-Gas Plants (BGPs) as revival resources. The increasing occurrence of network outages due to various factors highlights the critical importance of an effective load restoration approach in an ADN. As distribution networks evolve towards distributed generation, characterized by a significant presence of inverter-based resources (IBRs). Building on these observations, this research explores the potential of BGPs for restoring loads in ADN. Then, formulate a lindist-flow model converted into Mixed integer linear programming (MILP), employing the Gurobi solver for efficient solutions. A case study conducted on the modified IEEE-13 node distribution test feeder validates the proposed approach, providing valuable insights into the integration of BGPs as revival units (RU) in the dynamic landscape of ADN. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Backward Dynamic programming Approach to Solve the Unit Commitment Problem Based on a Day Load Curve 9th

Backward Dynamic Programming Approach to Solve the Unit Comm...

引用

9th International Conference on Advances in Energy Research, ICAER 2023

作者： Sahu, Dibya Ranjan Mohanty, Sanjeeb Department of Electrical Engineering National Institute of Technology Odisha Sundergarh Rourkela India

ISBN: (纸本)9789819754144

Unit commitment is generally used to schedule the units so as to minimize the cost of the production for the total system across the scheduled time horizon under generator operational constraints. The unit commitment problem is non-linear and a mixed-integer type combinatorial optimization problem. We can obtain the global optimal solution by complete listing which cannot be possible for large power systems due to its requirements for excessive computational time. Unit commitment presents a methodology to reduce cost and improve the system reliability. Unit commitment is a dynamic process, and power production planning changes as per loads and topologies of the network. The problem is solved by backward dynamic programming approach which solves the dynamic problem in 12 stages. This paper deals with a unit commitment problem that is solved using backward dynamic programming without time constraints, and outcomes show minimum cumulative total cost for operating 4 units in 12 stages for a 24-h horizon based on a load curve of a day. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A GNSS Anti-Interference integer Float Solution Based on LAMBDA integer Transform

A GNSS Anti-Interference Integer Float Solution Based on LAM...

引用

2024 International Conference on Smart Transportation Interdisciplinary Studies, ICSTIS 2024

作者： Li, Zhuotong Yu, Xianwen Southeast University School of Transportation China Southeast University China

GNSS is an important means that can provide high-precision navigation and positioning information for intelligent driving. In complex urban environments, after briefly losing the GNSS signal, it takes initialization time for a vehicle to regain high-precision positioning information. Therefore, shortening the initialization time is an important step in providing real-time continuous navigation and positioning services for intelligent driving. The integer float estimator solution has the advantage of free initialization, which can greatly reduce the convergence time of ambiguity fixing. However, its positioning error may show a sudden increase under poor observation conditions. Aiming at the problem that the integer float estimator may be interfered with, this paper proposes an anti-interference integer float estimator method for GNSS based on the LAMBDA integer transform. This paper draws on the idea of integer transform-down correlation in the LAMBDA method to do integer transform-down correlation on the float solution and variance matrix of the original ambiguity and positioning solution. Then the error in the ambiguity vector is identified and constrained based on the transformed variance matrix. If it can pass the test, the original integer float estimator calculation method is maintained, otherwise, the transformed ambiguity, positioning solution, and the corresponding variance matrices are filtered and brought into the original integer float estimator formula to calculate the positioning result. The method achieves the purpose of improving precision by filtering the coarseness and reducing the interference of coarseness on ambiguity. The proposed method is validated by the measured data, and the example results show that the method effectively weakens the error and improves the stability of the positioning results, and the spatial true error and RMSE of 3D positioning are improved by 16.1% and 14.7%, respectively, compared with the original integer float estim

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optical Front/Mid-Haul With Open Access-Edge Server Deployment Framework for Sliced O-RAN

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2022年第3期19卷 3202-3219页

作者： Mondal, Sourav Ruffini, Marco Univ Dublin Trinity Coll Dublin CONNECT Ctr Future Networks & Commun Dublin D02 PN40 2 Ireland

The fifth-generation of mobile radio technologies is expected to be agile, flexible, and scalable while provisioning ultra-reliable and low-latency communication (uRLLC), enhanced mobile broadband (eMBB), and massive machine type communication (mMTC) applications. An efficient way of implementing these is by adopting cloudification, network function virtualization, and network slicing techniques with open-radio access network (O-RAN) architecture where the base-band processing functions are disaggregated into virtualized radio unit (RU), distributed unit (DU), and centralized unit (CU) over front/mid-haul interfaces. However, cost-efficient solutions are required for designing front/mid-haul interfaces and time-wavelength division multiplexed (TWDM) passive optical network (PON) appears as a potential candidate. Therefore, in this paper, we propose a framework for the optimal placement of RUs based on long-term network statistics and connecting them to open access-edge servers for hosting the corresponding DUs and CUs over front/mid-haul interfaces while satisfying the diverse QoS requirements of uRLLC, eMBB, and mMTC slices. In turn, we formulate a two-stage integer programming problem and time-efficient heuristics for users to RU association and flexible deployment of the corresponding DUs and CUs. We evaluate the O-RAN deployment cost and latency requirements with our TWDM-PON-based framework against urban, rural, and industrial areas and show its efficiency over the optical transport network (OTN)-based framework.

关键词： Optical network units 5G mobile communication Servers Cloud computing Ultra reliable low latency communication Passive optical networks Computer architecture Beyond 5G Open-RAN front mid-haul network integer linear programming network slicing TWDM-PON

来源：评论

学校读者我要写书评

暂无评论

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年第1期44卷 557-582页

作者： Martin, Mateus Yanasse, Horacio Hideki Salles-Neto, Luiz Leduino Univ Fed Fluminense Escola Engn Petropolis Dept Engn Prod Rua Domingos Silverio 135 BR-25650050 Petropolis RJ Brazil Univ Fed Sao Paulo Inst Ciencia & Tecnol Ave Cesare Mansueto Giulio Lattes 1201 BR-12247014 Sao Jose Dos Campos SP Brazil

The one-dimensional cutting stock problem with setup cost (CSP-S) is a cutting problem that seeks a cutting plan with a minimum number of objects and a minimum number of different patterns. This problem gains relevance in manufacturing settings, where time consuming operations to set up the knives of the cutting machine for the new patterns increases production costs. In this paper, we aim at solving the bi-objective CSP-S that analyzes the trade-offs between the number of objects and the number of patterns. We first derive an upper bound on the maximum frequency of a pattern in the cutting plan. Then, we propose a pattern-based pseudo-polynomial integer linear programming (ILP) formulation for the CSP-S. To obtain the Pareto optimal frontier, this formulation is embedded into a straightforward framework which solves the problem of minimizing the number of objects subject to a limited number of patterns in an iterative manner. Since we are not aware of other approaches in the literature that have solved the bi-objective CSP-S exactly, we derive an ILP formulation based on Harjunkoski et al. (Comput Chem Eng 20:121-126, 1996. https://***/10.1016/0098-1354(96)00031-2) into this framework to provide an alternative exact approach. The results of the computational experiments using a general-purpose ILP solver indicated that the approaches are proper for instances with solutions characterized by a moderate number of objects and a few patterns in the Pareto optimal frontier.

关键词： Cutting and packing Cutting stock problem Setup cost integer linear programming Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Controller Placement Model by Distributing Switch Load among Multiple Controllers in Software-Defined Network

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2022年第5期E105B卷 533-544页

作者： Kotachi, Seiki Sato, Takehiro Shinkuma, Ryoichi Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

One of the features of a software-defined network (SDN) is a logically centralized control plane hosting one or more SDN controllers. As SDN controller placement can impact network performance, it is widely studied as the controller placement problem (CPP). For a cost-effective network design, network providers need to minimize the number of SDN controllers used in the network since each SDN controller incurs installation and maintenance costs. Moreover, the network providers need to deal with the failure of SDN controllers. Existing studies that consider SDN controller failures use the scheme of connecting each SDN switch to one Master controller and one or more Slave controllers. The problem with this scheme is that the computing capacity of each SDN controller cannot be used efficiently since one SDN controller handles the load of all SDN switches connected to it. The number of SDN controllers required can be reduced by distributing the load of each SDN switch among multiple SDN controllers. This paper proposes a controller placement model that allows the distribution against SDN controller failures. The proposed model determines the ratios of computing capacity demanded by each SDN switch on the SDN controllers connected to it. The proposed model also determines the number and placement of SDN controllers and the assignment of each SDN switch to SDN controllers. Controller placement is determined so that a network provider can continue to manage all SDN switches if no more than a certain number of SDN controller failures occur. We develop two load distribution methods: split and even-split. We formulate the proposed model with each method as integer linear programming problems. Numerical results show that the proposed model reduces the number of SDN controllers compared to a benchmark model;the maximum reduction ratio is 38.8% when the system latency requirement between an SDN switch and an SDN controller is 100 [ms], the computing capacity of each SDN controlle

关键词： software-defined network controller controller placement problem integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints

引用

IEEE ACCESS 2022年 10卷 110849-110861页

作者： Fujita, Kohei Ushio, Toshimitsu Mitsubishi Electr Corp Adv Technol Res & Dev Ctr Amagasaki Hyogo 6618661 Japan Osaka Univ Grad Sch Engn Sci Toyonaka Osaka 5608531 Japan

A coloured Petri net (CPN) is widely used to model discrete event systems due to its compact representation of the system by colour sets associated with places, transitions and I/O arcs. For real-world systems such as manufacturing systems, transportation systems, and communication protocols, a coloured timed Petri net (CTPN) is proposed to model timed behaviours. To control a discrete event system with a desired control specification, it is important to describe the control specification formally. For the CPN, a class of specification called coloured generalized mutual exclusion constraints (cGMEC) is utilized to specify the behaviours. However, cGMEC can only represent safety constraints and not temporal constraints. Therefore, in this paper, we propose a novel temporal logic based constraint called a coloured generalized mutual exclusion temporal constraint (cGMETC). The cGMETC is described by a signal temporal logic (STL) formula where each atomic predicate represents a cGMEC. We propose a method for optimal control of the CTPN under a given cGMETC. In particular, we formulate an optimal control problem and solve the problem by transforming it into an integer linear programming problem. Through a simulation of an optimal control problem of a manufacturing system, we demonstrate the effectiveness of the proposed approach.

关键词： Petri nets integer linear programming Manufacturing systems Optimal control Safety Discrete-event systems Job shop scheduling Petri nets coloured timed Petri nets temporal logic generalized mutual exclusion constraints integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：