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

Advanced algorithms and Control Engineering (ICAACE), International Conference on

作者： Taiming Lei Zongkang Zou School of Software Jiangxi Normal University Nanchang City Jiangxi Province China

ISBN: (数字)9798331535087

ISBN: (纸本)9798331535094

Driven by rapid advancements in the Internet, social networks, graph databases, and bioinformatics, vast amounts of graph data have emerged as a crucial medium for representing complex inter-entity relationships. However, traditional exact graph matching methods typically encounter significant challenges including high computational costs and suboptimal matching performance when addressing practical issues such as noise, missing data, and local structural deformations. To overcome these challenges, this study introduces an approximate subgraph matching algorithm that leverages dense substructure partitioning coupled with dual-index construction. By partitioning large graphs locally and efficiently pre-selecting candidate nodes, the proposed algorithm markedly reduces computational complexity while preserving high matching accuracy. Experimental results on the Protein, DBLP, and YAGO datasets show that the proposed method performs well in terms of accuracy and computational efficiency while exhibiting robust performance in noisy environments.

关键词： Proteins Accuracy Social networking (online) Heuristic algorithms Noise approximation algorithms Partitioning algorithms Computational efficiency Computational complexity Indexing

来源：评论

学校读者我要写书评

暂无评论

Methods and Software Tools for Converting Road Marking Line Segmentation Mask to Object Representation for Highly Automated Vehicles

Methods and Software Tools for Converting Road Marking Line ...

引用

International Russian Smart Industry Conference (SmartIndustryCon)

作者： Danil Dolgov Alexander Dolgov Imil Khairullin Faculty of Information Systems and Technologies Ulyanovsk State Technical University Ulyanovsk Russia

ISBN: (数字)9798331511241

ISBN: (纸本)9798331511258

This paper describes the development of an algorithm for converting segmentation masks derived from neural networks into ordered sets of point coordinates representing road markings for highly automated vehicles (HAVs). Several methods are considered, including the nearest neighbor method, polynomial approximation, Hough transform, and parallel contouring. Performance tests and complexity analyses are performed for each method. The parallel contour method with dynamic search for opposite points was the most effective, demonstrating linear complexity and high accuracy in approximating road marking contours. This solution ensures efficient processing of large real-time datasets, critical for HAV navigation. The study integrates the algorithm into a unified system, combining segmentation with mask-to-line conversion, enhancing autonomous driving precision.

关键词： Industries Accuracy Navigation Roads Neural networks Software algorithms Transforms approximation algorithms Polynomials Real-time systems

来源：评论

学校读者我要写书评

暂无评论

PAC-Private algorithms

PAC-Private Algorithms

引用

IEEE Symposium on Security and Privacy

作者： Mayuri Sridhar Hanshen Xiao Srinivas Devadas MIT CSAIL Cambridge MA Purdue University/NVIDIA Research West Lafayette Indiana

ISBN: (数字)9798331522360

ISBN: (纸本)9798331522377

Provable privacy typically requires involved analysis and is often associated with unacceptable accuracy loss. While many empirical verification or approximation methods, such as Membership Inference Attacks (MIA) and Differential Privacy Auditing (DPA), have been proposed, these do not offer rigorous privacy guarantees. In this paper, we apply recently-proposed Probably Approximately Correct (PAC) Privacy to give formal, mechanized, simulation-based proofs for a range of practical, black-box algorithms: K-Means, Support Vector Machines (SVM), Principal Component Analysis (PCA) and Random Forests. To provide these proofs, we present a new simulation algorithm that efficiently determines anisotropic noise perturbation required for any given level of privacy. We provide a proof of correctness for this algorithm and demonstrate that anisotropic noise has substantive benefits over isotropic noise. Stable algorithms are easier to privatize, and we demonstrate privacy amplification resulting from introducing regularization in these algorithms; meaningful privacy guarantees are obtained with small losses in accuracy. We propose new techniques in order to reduce instability in algorithmic output and convert intractable geometric stability verification into efficient deterministic stability verification. Thorough experiments are included, and we validate our provable adversarial inference hardness against state-of-the-art empirical attacks.

关键词： Support vector machines Privacy Accuracy Closed box Anisotropic approximation algorithms Inference algorithms Picture archiving and communication systems Stability analysis Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Property Testing of Curve Similarity

arXiv

引用

arXiv 2025年

作者： Afshani, Peyman Buchin, Maike Driemel, Anne Richter, Marena Wong, Sampson Department of Computer Science Aarhus University Denmark Faculty of Computer Science Ruhr University Bochum Germany Institute for Computer Science University of Bonn Germany Department of Computer Science University of Copenhagen Denmark

We propose sublinear algorithms for probabilistic testing of the discrete and continuous Fréchet distance—a standard similarity measure for curves. We assume the algorithm is given access to the input curves via a query oracle: a query returns the set of vertices of the curve that lie within a radius δ of a specified vertex of the other curve. The goal is to use a small number of queries to determine with constant probability whether the two curves are similar (i.e., their discrete Fréchet distance is at most δ) or they are ‘Ε-far’ (for 0 t/Ε log t/Ε ) queries and is given the value of t in advance. The second algorithm does not have explicit knowledge of the value of t and therefore needs to gain implicit knowledge of the straightness of the input curves through its queries. We show that the discrete Fréchet distance can still be tested using roughly O(t3 +t2 log n/Ε) queries ignoring logarithmic factors in t. Our algorithms work in a matrix representation of the input and may be of independent interest to matrix testing. Our algorithms use a mild uniform sampling condition that constrains the edge lengths of the curves, similar to a polynomially bounded aspect ratio. Applied to testing the continuous Fréchet distance of t-straight curves, our algorithms can be used for (1 + Ε′)-approximate testing using essentially the same bounds as stated above with an additional factor of poly(1/Ε′ ). Copyright © 2025, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Separation of Speech Sources Based on Dual MVDR Beamformer

A Separation of Speech Sources Based on Dual MVDR Beamformer

引用

Systems of Signals Generating and Processing in the Field of on Board Communications

作者： Quan Trong The Dinh Truong Duy Faculty of Information Security Posts and Telecommunications Institute of Technology Hanoi Vietnam

ISBN: (数字)9798331532635

ISBN: (纸本)9798331532642

Microphone arrays (MA) techniques are widely applied into numerous acoustic devices for speech enhancement. Because of the spatial information, MA beamforming has the capacity of processing multiple desired or undesired sources in a complex and annoying environment, approximately localizing sound. Nowadays, various applications that are arising in the field of teleconference systems, hands-free mobile phones, automatic speech recognition, smart-home, surveillance equipment present new challenges for speech enhancement algorithms. Minimum Variance Distortionless Response (MVDR) beamformer is the most effective algorithm for saving the original clean speech data, eliminating the unwanted background noise without speech distortion. Because of the different microphone sensitivities, the error of sampling rate, the inaccurate estimation of preferred incident angle of useful signal, the imprecise MA distribution or designed MA geometry, the MVDR beamformer's performance significantly degraded. In this article, the author considered the problem of separating sound speech in the realistic consecutive conversation between two speakers. The authors proposed an additive method, which enhances the MVDR beamformer's evaluation in extracting each individual. The promising results obtained have confirmed the effectiveness of the author's proposed method in real-life situations. The author's illustrated approach can be integrated into a multi-channel signal processing system for solving several complex problems.

关键词： Teleconferencing Acoustic distortion Sensitivity Array signal processing Surveillance Signal processing algorithms Speech enhancement Hearing aids approximation algorithms Microphone arrays

来源：评论

学校读者我要写书评

暂无评论

How do you want your greedy: simultaneous or repeated?

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 3174-3260页

作者： Moran Feldman Christopher Harshaw Amin Karbasi Department of Computer Science University of Haifa Haifa Israel Simons Institute Univeristy of California Berkeley Berkeley CA Departments of Electrical Engeering Computer Science Statsitics & Data Science Yale University New Haven CT

We present SimultaneousGreedys, a deterministic algorithm for constrained submodular maximization. At a high level, the algorithm maintains ℓ solutions and greedily updates them in a simultaneous fashion. SimultaneousGreedys achieves the tightest known approximation guarantees for both k-extendible systems and the more general k-systems, which are $(k+1)^2/k = k + \mathcal{O}(1)$ and $(1 + \sqrt{k+2})^2 = k + \mathcal{O}(\sqrt{k})$, respectively. We also improve the analysis of RepeatedGreedy, showing that it achieves an approximation ratio of k+O(√k) for k-systems when allowed to run for O(√k) iterations, an improvement in both the runtime and approximation over previous analyses. We demonstrate that both algorithms may be modified to run in nearly linear time with an arbitrarily small loss in the *** SimultaneousGreedys and RepeatedGreedy are flexible enough to incorporate the intersection of m additional knapsack constraints, while retaining similar approximation guarantees: both algorithms yield an approximation guarantee of roughly $k + 2m + \mathcal{O}(\sqrt{k+m})$ for k-systems and SimultaneousGreedys enjoys an improved approximation guarantee of k + 2m + O(√m) for k-extendible systems. To complement our algorithmic contributions, we prove that no algorithm making polynomially many oracle queries can achieve an approximation better than k + 1/2 - ε. We also present ***, a Julia package which implements these algorithms. Finally, we test these algorithms on real datasets.

关键词： submodular maximization k-systems k-extendible systems approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Joint Approximate Diagonalization Using Bilateral Rank-Reducing Householder Transform with Application in Blind Source Separation

引用

Chinese Journal of Electronics 2023年第3期18卷 471-476页

作者： Weitao Zhang Ning Liu Shuntian Lou The School of Electionic Engneering Xidian University Xi'an China

This paper addresses the problem of Joint approximate diagonalization (JAD) of a set of given matrices and proposes a new efficient iterative algorithm for JAD that based on the rank-reducing structure of House-holder transform. The proposed algorithm, named as HJD, completes the simultaneous diagonalization of the target matrices by successive Householder transform from the point of view of matrix power concentration. Generally, the power of the elements below diagonal element was concentrated to the diagonal element by the rank-reducing Householder transform. Such a particular structure of Householder transform at each iteration prevents the divergence of matrix power. The diagonalization matrix was calculated by the product of all Householder matrices. By applying our algorithm to blind source separation, we demonstrate the efficiency and improvement of the proposed algorithm in estimating the separation matrix.

关键词： Computer simulation Transforms approximation algorithms Blind source separation Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Distributed ATC Particle Filters for Cooperative Quaternion Tracking

Distributed ATC Particle Filters for Cooperative Quaternion ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Claudio J. Bordin Marcelo G. S. Bruno Stiven S. Dias Universidade Federal do ABC Santo André - SP Brazil Instituto Tecnológico de Aeronáutica Brazil Embraer S.A. Brazil Eindhoven University of Technology Eindhoven Noord Brabant The Netherlands

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

We propose in this paper two adapt-then-combine (ATC) distributed particle filters for cooperative estimation of 3D orientations. The first algorithm represents rotations as elements of the Special Orthogonal Group and builds Gaussian parametric approximations on a Lie Algebra to fuse posterior probability densities. The second algorithm, in turn, represents the orientations as unit-norm quaternions and resorts to directional statistics, fusing von Mises-Fisher parametric approximations. The proposed algorithms performances are then evaluated via numerical simulations.

关键词： Three-dimensional displays Quaternions Posterior probability Signal processing algorithms Estimation Signal processing approximation algorithms Numerical simulation Particle filters Speech processing

来源：评论

学校读者我要写书评

暂无评论

A Joint AP Selection and Power Control Scheme for D2D Communications and Cell-Free Massive MIMO Coexistence

A Joint AP Selection and Power Control Scheme for D2D Commun...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xixi Bi Shaochuan Wu Yifei Fan Guoyu Li School of Electronics and Information Engineering Harbin Institute of Technology Harbin China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

Coexistence of device-to-device (D2D) communication and cell-free massive multiple-input multiple-output (CF-mMIM O) is a promising technology for future wireless systems. It is expected to enhance the spectral efficiency (SE), as well as reduce the transmission delay for user equipments. In this paper, we propose a joint access point (AP) selection and power control scheme to maximize the sum SE, oppositing to the existing paper which performs the power control based on the AP selection and the AP selection is performed by the heuristic algorithm, leading to the performance is limited. To address the non-convex optimization problem, the original problem is decomposed into two subproblems: AP selection and power control, both are all resolved by sequential convex approximation (SCA) method. Furthermore, the penalty method is applied in the AP selection, alleviating the narrowing of feasible region brought by the SCA which results in the feasible solution of the original problem unattainable. At the same time, the convergence prove of corresponding algorithm is presented. Numerical results demonstrate the superior performance compared to the existing scheme in terms of improving the performance of the system.

关键词： Spectral efficiency Heuristic algorithms Power control Massive MIMO approximation algorithms Device-to-device communication Delays Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Optimization of Decentralized Caching with Improved Coded Delivery Under Heterogeneous File Popularity

Optimization of Decentralized Caching with Improved Coded De...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Siyu Zhang Jiasheng Liang Yong Deng Department of Software Engineering Lakehead University Ontario Canada Department of Computer Science Binghamton University New York USA

ISBN: (数字)9798331508050

ISBN: (纸本)9798331508067

This paper considers the design and optimization of decentralized coded caching under heterogeneous file popularity. We propose a decentralized nested coded caching scheme (D-NCCS) that implements an improved nested coded delivery strategy to avoid using zero-padding, a common sub-optimal approach for simplifying the coded delivery under heterogeneous file popularity. We formulate a joint optimization problem to jointly optimize the cache placement and nested coded delivery strategies of the D-NCCS, and develop a successive approximation algorithm to solve the problem. Numerical results demonstrate the close to optimal performance of the optimized D-NCCS.

关键词： approximation algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：