The Split Common Fixed Point Problem for -Strictly Pseudononspreading Mappings by Shubo Cao

“…We introduce and analyze the viscosity approximation algorithm for solving the split common fixed point problem for the strictly pseudononspreading mappings in Hilbert spaces. …”
Get full text

Massive MIMO signal detection based on approximate message passing algorithm by Chuang QIN, Ziwei ZHENG, Daping LOU, Xianzu FU

“…Massive multiple-input multiple-output(MIMO)brings huge improvements in energy efficiency and reduces emission power by using a large number of antennas,which is known as a key technology in the fifth generation (5G)mobile communication.With the increasing number of antennas,the complexity of signal detection is increasing at the same time.According to the research status of massive MIMO signal detection,approximate message passing algorithm was proposed.The complexity of AMP was compared to some iteration algorithm like Richarson algorithm and Neumann series approximation algorithm.The results indicate that the proposed algorithm can use less iteration to achieve almost the same performance of MMSE algorithm.…”
Get full text

Minimum-cost network hardening algorithm based on stochastic loose optimize strategy by Guang-sheng ZHAO, Qing-feng CHENG, Yong-lin SUN

“…To construst a minimum-cost network hardening (MCNH) scheme in large-scale network,a stochastic loose optimize strategy based algorithm (MCNHA-SLOS) was proposed,and its effectiveness was analyzed.MCNHA-SLOS was a near-optimal approximation algorithm,which could achieve iterative computations in the array of sparse spaces of the whole plan space,so that the near-optimal scheme must exist in the low cost plan space.Instantiation analysis and experimental results show that the MCNHA-SLOS algorithm to be efficient,precision controllable and asymptotically optimal,and thus very applicable for large-scale network.…”
Get full text

An algorithm for distributed parameter estimation in modal regression models by Xuejun Ma, Xiaochao Xia

“…Differing from the existing methods regarding distributed modal regression, the proposed method combines the divide-and-conquer idea and a linear approximation algorithm. It is computationally fast and statistically efficient to implement. …”
Get full text

Toward reliability-satisfied and hop-constrained backup paths for industrial internet demands by Huifen Huang, Xinchang Zhang

“…We propose an approximation algorithm to solve the dynamic backup path arrangement problem that is NP-hard.…”
Get full text

Diffusing information for mobile social networks under consideration of dynamic influence by Dong Jing, Ting Liu

“…Theoretical analysis shows that the influence maximization problem under new model is non-deterministic polynomial-time hard, and efficient approximation algorithm is proposed. Experimental studies on real data sets show that the new model can process dynamic influence well in the diffusing information procedure, and the proposed algorithms can solve the influence maximization problem on new model efficiently.…”
Get full text

A secure communication algorithm for UAV swarms based on cooperative beamforming by HAN Dongsheng, ZHAO Yishuo

“…Since this optimization problem was characterized by highly coupled non-convex terms, the initial problem was decomposed into two sub-problems and a cyclic iterative successive convex approximation algorithm was designsed to solve it through Taylor expansion and convex relaxation. …”
Get full text

Real number approximation by a rational number in the approximating k-ary algorithm by R.R. Enikeev

“…The aim of this study was to find the fastest approximation algorithm that enables to accelerate the convergence of the k-ary algorithm for computing the greatest common divisor. …”
Get full text

Solving Signal Control Problems with Second-Order Sensitivity Information of Equilibrium Network Flows by Hsun-Jung Cho, You-Heng Huang

“…Finally, this paper also demonstrates two numerical examples that show the computation of second-order sensitivity and the speed of convergence of the nonlinear approximation algorithm.…”
Get full text

Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming by Le Quang Thuy, Nguyen Thi Bach Kim, Nguyen Tuan Thien

“…As an application, we propose an outer approximation algorithm in the outcome space for solving the multiplicative convex program. …”
Get full text

Real-Time Resource Allocation Algorithm for the Quasi-Two-Dimensional Mobile Delay/Disrupt Tolerant Networking by Ying Wang, Yonghui Zhang

“…Therefore the information matrix of access routers and quasi-two-dimensional access bandwidth constraints were designed based on predictable environment of train mobile network, and then an approximation algorithm with O（n） algorithm complexity, based on utility differential, was proposed to meet the real-time applications. …”
Get full text

An Asymptotic Analysis of the Gradient Remediability Problem for Disturbed Distributed Linear Systems by Soraya Rekkab, Samir Benhadid, Raheam Al-Saphory

“…Finally, an approach that leads to a Mathematical approximation algorithm is explored. …”
Get full text

Secure data offloading strategy for multi-UAV wireless networks based on minimum energy consumption by Gaofeng CUI, Yuanyuan XU, Shanghong ZHANG, Weidong WANG

“…To solve the problems of ground passive eavesdropping when ground users offload data to the multi-UAV(unmanned aerial vehicle) edge computing network, a secure data offloading strategy that minimized system energy consumption by jointly optimizing user matching and resource allocation was proposed.Considering the constraints of system delay, communication resources and computing resources, the probability of security interruption was used to restrict the security performance of the data offload process.By using block coordinate descent and successive convex approximation algorithm, the user transmission power, offload factor, UAV computing resource allocation and jamming power were jointly optimized.A pair-wise stable user matching algorithm was proposed to minimize the total energy consumption of UAV system.Simulation results demonstrate that the algorithm can realize the safe offloading of data, and has good performance in energy consumption and delay by comparing with the conventional strategies.…”
Get full text

Secure data offloading strategy for multi-UAV wireless networks based on minimum energy consumption by Gaofeng CUI, Yuanyuan XU, Shanghong ZHANG, Weidong WANG

“…To solve the problems of ground passive eavesdropping when ground users offload data to the multi-UAV(unmanned aerial vehicle) edge computing network, a secure data offloading strategy that minimized system energy consumption by jointly optimizing user matching and resource allocation was proposed.Considering the constraints of system delay, communication resources and computing resources, the probability of security interruption was used to restrict the security performance of the data offload process.By using block coordinate descent and successive convex approximation algorithm, the user transmission power, offload factor, UAV computing resource allocation and jamming power were jointly optimized.A pair-wise stable user matching algorithm was proposed to minimize the total energy consumption of UAV system.Simulation results demonstrate that the algorithm can realize the safe offloading of data, and has good performance in energy consumption and delay by comparing with the conventional strategies.…”
Get full text

Real-Time Resource Allocation Algorithm for the Quasi-Two-Dimensional Mobile Delay/Disrupt Tolerant Networking by Ying Wang, Yonghui Zhang

“…Therefore the information matrix of access routers and quasi-two-dimensional access bandwidth constraints were designed based on predictable environment of train mobile network, and then an approximation algorithm with O（n） algorithm complexity, based on utility differential, was proposed to meet the real-time applications. …”
Get full text

Maximizing spatial–temporal coverage in mobile crowd-sensing based on public transports with predictable trajectory by Chaowei Wang, Chensheng Li, Cai Qin, Weidong Wang, Xiuhua Li

“…After proving the public transport selection is non-deterministic polynomial-time hardness, an approximation algorithm is proposed and the coverage is close to 1. …”
Get full text

Bi-Objective Optimization of Product Selection and Ranking Considering Sequential Search by Yuyang Tan, Hao Gong, Chunxiang Guo

“…To solve the problem efficiently, we develop a dynamic programing-based approximation algorithm. Numerical experiments demonstrate that the algorithm consistently outperforms benchmark methods, especially in large-scale scenarios. …”
Get full text

Study of Impact of Moment Information in Demand Forecasting on Distributionally Robust Fulfillment Rate Improvement Algorithm by Haodong Feng

“…We reformulate this distributionally robust allocation model into an equivalent mixed-integer linear programming model and develop a corresponding approximation algorithm. Through numerical experiments, we comprehensively reveal the impact of moment information in demand forecasting on the distributionally robust fulfillment rate improvement algorithm by discovering how demand forecasting influences the allocation rule and how forecasted variance influences the fulfillment rates at fixed or changing inventory levels.…”
Get full text

Efficient heuristic algorithm for the mobile sink routing problem by YUAN yuan1, PENG Yu-xing1, LI Shan-shan2, TANG Wen-sheng3

“…In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing prob-lem can be regarded as a special case of TSP with neighborhoods（TSPN） problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a "racetrack" by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuris-tic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O（n2） computa-tion time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approxima-tion ratio and can be more efficient than the related algorithms.…”
Get full text

A kind of improved bivariate even order Bernoulli-type multiquadric quasi-interpolation operator and its application in two-dimensional coupled Burgers’ equations by Ruifeng Wu

“…Abstract Multiquadric quasi-interpolation is an efficient high-dimensional approximation algorithm. It can directly obtain the approximation term and its derivatives without solving any large-scale linear equations. …”
Get full text