MOTION PRECISION ANALYSIS OF PERMANENT MAGNET SYBCHRONOUS GRINDING MOTORIZED SPINDLE by GAO Feng, CHENG MingKe, LI Yan, HE PingPing, JIA WeiTao

“…The least squares approximation algorithm is applied to fit the radial trajectory of the spindle,and then the inclination error is modeled to obtain the tilt angle of the spindle’s axis of rotation. …”
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

Bandwidth Selection for Recursive Kernel Density Estimators Defined by Stochastic Approximation Method by Yousri Slaoui

“…We propose an automatic selection of the bandwidth of the recursive kernel estimators of a probability density function defined by the stochastic approximation algorithm introduced by Mokkadem et al. (2009a). …”
Get full text

Improved cooperative spectrum sensing scheme based on dempster-shafer theory in cognitive radio network by Mei-ting YU, Lin-jing ZHAO, Zhao LI

“…An improved cooperative spectrum sensing scheme based on dempster-shafer evidence theory in cognitive radio networks was proposed.In the local sensing period,the projection approximation algorithm was introduced to reduce bandwidth for cooperation.In the fusion period,credibility was calculated by the distance between evidence vectors of different secondary users and adopted as the weights to combine different local sensing data.The new scheme reduces channel bandwidth and simulation results show that the new scheme improves the performance under the condition of high level conflict.…”
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

Differential Motion Analysis of the Planar 3-RRR Fully Compliant Parallel Mechanism by Li Yaqiong, An Ziming, Zhu Dachang, Zhou Lei

“…By establishing apseudo-rigid-body model of the planar 3-RRR type fully compliant parallel mechanism,and using micro approximation algorithm,the displacement jacobian matrix between the input and output is got,the displacement vector differential mapping relation between input and output under the micro motion case is researched,and the numerical validation is carried out,the simulation of it is conducted with ANSYS software,the theoretical reference basis for differential motion analysis of this kind of planar parallel mechanism and spatial parallel mechanism with multiple input and multiple output characteristics is provided.…”
Get full text

Virtual backbone formation algorithm based on GBG for wireless sensor networks by SUN Yan-jing, QIAN Jian-sheng

“…An approximation algorithm of virtual backbone formation （VBF） based on a more generalized and realistic wireless network communication model of bounded growth graph （GBG） was proposed. …”
Get full text

A Game Theoretical Approach for Solving Winner Determination Problems by Chen-Kun Tsung, Hann-Jang Ho, Sing-Ling Lee

“…In this paper, we apply three concepts of the game theory to design an approximation algorithm: the stability of the Nash equilibrium, the self-learning of the evolutionary game, and the mistake making of the trembling hand assumption. …”
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

A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles by Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo, Jianqiang Dong

“…Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. …”
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

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

An Efficient Clustering Algorithm in Wireless Sensor Networks Using Cooperative Communication by Shukui Zhang, Jianxi Fan, Juncheng Jia, Jin Wang

“…However, finding a minimum WCDS is NP-hard problem for most graphs, and a host of approximation algorithm has been proposed. The aim of the paper is to construct a minimum WCDS as a clustering scheme for WSN. …”
Get full text

The Holling Type II Population Model Subjected to Rapid Random Attacks of Predator by Jevgeņijs Carkovs, Jolanta Goldšteine, Kārlis Šadurskis

“…We propose a stochastic approximation algorithm for quantitative analysis of the above model based on the probabilistic limit theorem. …”
Get full text

Monte Carlo Based Personalized PageRank on Dynamic Networks by Zhang Junchao, Chen Junjie, Jiancheng Song, Rong-Xiang Zhao

“…In a dynamic network, first, we do a random walk starting from each node and save the performed walks into a fingerprint database; second, we update the fingerprint database in a fixed time interval with our proposed update algorithm; finally, when a query is issued by a user, we estimate the Personalized PageRank vector by our proposed approximation algorithm. Experiments on real-world networks show that our method can handle multichanges of the underlying network at a time and is more efficient than related work, so it can be used in real incremental Personalized PageRank-based applications.…”
Get full text

Automatic 4-mirrors system for alignment of high-power laser radiation by V.V. Toporovsky, A.G. Alexandrov, I.V. Galaktionov, A.L. Rukosuev, A.V. Kudryashov

“…The successive approximation algorithm was used to minimize the beam deflection. …”
Get full text

Fast Hybrid Method for the Study on Monostatic Scattering from Plasma-Coated Target above a Rough Surface by Rui Wang, Shui-Rong Chai, Li-Xin Guo

“…A fast hybrid method combining the reciprocity theorem with high frequency approximation algorithm is presented to deal with the problem of the monostatic scattering from a two-dimensional (2D) plasma-coated target above a one-dimensional (1D) Gaussian rough surface illuminated by the tapered incident wave. …”
Get full text

IMPROVEMENT OF EVOLUTIONARY STRUCTURAL OPTIMIZATION METHOD FOR 2-D MODEL by CHEN XiaoMing, LAI XiDe, TANG Jian, ZHU Li, ZHAO Xi

“…The other is interval approximation algorithm. Minimum initial rejection rate R_0minwhich fulfill removed conditions was ascertained by using this algorithm and it was used as starting value,thus other initial rejection rate R₀ were obtained by setting certain increment. …”
Get full text

Service function chain embedding algorithm with wireless multicast in mobile edge computing network by Kan WANG, Nan ZHAO, Junhuai LI, Huaijun WANG

“…To resolve the excessive system overhead and serious traffic congestion in user-oriented service function chain (SFC) embedding in mobile edge computing (MEC) networks,a content-oriented joint wireless multicast and SFC embedding algorithm was proposed for the multi-base station and multi-user edge networks with MEC servers.By involving four kinds of system overhead,including service flow,server function sustaining power,server function service power and wireless transmission power,an optimization model was proposed to jointly design SFC embedding with multicast beamforming.Firstly,with Lagrangian dual decomposition,the problem was decoupled into two independent subproblems,namely,SFC embedding and multicast beamforming.Secondly,with the L<sub>p</sub> norm penalty term-based successive convex approximation algorithm,the integer programming-based SFC embedding problem was relaxed to an equivalent linear programming one.Finally,the non-convex beamforming optimization problem was transformed into a series of convex ones via the path following technique.Simulation results revealed that the proposed algorithm has good convergence,and is superior to both the optimal SFC embedding with unicasting and random SFC embedding with multicasting in terms of system overhead.…”
Get full text

APPROXIMATELY SINGULAR WAVELET by V. M. Romanchak

“…To illustrate the effectiveness of the numerical approximation algorithm, we consider an example of the quasi-interpolation of the Runge function by wavelets with a uniform distribution of interpolation nodes.…”
Get full text