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

State prediction using LSTM with optimized PMU deployment against DoS attacks

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2022年第6期42卷 5957-5971页

作者： Wang, Chunye Sun, Jian Xu, Xiaoxin Zou, Bin Zhang, Min Tang, Yang Zeng, Min Southwest Univ Sch Elect & Informat Engn Chongqing Peoples R China State Grid Chongqing Elect Power Co Chongqing Peoples R China

The denial-of-service (DoS) attacks block the communications of the power grids, which affects the availability of the measurement data for monitoring and control. In order to reduce the impact of DoS attacks on measurement data, it is essential to predict missing measurement data. Predicting technique with measurement data depends on the correlation between measurement data. However, it is impractical to install phasor measurement units (PMUs) on all buses owing to the high cost of PMU installment. This paper initializes the study on the impact of PMU placement on predicting measurement data. Considering the data availability, this paper proposes a scheme for predicting states using the LSTM network while ensuring system observability by optimizing phasor measurement unit (PMU) placement. The optimized PMU placement is obtained by integer programming with the criterion of the node importance and the cost of PMU deployment. There is a strong correlation between the measurement data corresponding to the optimal PMU placement. A Long-Short Term Memory neural network (LSTM) is proposed to learn the strong correlation among PMUs, which is utilized to predict the unavailable measured data of the attacked PMUs. The proposed method is verified on an IEEE 118-bus system, and the advantages compared with some conventional methods are also illustrated.

关键词： integer linear programming DoS attacks deep learning state prediction

来源：评论

学校读者我要写书评

暂无评论

The Tight Upper Bound for the Size of Single Deletion Error Correcting Codes of Length 11 18

The Tight Upper Bound for the Size of Single Deletion Error ...

引用

18th International Symposium on Information Theory and Its Applications, ISITA 2024

作者： Nakasho, Kazuhisa Hagiwara, Manabu Anderson, Austin Nation, J.B. Graduate School of Science and Technology for Innovation Yamaguchi University Ube Japan Graduate School of Science Chiba University Chiba Japan Kapi'olani Community College Math and Sciences Honolulu United States University of Hawaii Department of Mathematics Honolulu United States

ISBN: (纸本)9784885523519

A single deletion error correcting code (SDECC) over binary alphabet is a set of fixed-length sequences consisting of two types of symbols, 0 and 1, such that the original sequence can be recovered for at most one deletion error. There is a conjecture 'the upper bound for the size of SDECC is equal to the size of Varshamov- Tenengolts (VT) code.' This conjecture had been shown to be true when the code length is ten or less. In this paper, we discuss a method for calculating this upper bound by providing an integer linear programming solver with several linear constraints. As a new result, we obtained that the tight upper bound for the size of a single deletion error correcting code of length 11 is 172. In other words, we could prove that the conjecture is true for the case where the length is 11. © 2024 The Institute of Electronics, Information and Communication Engineers.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Analytically Determining the Robustness of Binarized Neural Networks 23

Analytically Determining the Robustness of Binarized Neural ...

引用

23rd IEEE International Conference on Machine Learning and Applications, ICMLA 2024

作者： Alzahrani, Sahar M. Schewe, Sven Huang, Chao Huang, Xiaowei University of Liverpool Department of Computer Science Liverpool United Kingdom College of Computing and Informatics Saudi Electronic University Riyadh Saudi Arabia University of Southampton Department of Computer Science Southampton United Kingdom

ISBN: (纸本)9798350374889

Binarized neural networks (BNNs) are a class of deep neural networks (DNNs) known for their minimal computational requirements during inference, making them ideal for low-performance environments. Despite their efficiency, BNNs are as vulnerable to safety and security issues as other types of DNNs, and hence analyzing their robustness is essential. In contrast to general DNNs, BNNs are relatively small and straightforward, making it feasible to assess their robustness analytically. We propose a method for rigorously analyzing BNN robustness based on 0-1 integer linear programming (0-1 ILP), which utilizes the dual functionality of boolean variables within BNNs as both boolean (with values of 'true' and 'false') and real-valued variables constrained to binary values (0 and 1). By leveraging this duality, we formalize the robustness problem as a linear programming problem augmented with boolean reasoning. We minimize the distance to a differently classified image using either the L1-norm (binarized and non-binarized inputs) or the Lœ-norm (non-binarized inputs). We have implemented our approach using the Z3 solver and evaluated it on the MNIST and FashionMNIST datasets. Our results demonstrate the capability to construct optimal adversarial examples with minimal deviations from the ground truth images. We achieved a one-pixel difference between the original and perturbed images for all binarized images. We also identified minimal perturbations on grayscale images using the L1 and Lœ-norms. For the latter, we simplified the analysis to determine the existence of epsilon-close adversarial examples across a range of epsilon values. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimization Study of Sorting Center Volume Prediction Based on LSTM and Simulated Annealing Algorithm 3

Optimization Study of Sorting Center Volume Prediction Based...

引用

3rd International Conference on Data Analytics, Computing and Artificial Intelligence, ICDACAI 2024

作者： Wu, Zhiyi Nanjing Forestry University Nanjing China

ISBN: (纸本)9798331519032

This study focuses on the problem of cargo volume prediction and employee scheduling optimisation in the sorting centre of e-commerce logistics network. By establishing an LSTM-based cargo volume time series prediction model and a linear integer planning staff scheduling model, combined with an annealing simulation algorithm, accurate cargo volume prediction and staff scheduling optimisation are achieved in the sorting centre. The results show that effective cargo volume forecasting and staff scheduling strategies can significantly improve the operational efficiency and reduce the cost of e-commerce logistics network. This study provides effective decision support and guidance for the optimisation of e-commerce logistics network. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On lattice point counting in Δ-modular polyhedra

引用

OPTIMIZATION LETTERS 2022年第7期16卷 1991-2018页

作者： Gribanov, D., V Zolotykh, N. Yu Natl Res Univ Higher Sch Econ 25-12 Bolshaja Pecherskaja Ulitsa Nizhnii Novgorod 603155 Russia Lobachevsky State Univ Nizhni Novgorod Math Future Technol Ctr 23 Gagarin Ave Nizhnii Novgorod 603950 Russia

Let a polyhedron P be defined by one of the following ways: (i) P={x is an element of R-n:Ax <= b}, where A is an element of Z((n+k)xn), b is an element of Z((n+k)) and rankA=n, (ii) P={x is an element of R-+(n): Ax=b}, where A is an element of Z(kxn), b is an element of Z(k) and rankA=k, and let all rank order minors of A be bounded by Delta in absolute values. We show that the short rational generating function for the power series Sigma(xm)(m is an element of P boolean AND Zn) can be computed with the arithmetical complexity O(T-SNF(d) center dot d(k) center dot d(log2 Delta)), where k and Delta are fixed, d = dim P, and T-SNF(m) is the complexity of computing the Smith Normal Form for m xm integer matrices. In particular, d = n, for the case (i), and d = n - k, for the case (ii). The simplest examples of polyhedra that meet the conditions (i) or (ii) are the simplices, the subset sum polytope and the knapsack or multidimensional knapsack polytopes. Previously, the existence of a polynomial time algorithm in varying dimension for the considered class of problems was unknown already for simplicies (k = 1). We apply these results to parametric polytopes and show that the step polynomial representation of the function c(P)(y) = |P-y boolean AND Z(n)|, where P-y is a parametric polytope, whose structure is close to the cases (i) or (ii), can be computed in polynomial time even if the dimension of P-y is not fixed. As another consequence, we show that the coefficients e(i) (P, m) of the Ehrhart quasi-polynomial |mP boolean AND Z(n)| = Sigma(n)(j=0) e(j) (P, m)m(j) can be computed with a polynomial-time algorithm, for fixed k and Delta.

关键词： integer linear programming Short rational generating function Bounded minors Ehrhart quasi-polynomial Step polynomial Parametric polytope Unbounded knapsack problem Multidimensional knapsack problem Subset sum problem

来源：评论

学校读者我要写书评

暂无评论

Query-focused multi-document text summarization using fuzzy inference

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2022年第5期42卷 4641-4652页

作者： Agarwal, Raksha Chatterjee, Niladri Indian Inst Technol Delhi Dept Math Delhi 110016 India

The present paper proposes a fuzzy inference system for query-focused multi-document text summarization (MTS). The overall scheme is based on Mamdani Inferencing scheme which helps in designing Fuzzy Rule base for inferencing about the decision variable from a set of antecedent variables. The antecedent variables chosen for the task are from linguistic and positional heuristics, and similarity of the documents with the user-defined query. The decision variable is the rank of the sentences as decided by the rules. The final summary is generated by solving an integer linear programming problem. For abstraction coreference resolution is applied on the input sentences in the pre-processing step. Although designed on the basis of a small set of antecedent variables the results are very promising.

关键词： Query-focused text summarization mamdani fuzzy inference text similarity fuzzy ranking integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On the Discovery of Conceptual Clustering Models Through Pattern Mining 27

On the Discovery of Conceptual Clustering Models Through Pat...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Hassine, Motaz Ben Jabbour, Saïd Kmimech, Mourad Raddaoui, Badran Graiet, Mohamed CRIL University of Artois CNRS Lens France University of Monastir UR-OASIS-ENIT Monastir Tunisia EFREI Paris-Panthéon-Assas University France SAMOVAR Télécom SudParis Institut Polytechnique de Paris France LS2N Nantes Nantes France

ISBN: (纸本)9781643685489

Conceptual clustering is a well-studied research area in the field of unsupervised machine *** aims to identify disjoint clusters, where each cluster represents a collection of similar transactions described by a common *** first phase of earlier conceptual clustering methods relies on the enumeration of closed ***, the extraction of such patterns can be challenging, primarily due to their rigorous ***, closed patterns can be not frequent or fail to cover all the transactions within a *** overcome this issue, this paper presents a novel approach based on the relaxation of frequent patterns called k-relaxed frequent ***, we introduce a propositional satisfiability method for enumerating such ***, we employ an integer linear programming approach to compute the set of disjoint ***, we demonstrate the efficiency of our approach through an extensive experiments conducted on several popular real-life datasets. © 2024 The Authors.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On solving the order processing in picking workstations

引用

OPTIMIZATION LETTERS 2022年第1期16卷 5-35页

作者： Ouzidan, Abdessamad Sevaux, Marc Olteanu, Alexandru-Liviu Pardo, Eduardo G. Duarte, Abraham Univ Bretagne Sud Lab STICC UMR 6285 CNRS Lorient France Univ Rey Juan Carlos Dept Comp Sci Madrid Spain

The Order Processing in Picking Workstations is a real problem derived from the industry in the context of supply chain management. It looks for an efficient way to process orders arriving to a warehouse by minimizing the number of movements of goods, stored in containers in the warehouse, from their storage location to the processing zone. In this paper, we tackle this real optimization problem by providing a new integer linear programming (ILP) formulation for the problem. Due to the NP-Hardness of the problem we have also designed several heuristic procedures, to find high-quality solutions in a reasonable amount of time, which is mandatory for handling real instances. Particularly, the heuristics proposed were combined into a General Variable Neighborhood Search algorithm. Finally, we have performed an extensive experimentation indicating an increased performance of our proposals (ILP and heuristic) over previous approaches in the state of the art, using both synthetic and real datasets of instances.

关键词： Order picking Parts to picker integer linear programming Variable Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

Graceful Coloring is Computationally Hard 11th

Graceful Coloring is Computationally Hard

引用

11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025

作者： Antony, Cyriac Antony, Jacob Laavanya, D. Devi Yamini, S. IIT Madras Chennai India Mahatma Gandhi University Kottayam India Vellore Institute of Technology Chennai India

ISBN: (纸本)9783031834370

Given a (proper) vertex coloring f of a graph G, where f:V(G)→N, the difference edge labeling induced by f is a function h:E(G)→N defined as h(uv)=|f(u)-f(v)| for every edge uv of G. A graceful coloring of G is a vertex coloring f of G such that the difference edge labeling h induced by f is a (proper) edge coloring of G. A graceful coloring with co-domain {1,2,⋯,k} is called a graceful k-coloring. The least integer k such that G admits a graceful k-coloring is called the graceful chromatic number of G, denoted by χg(G). We prove that χ(G2)≤χg(G)≤a(χ(G2)) for every graph G, where a(n) denotes the nth term of the integer sequence A065825 in OEIS. We also prove that graceful coloring problem is NP-hard for planar bipartite graphs, regular graphs and 2-degenerate graphs. In particular, we show that for each k≥5, it is NP-complete to check whether a planar bipartite graph of maximum degree k-2 is graceful k-colorable. The complexity of checking whether a planar graph is graceful 4-colorable remains open. We show that graceful 4-colorability of chordal graphs is polynomial-time testable. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Research on Bid Decision-making Strategy of Independent Energy Storage in Primary Frequency Regulation Market 8

Research on Bid Decision-making Strategy of Independent Ener...

引用

8th IEEE International Conference on Energy Internet, ICEI 2024

作者： Xue, Wenhao Lv, Quan Qi, Chu Mu, Xianmin Zeng, Fanpeng Fang, Zhuangzhi Dalian University of Technology School of Electrical Engineering Dalian China Jiangsu Linyang Energy Co. Ltd Technical Department Nanjing China

ISBN: (纸本)9798331523558

In the context of the rapid increase in renewable energy penetration and the continuous development of the marketization of ancillary services in the power sector, energy storage systems (ESS) participating as independent market participants in the primary frequency regulation (PFR) ancillary services market is an effective means to alleviate the insufficient PFR capability of the power grid. This paper proposes a mileage calculation model for PFR utilizing historical frequency data. Furthermore, a PFR cost calculation model is presented, including cycle life costs and charge-discharge loss costs. Based on these models, a bidding decision model is developed for independent energy storage systems participating in the PFR market, accounting for the uncertainty of PFR clearing prices. To address the non-linear issues within this bidding decision model, a linearization method is employed, transforming the non-linear problem into a mixed-integer linear programming (MILP) problem for collaborative optimization. Finally, the effectiveness of the proposed bidding decision model is validated through case studies. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：