-
81
Adversarial sample generation algorithm for vertical federated learning
Published 2023-08-01“…To adapt to the scenario characteristics of vertical federated learning (VFL) applications regarding high communication cost, fast model iteration, and decentralized data storage, a generalized adversarial sample generation algorithm named VFL-GASG was proposed.Specifically, an adversarial sample generation framework was constructed for the VFL architecture.A white-box adversarial attack in the VFL was implemented by extending the centralized machine learning adversarial sample generation algorithm with different policies such as L-BFGS, FGSM, and C&W.By introducing deep convolutional generative adversarial network (DCGAN), an adversarial sample generation algorithm named VFL-GASG was designed to address the problem of universality in the generation of adversarial perturbations.Hidden layer vectors were utilized as local prior knowledge to train the adversarial perturbation generation model, and through a series of convolution-deconvolution network layers, finely crafted adversarial perturbations were produced.Experiments show that VFL-GASG can maintain a high attack success while achieving a higher generation efficiency, robustness, and generalization ability than the baseline algorithm, and further verify the impact of relevant settings for adversarial attacks.…”
Get full text
Article -
82
Application of Lean–Agile Hybrid Methods in Complex Construction Project Management
Published 2025-07-01“…This study explores the application potential of a lean–Agile hybrid method in complex construction project management. By integrating Scrum iterative development, the Last Planner System, and a BIM collaboration platform, a dual-engine model is established to optimize the dynamic priority mechanism (MoSCoW 2.0) and interface conflict entropy algorithm (ICE model). …”
Get full text
Article -
83
Construction and analysis of yarn tension model in the process of electromagnetic weft insertion
Published 2025-05-01“…In order to improve the fabric quality, this study takes three typical yarns, which are wool yarn, cotton yarn, and nylon yarn, as examples to study the yarn tension in the process of electromagnetic weft insertion and explore the variation rules of yarn tension under different materials and different weft insertion speeds. When constructing the yarn tension model, the Levenberg–Marquardt algorithm in ORIGIN software is used for data fitting. …”
Get full text
Article -
84
INFORMATION-ALGORITHMIC SUPPORT FOR DEVELOPMENT OF SOLID PHARMACEUTICAL FORM
Published 2018-10-01Get full text
Article -
85
Convergence of a Belief Propagation Algorithm for Biological Networks
Published 2019-01-01Get full text
Article -
86
Introducing the kernel descent optimizer for variational quantum algorithms
Published 2025-08-01“…In particular, we showcase scenarios in which kernel descent outperforms gradient descent and quantum analytic descent. The algorithm follows the well-established scheme of iteratively computing classical local approximations to the objective function and subsequently executing several classical optimization steps with respect to the former. …”
Get full text
Article -
87
A Method of Sample Models of Program Construction in Terms of Petri Nets
Published 2015-08-01“…At the second stage, iterative process of automated net construction is used for Petri net generation of any size, limited only by an available computer memory. …”
Get full text
Article -
88
Load Model Construction and Parameter Identification Method of Inverter-Interfaced Distributed Generator
Published 2024-11-01“…[Method] This article constructed an inverter-interfaced distributed generator (IIDG) model and employed a novel optimization algorithm. …”
Get full text
Article -
89
Robust interference alignment algorithm for cognitive MIMO interference network
Published 2016-03-01“…A robust interference alignment algorithm was proposed for underlay cognitive MIMO interference network with imperfect channel-state information (CSI).Firstly,imperfect CSI was characterized by Euclidean ball-shaped uncer-tainty,based on which the optimization model of transmitting precoding and receiving interference subspace matrix was constructed with aimed of minimizing interference leak Then,primary users' interference temperature constraint un-der the worst-case condition was derived according to the matrix norm inequality.Finally,alternate iteration expressions of transceiver matrixes were obtained exploiting Lagrange partial dual-decomposition theory and sub-gradient update method.Moreover,the proposed algorithm's application condition and degrees of freedom range were theoretically ana-lyzed.Simulation results show that the proposed algor m is robust and its secondary users' network performance out-performs existing algorithms'.…”
Get full text
Article -
90
A memetic algorithm for high‐strength covering array generation
Published 2023-08-01“…The sub‐optimal solution acceptance rate is introduced to generate multiple test cases after each iteration to improve the efficiency of constructing high‐covering strength test suites. …”
Get full text
Article -
91
Blind equalization algorithm based on complex support vector regression
Published 2019-10-01“…A new blind equalization algorithm for complex valued signals was proposed based on the framework of complex support vector regression(CSVR).In the proposed algorithm,the error function of multi-modulus algorithm (MMA) was substituted into CSVR to construct the cost function,and the regression relationship was established by widely linear estimation,and the equalizer coefficients were determined by the iterative re-weighted least square (IRWLS) method.Different from spliting the complex valued signals into real valued signals used in support vector regression,the Wirtinger’s calculus was used in complex support vector regression to analyze the complex signals directly in the complex regenerative kernel Hilbert space.Simulation experiments show that for QPSK modulated signals,compared with the blind equalization algorithm based on support vector regression,the equalization performance of the proposed algorithm is significantly improved in linear channel and nonlinear channel by choosing appropriate kernel function and iterative optimization method.…”
Get full text
Article -
92
Wind resistance performance optimization of PSO algorithm in skyscrapers design
Published 2025-01-01“…After 150 iterations, it was basically stable and close to 0, indicating that the optimal solution was found. …”
Get full text
Article -
93
Interactive image segmentation algorithm based on adaptive kernel learning
Published 2025-07-01“…To address the issue that most existing interactive image segmentation methods suffer from limited segmentation performance due to their susceptibility to noise interference and non-convex structure impacts in the original feature space, an adaptive kernel learning-based interactive image segmentation algorithm was proposed. Firstly, an energy function was constructed by integrating spatial distance information from user annotations on the results of SLIC superpixel segmentation with the pixel neighborhood topological relationships. …”
Get full text
Article -
94
An algorithm for automatic fitting and formula assignment in atmospheric mass spectra
Published 2025-04-01“…The algorithm utilizes weighted-least-squares fitting and a modified version of the Bayesian information criterion along with an iterative formula assignment process. …”
Get full text
Article -
95
Strong Convergence of Hybrid Algorithm for Asymptotically Nonexpansive Mappings in Hilbert Spaces
Published 2012-01-01“…The hybrid algorithms for constructing fixed points of nonlinear mappings have been studied extensively in recent years. …”
Get full text
Article -
96
Masterpiece Optimization Algorithm: A New Method for Solving Engineering Problems
Published 2025-01-01“…Now, to handle this content, in the first iteration of the proposed algorithm, different points in the answer zone are introduced for the MPF. …”
Get full text
Article -
97
Sparse adaptive constant blind equalization algorithm for sparse multipath channel
Published 2017-01-01“…In order to improve the convergence rate of the blind equalizer for sparse multipath channel,a novel blind equalization approach called l<sub>0</sub>-norm constraint proportionate normalized least mean square constant algorithm was proposed for M-order phase-shift keying (MPSK) signal.Based on the constant modulus characteristics of MPSK signal and the sparse property of equalizer,a new blind equalization cost function with the l<sub>0</sub>-norm penalty on the equalizer tap coefficients was firstly constructed.Then the update formula of the tap coefficients was derived according to the gradient descent algorithm.Moreover,the iteration step was updated by drawing upon the normalized proportionate factor.The algorithm not only assigned step sizes proportionate to the magnitude of the current individual tap weights,but also attracted the inactive taps to zero adaptively.Theoretical analysis and simulation results show that the proposed algorithm outperforms the existing blind equalization algorithms for sparse channel in reducing ISI and improving convergence rate.…”
Get full text
Article -
98
IMPROVING THE ACCURACY OF DETERMINING DEVIANT GROUPS IN THE SELECTION AND MONITORING OF THE CRITICAL INFORMATION INFRASTRUCTURE ENTERPRISES STAFF
Published 2025-07-01“…The method is based on an iterative clustering algorithm, the k-means method, based on minimizing the total squared deviations of cluster points from the centroids of these clusters. …”
Get full text
Article -
99
Towards Analysable Chaos-based Cryptosystems: Constructing Difference Distribution Tables for Chaotic Maps
Published 2024-10-01“…This paper introduces a straightforward approach of using chaotic maps in cryptographic algorithms in a way that facilitates cryptanalysis. …”
Get full text
Article -
100
Cost Accounting Algorithm of Environmental Pollution Control Based on Discrete Probability
Published 2022-01-01“…Finally, a discrete probability model is used to optimize the cost function, and the optimized cost function is used to design the environmental pollution control cost accounting algorithm. The experimental results show that the proposed algorithm can quickly converge to the optimum within 70 iterations, the accounting error rate is between -0.2% and 1.3%, and the accounting time is always less than 0.4 s. …”
Get full text
Article