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

Recognizing integrality of weighted rectangles partitions

JOURNAL OF COMBINATORIAL OPTIMIZATION 2025年第2期49卷 1-15页

作者： Deuker, Paul Friedrich, Ulf Tilburg Univ Dept Econometr & Operat Res Tilburg Netherlands Otto Guericke Univ Magdeburg Fac Math Magdeburg Germany

Given a grid of active and inactive pixels, the weighted rectangles partitioning (WRP) problem is to find a maximum-weight partition of the active pixels into rectangles. WRP is formulated as an integer programming problem and instances with an integral relaxation polyhedron are characterized by a balanced problem matrix. A complete characterization of these balanced instances is proved. In addition, computational results on balancedness recognition and on solving WRP are presented.

关键词： Partition problem Rectangles Integer programming balanced matrix

来源：评论

学校读者我要写书评

暂无评论

Lightweight Coordinated Sampling for Dynamic Flows under Budget Constraints 33

Lightweight Coordinated Sampling for Dynamic Flows under Bud...

引用

33rd IEEE International Conference on Computer Communications and Networks (ICCCN)

作者： Chen, Mingming La Porta, Thomas Jaeger, Trent Krishnamurthy, Srikanth Penn State Univ Comp Sci & Engn Dept University Pk PA 16802 USA Univ Calif Riverside Comp Sci & Engn Dept Riverside CA 92521 USA

ISBN: (纸本)9798350348439;9798350384611

As cyber-attacks on networks become more stealthy, monitoring techniques relying on low-rate packet sampling may prove insufficient to detect attacks. While various sampling methods have been proposed to address capacity limitations and enhance detection rates, achieving sampling at line speed at a single point remains challenging due to limited CPU or bandwidth capacity at sampling points. In this paper, we propose harnessing coordinating sampling across switches to create a unified system that can dynamically activate sampling points to meet sampling rate needs. We introduce and implement a coordinated sampling algorithm on multiple P4-programmable switches and show that the algorithm ensures coordination among multiple sampling points for each flow, preventing duplicate samples, with negligible network overhead and real-time configurability. We formulate sampling point placement as budgeted maximum multi-coverage problems, solving them optimally in pseudo-polynomial time. We show our system far outperforms those based on greedy algorithms along many key dimensions.

关键词： P4-programmable switch coordinated sampling budgeted maximum multi-coverage balanced matrix

来源：评论

学校读者我要写书评

暂无评论

Label Guided Discrete Hashing for Cross-Modal Retrieval

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第12期23卷 25236-25248页

作者： Lan, Rushi Tan, Yu Wang, Xiaoqin Liu, Zhenbing Luo, Xiaonan Guilin Univ Elect Technol Guangxi Key Lab Image & Graph Intelligent Proc Guilin 541004 Peoples R China Guilin Univ Elect Technol Nanning Res Inst Guilin 541004 Peoples R China Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China

Due to their low storage capacity and fast retrieval speed, hashing techniques have received much attention in crossmodal retrieval. However, there are some issues that need to be further explored. First, some existing hashing methods use the labels to construct the semantic similarity matrix between pairwise data, ignoring the potential manifold structure between heterogeneous data. Second, some existing methods underestimate the importance of multi-label and the gaps between different class labels, making the learned hash codes less discriminative. Third, few of them embed both manifold and balanced structures within the same model, and the relaxation of discrete constraints will lead to an increasing quantization error. To mitigate these problems, this paper proposes a novel supervised hashing method, termed Label Guided Discrete Hashing (LGDH), which simultaneously preserves the comprehensive manifold structure and discriminative balanced codes that are both constructed by label information into Hamming space. We develop a local category distribution of the nearest neighbors, to excavate the underlying manifold structure of heterogeneous data. To maximize the gaps of different categories, a balanced matrix is constructed by labels to generate hash codes with balanced bits. For multi-label data, we also design a novel multi-label manifold and balanced structure matrix to adapt the real-world scenarios. An effective discrete optimization method is used to optimize our proposed objective function instead of the relaxation one. Extensive experiments on three benchmark datasets verify the effectiveness of LGDH. The comparison results demonstrat that LGDH achieves about 2% and 3% improved to different cross-modal tasks on average.

关键词： Cross-modal retrieval manifold embedding hash learning balanced matrix

来源：评论

学校读者我要写书评

暂无评论

Further Studies on State Estimation of Discrete-Time Nonlinear Circuits Based on a Switching-Type Multi-Instant Fuzzy Observer

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2022年第8期69卷 3505-3509页

作者： Xie, Xiangpeng Xu, Chang Gu, Zhou Nanjing Univ Posts & Telecommun Inst Adv Technol Nanjing 210003 Peoples R China Nanjing Forestry Univ Coll Mech & Elect Engn Nanjing 210037 Peoples R China

This brief proposes further studies on fuzzy state estimation of discrete-time nonlinear circuits. In order to give a less conservative result over the most recent one, a new switching-type multi-instant fuzzy observer is introduced and thus different groups of gain matrices can be dispatched in the light of the updated mode about the normalized fuzzy weighting functions. For each possible mode, its corresponding gain matrices are deduced by using a new time-varying balanced matrix method. Compared with the existing time-invariant balanced matrix method, much more freedom can be provided with the aid of the powerful analysis tool of multi-instant homogenous polynomials. As a result, the conservatism is reduced and better performance of fuzzy state estimation is capable of being obtained in this brief. Finally, two advantages of our proposed results are validated via the benchmark example of this field.

关键词： Observers Switches Nonlinear circuits Symmetric matrices Integrated circuit modeling Circuits and systems Switching circuits State estimation relaxed observer nonlinear circuits Takagi-Sugeno model balanced matrix

来源：评论

学校读者我要写书评

暂无评论

Oriented hypergraphs: Balanceability

引用

DISCRETE MATHEMATICS 2022年第6期345卷 112832-112832页

作者： Rusnak, Lucas J. Li, Selena Xu, Brian Yan, Eric Zhu, Shirley Texas State Univ Dept Math San Marcos TX 78666 USA Texas State Univ Ctr Excellence Community Hlth & Econ Resiliency R San Marcos TX 78666 USA Texas State Univ Mathworks San Marcos TX 78666 USA

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance. (C)& nbsp;2022 Elsevier B.V. All rights reserved.

关键词： Oriented hypergraph balanced hypergraph balanced matrix Balancing sets Signed graph

来源：评论

学校读者我要写书评

暂无评论

Berge-acyclic multilinear 0-1 optimization problems

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019年第1期273卷 102-107页

作者： Buchheim, Christoph Crama, Yves Rodriguez-Heck, Elisabeth TU Dortmund Fak Math Vogelpothsweg 87 D-44227 Dortmund Germany Univ Liege HEC Management Sch QuantOM Rue Louvrex 14 B-4000 Liege Belgium

The problem of optimizing a multilinear polynomial f in 0-1 variables arises in applications from many different areas. We are interested in resolution methods based on reformulating the polynomial problem into an equivalent linear one, an approach that attempts to draw benefit from the extensive literature in integer linear programming. More precisely, we characterize instances for which the classical standard linearization procedure guarantees integer optimal solutions. We show that the standard linearization polytope P-H is integer if and only if the hypergraph H defined by the higher-degree monomials off is Berge-acyclic, or equivalently, when the matrix defining P-H is balanced. This characterization follows from more general conditions that guarantee integral optimal vertices for a relaxed formulation depending on the sign pattern of the monomials of f. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Nonlinear programming Integer programming Standard linearization balanced matrix Signed hypergraph

来源：评论

学校读者我要写书评

暂无评论

Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2011年第3期21卷 269-292页

作者： Dupont, Luis A. Villarreal, Rafael H. IPN Ctr Invest & Estudios Avanzados Dept Matemat Mexico City 07000 DF Mexico

Let C be a uniform clutter and let A be the incidence matrix of C. We denote the column vectors of A by v(1), ... ,v(q) . Under certain conditions we prove that C is vertex critical. If C satisfies the max-flow min-cut property, we prove that A diagonalizes over Z to an identity matrix and that v (1), ... ,v(q) form a Hilbert basis. We also prove that if C has a perfect matching such that C has the packing property and its vertex covering number is equal to 2, then A diagonalizes over Z to an identity matrix. If A is a balanced matrix we prove that any regular triangulation of the cone generated by v(1), ..., v(q) is unimodular. Some examples are presented to show that our results only hold for uniform clutters. These results are closely related to certain algebraic properties, such as the normality or torsion-freeness, of blowup algebras of edge ideals and to finitely generated abelian groups. They are also related to the theory of Grobner bases of toric ideals and to Ehrhart rings.

关键词： Uniform clutter Max-flow min-cut Normality Rees algebra Ehrhart ring balanced matrix Edge ideal Hilbert bases Smith normal form Unimodular regular triangulation

来源：评论

学校读者我要写书评

暂无评论

balanced RANDOM TOEPLITZ AND HANKEL MATRICES

引用

ELECTRONIC COMMUNICATIONS IN PROBABILITY 2010年第none期15卷 134-148页

作者： Basak, Anirban Bose, Arup Stanford Univ Dept Stat Stanford CA 94305 USA Indian Stat Inst Stat & Math Unit Kolkata 700108 India

Except for the Toeplitz and Hankel matrices, the common patterned matrices for which the limiting spectral distribution (LSD) are known to exist share a common property-the number of times each random variable appears in the matrix is (more or less) the same across the variables. Thus it seems natural to ask what happens to the spectrum of the Toeplitz and Hankel matrices when each entry is scaled by the square root of the number of times that entry appears in the matrix instead of the uniform scaling by n(-1/2). We show that the LSD of these balanced matrices exist and derive integral formulae for the moments of the limit distribution. Curiously, it is not clear if these moments define a unique distribution.

关键词： 60B20 60B10 60F05 60G57 62E20 Almost sure convergence balanced matrix Bounded Lipschitz metric Carleman condition Convergence in distribution Eigenvalues Moment method Random matrix uniform integrability

来源：评论

学校读者我要写书评

暂无评论

Patterned Random Matrices and Method of Moments

引用

International Congress of Mathematicians (ICM 2010)

作者： Bose, Arup Hazra, Rajat Subhra Saha, Koushik Indian Stat Inst Stat Math Unit 203 BT Rd Kolkata 700108 India

ISBN: (纸本)9789814324342

We present a unified approach to limiting spectral distribution (LSD) of patterned matrices via the moment method. We demonstrate relatively short proofs for the LSD of common matrices and provide insight into the nature of different LSD and their interrelations. The method is flexible enough to be applicable to matrices with appropriate dependent entries, banded matrices, and matrices of the form A(p) = 1/n XX' where X is a p x n matrix with real entries and p -> infinity with n = n(p) -> infinity and pin y with 0 <= y < infinity. This approach raises interesting questions about the class of patterns for which LSD exists and the nature of the possible limits. In many cases the LSD are not known in any explicit forms and so deriving probabilistic properties of the limit are also interesting issues.

关键词： Moment method large dimensional random matrix eigenvalues empirical and limiting spectral distributions Wigner Toeplitz Hankel circulant reverse circulant symmetric circulant sample covariance and XX' matrices band matrix balanced matrix linear dependence

来源：评论

学校读者我要写书评

暂无评论

balanced matrices

引用

DISCRETE MATHEMATICS 2006年第19-20期306卷 2411-2437页

作者： Conforti, Michele Cornuejols, Gerard Vuskovic, Kristina Univ Padua Dipartimento Matemat Pura & Applicata I-35131 Padua Italy Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA Univ Marseille LIF F-13288 Marseille France Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England

A 0 +/- 1 matrix is balanced if, in every submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of 4. This definition was introduced by Truemper and generalizes the notion of balanced 0, 1 matrix introduced by Berge. In this tutorial, we survey what is currently known about these matrices: polyhedral results, combinatorial and structural theorems, and recognition algorithms. (c) 2006 Elsevier B.V. All rights reserved.

关键词： balanced matrix balanced hypergraph integral polytope bicoloring decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：