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

2024 IEEE Region 10 Conference, TENCON 2024

作者： Rajasekaran, Priyadharshini Moinudeen, Shahul Hamead Haja Sri Sivasubramaniya Nadar College of Engineering India

ISBN: (纸本)9798350350821

Software defined networking enables the programmability of network behaviors. The network resource re-quirements of different services vary with respect to the QoS demands. Network slices created by infrastructure providers logically partition the network and encapsulate the resources demanded by the service providers. In general works in the literature are intended either towards maximizing the resource utilization and QoS or towards maximizing the revenue gained by the infrastructure providers. In this work, we have proposed a reinforcement learning based strategy that maximizes the QoS demanded by service providers and also the revenue factor of infrastructure providers. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

PosSLP and Sum of Squares 44

PosSLP and Sum of Squares

引用

44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024

作者： Blaser, Markus Dorfler, Julian Jindal, Gorav Saarland University Saarland Informatics Campus Saarbrucken Germany Max Planck Institute for Software Systems Saarland Informatics Campus Saarbrucken Germany

ISBN: (纸本)9783959773553

The problem PosSLP is the problem of determining whether a given straight-line program (SLP) computes a positive integer. PosSLP was introduced by Allender et al. to study the complexity of numerical analysis (Allender et al., 2009). PosSLP can also be reformulated as the problem of deciding whether the integer computed by a given SLP can be expressed as the sum of squares of four integers, based on the well-known result by Lagrange in 1770, which demonstrated that every natural number can be represented as the sum of four non-negative integer squares. In this paper, we explore several natural extensions of this problem by investigating whether the positive integer computed by a given SLP can be written as the sum of squares of two or three integers. We delve into the complexity of these variations and demonstrate relations between the complexity of the original PosSLP problem and the complexity of these related problems. Additionally, we introduce a new intriguing problem called Div2SLP and illustrate how Div2SLP is connected to DegSLP and the problem of whether an SLP computes an integer expressible as the sum of three squares. By comprehending the connections between these problems, our results offer a deeper understanding of decision problems associated with SLPs and open avenues for further exciting research. © 2024 Markus Bläser, Julian Dörfler, and Gorav Jindal.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Study of the Neighborhood PCI Planning Problem Based on an integer Planning Model 6

A Study of the Neighborhood PCI Planning Problem Based on an...

引用

6th IEEE International Conference on Civil Aviation Safety and Information Technology, ICCASIT 2024

作者： Cui, Fangqian Zhang, Yuhan Chen, Zhaoda University of Science and Technology College of Resources Shandong Tai'an China Shandong University of Science and Technology College of Finance and Economics Tai'an China Shandong University of Science and Technology Intelligent Equipment College Tai'an China

ISBN: (纸本)9798350389418

In the context of mobile communication networks, the allocation of PCI is directly correlated with the quality of the user experience. Effective PCI allocation can mitigate signal interference and enhance the efficacy of user operations. In this paper, this article first analyse the PCI open source data for 2067 cells in a region. Then we preprocess the data in order to obtain three matrices, and finally establish an integer planning model by combining the processed data and the problem. The decision variables are the corresponding PCI values of 2067 cells. The objective function is the minimum sum of the MR numbers of conflict, confusion and mode 3 interference among 2067 cells. The constraints are that each cell is assigned a PCI value and is in the range of [0,1007], which is taken as an integer. Furthermore, this paper assesses the relationship between the PCI values of two or more cells operating on the same frequency and establishes the corresponding constraints. The sequential quadratic programming algorithm is employed, with the optimization function of MATLAB being invoked to address the optimization problem. The optimal values of the decision variables are identified through continuous iteration, and the optimal PCI values for 2067 cells are ultimately derived. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Reconstructing Rearrangement Phylogenies of Natural Genomes 24

Reconstructing Rearrangement Phylogenies of Natural Genomes

引用

24th International Workshop on Algorithms in Bioinformatics, WABI 2024

作者： Bohnenkämper, Leonard Stoye, Jens Dörr, Daniel Bielefeld University Germany Department for Endocrinology and Diabetology Medical Faculty University Hospital Düsseldorf Heinrich Heine University Düsseldorf Germany Leibniz Institute for Diabetes Research Germany Center for Digital Medicine Heinrich Heine University Düsseldorf Germany

ISBN: (纸本)9783959773409

We study the classical problem of inferring ancestral genomes from a set of extant genomes under a given phylogeny, known as the Small Parsimony Problem (SPP). Genomes are represented as sequences of oriented markers, organized in one or more linear or circular chromosomes. Any marker may appear in several copies, without restriction on orientation or genomic location, known as the natural genomes model. Evolutionary events along the branches of the phylogeny encompass large scale rearrangements, including segmental inversions, translocations, gain and loss (DCJ-indel model). Even under simpler rearrangement models, such as the classical breakpoint model without duplicates, the SPP is computationally intractable. Nevertheless, the SPP for natural genomes under the DCJ-indel model has been studied recently, with limited success. Here, we improve on that earlier work, giving a highly optimized ILP that is able to solve the SPP for sufficiently small phylogenies and gene families. A notable improvement w.r.t. the previous result is an optimized way of handling both circular and linear chromosomes. This is especially relevant to the SPP, since the chromosomal structure of ancestral genomes is unknown and the solution space for this chromosomal structure is typically large. We benchmark our method on simulated and real data. On simulated phylogenies we observe a considerable performance improvement on problems that include linear chromosomes. And even when the ground truth contains only one circular chromosome per genome, our method outperforms its predecessor due to its optimized handling of the solution space. The practical advantage becomes also visible in an analysis of seven Anopheles taxa. © Leonard Bohnenkämper, Jens Stoye, and Daniel Dörr

关键词： ancestral reconstruction double-cut-and-join genome rearrangement integer linear programming small parsimony

来源：评论

学校读者我要写书评

暂无评论

A Study of Channel Coding for Industrial Frequency Communication Systems 9

A Study of Channel Coding for Industrial Frequency Communica...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Kang, Xinyue Teng, Fei Huang, Houzhu Liu, Jian Guo, Xinxin Li, Hui State Grid ChuZhou Power Supply Company Chuzhou China

ISBN: (纸本)9798350376548

In addressing the signal intricacies of industrial frequency communication alongside the complexities of power grid harmonics, the application of digital differential technology for signal detection proves pivotal. This technology effectively mitigates the pervasive harmonic interference within the power grid. Moreover, leveraging various modulation positions enables the proposal of diverse information coding methodologies. By capitalizing on the orthogonal properties inherent to each channel, simultaneous transmission across multiple channels is achieved. Furthermore, considering the nuanced characteristics of non-integer harmonics, a meticulous selection process identifies the channel exhibiting the lowest noise level for transmission, thereby ensuring the reliability and robustness of the transmission process. This comprehensive approach not only enhances the integrity of industrial frequency communication but also underscores the significance of strategic technological interventions in mitigating power grid harmonics and optimizing transmission efficacy. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Does Subset Sum Admit Short Proofs? 35

Does Subset Sum Admit Short Proofs?

引用

35th International Symposium on Algorithms and Computation, ISAAC 2024

作者： Wlodarczyk, Michal University of Warsaw Poland

ISBN: (纸本)9783959773546

We investigate the question whether Subset Sum can be solved by a polynomial-time algorithm with access to a certificate of length poly(k) where k is the maximal number of bits in an input number. In other words, can it be solved using only few nondeterministic bits? This question has motivated us to initiate a systematic study of certification complexity of parameterized problems. Apart from Subset Sum, we examine problems related to integer linear programming, scheduling, and group theory. We reveal an equivalence class of problems sharing the same hardness with respect to having a polynomial certificate. These include Subset Sum and Boolean linear programming parameterized by the number of constraints. Secondly, we present new techniques for establishing lower bounds in this regime. In particular, we show that Subset Sum in permutation groups is at least as hard for nondeterministic computation as 3Coloring in bounded-pathwidth graphs. © Michal Wlodarczyk.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Unraveling Latch Locking Using Machine Learning, Boolean Analysis, and ILP 24

Unraveling Latch Locking Using Machine Learning, Boolean Ana...

引用

24th International Symposium on Quality Electronic Design (ISQED)

作者： Chen, Dake Zhou, Xuan Hu, Yinghua Zhang, Yuke Yang, Kaixin Rittenbach, Andrew Nuzzo, Pierluigi Beerel, Peter A. Univ Southern Calif Los Angeles CA 90007 USA USC Informat Sci Inst Marina Del Rey CA USA

ISBN: (纸本)9798350334753

Logic locking has become a promising approach to provide hardware security in the face of a possibly insecure fabrication supply chain. While many techniques have focused on locking combinational logic (CL), an alternative latch-locking approach in which the sequential elements are locked has also gained significant attention. Latch (LAT) locking duplicates a subset of the flip-flops (FF) of a design, retimes these FFs and replaces them with latches, and adds two types of decoy latches to obfuscate the netlist. It then adds control circuitry (CC) such that all latches must be correctly keyed for the circuit to function correctly. This paper presents a two-phase attack on latch-locked circuits that uses a novel combination of deep learning, Boolean analysis, and integer linear programming (ILP). The attack requires access to the reverse-engineered netlist but, unlike SAT attacks, is oracle-less, not needing access to the unlocked circuit or correct input/output pairs. We trained and evaluated the attack using the ISCAS'89 and ITC'99 benchmark circuits. The attack successfully identifies a key that is, on average, 96.9% accurate and fully discloses the correct functionality in 8 of the tested 19 circuits and leads to low function corruptibility (less than 4%) in 3 additional circuits. The attack run-times are manageable.

关键词： hardware security logic locking oracle-less attack machine learning integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Combined Layout Optimization of Wind Farm and Cable Connection on Complex Terrain Using a Genetic Algorithm 23

Combined Layout Optimization of Wind Farm and Cable Connecti...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Kiribuchi, Daiki Hatakeyama, Ryoko Otsuki, Tomoshi Yoshioka, Tatsuya Konno, Kana Matsuda, Takumi Toshiba Co Ltd Kawasaki Kanagawa Japan Toshiba Energy Syst & Solut Corp Kawasaki Kanagawa Japan

ISBN: (纸本)9798400701191

To improve the economic efficiency of wind farms, this paper proposes a method for simultaneously optimizing wind farm layout and cabling on complex terrain such as mountainous areas, which most previous studies have not considered. Multiple wind turbines should be placed to maximize energy production while minimizing the cable length (between wind turbines and between the substation and wind turbines). To optimize both, especially on complex terrain where wind speeds at a site are not constant, the proposed method combines a genetic algorithm (NSGA-II) and a capacitated minimum spanning tree approximation algorithm (Esau-Williams algorithm). For five sites with complex terrain, the proposed method is compared with the exact optimal solution obtained by the weighted sum method using the integer linear programming formulation. For a small number of candidate locations, the proposed method obtains a hyper-volume equivalent to the exact solution. In comparison, the proposed method can obtain a larger hyper-volume even in the case of many candidate locations where the weighted sum method is computationally infeasible in terms of practical resources and time. These results indicate that the proposed method effectively contributes to the wind farm design on complex terrain.

关键词： wind farm layout optimization cable connection layout optimization multi-objective optimization NSGA-II capacitated minimum spanning tree integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Algorithmic upper bounds for graph geodetic number

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2022年第4期30卷 1221-1237页

作者： Anaqreh, Ahmad T. G-Toth, Boglarka Vinko, Tamas Univ Szeged Inst Informat Szeged Hungary

Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it belongs to the path covering problems: what is the minimal-cardinality set of vertices, such that all shortest paths between its elements cover every vertex of the graph. Inspired by the exact 0-1 integer linear programming formalism from the recent literature, we propose new method to obtain upper bounds for the geodetic number in an algorithmic way. The efficiency of these algorithms are demonstrated on a collection of structurally different graphs.

关键词： Geodetic number integer linear programming Upper bound Greedy heuristic

来源：评论

学校读者我要写书评

暂无评论

A TWO-PHASE OPTIMIZATION METHOD FOR THE EXPANSION PLANNING OF DISTRICT HEATING SYSTEMS USING DIFFERENT DISCRETIZATION TECHNIQUES 37

A TWO-PHASE OPTIMIZATION METHOD FOR THE EXPANSION PLANNING O...

引用

37th International Conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems, ECOS 2024

作者： Lambert, Jerry Spliethoff, Hartmut Technical University of Munich Energy Systems Munich Germany

ISBN: (纸本)9798331307660

The current high costs of district heating systems set limits regarding the minimum heat demand density required for economic network *** routing with ideal pipe sizing offers a potential for cost ***, this paper introduces a two-phase method for district heating network expansion *** method consists of consecutive optimizations, starting with a mixed-integer linear programming followed by a nonlinear *** the mixed-integer linear programming, the district heating system is optimized with continuous diameters, and the nonlinear pressure and temperature dependencies must be *** resulting topology and the continuous diameters are afterward handed over to a nonlinear sparse sequential quadratic *** this second phase, the continuous diameters have to be *** study investigates a rational approximation of material properties and a tangent hyperbolic penalization *** versions of these methods with varying diameter ranges (two and three available diameters) and penalization directions are *** results of this study indicate that methods without changing penalization methods within the same optimization problem provide higher accuracy in the discretization of the pipe's ***, if the accuracy of the discretized diameter should be emphasized during the optimization, penalization methods considering only two diameters should be preferred over penalization methods considering three ***-versa, if obtaining the lowest possible diameters is prioritized over the accuracy of the discretization, methods considering three diameters should be preferred. © 2024 37th International Conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems, ECOS 2024. All rights reserved.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：