Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR by Hui Deng, Jiguo Yu, Dongxiao Yu, Guangshun Li, Baogui Huang

“…For MLS, we propose an algorithm MTMA (maximum tolerance and minimum affectance ), which improves the currently best approximation algorithm by 28%–62% on average. For MWLS, we give an effective heuristic algorithm MWMA (maximum weighted and minimum affectance ), which performs better on improving the throughput and reducing the running time. …”
Get full text

A Collaborative Wireless Access to On-Demand Services by Zohar Naor

“…It is shown that the problem of maximizing the efficiency of distributing a content in a wireless network is NP-hard. An approximation algorithm is therefore used, that for any 0<𝜀<1 finds an approximation solution with a relative accuracy 𝜀. …”
Get full text

Enhancing Path Planning for Autonomous Robots in Large, Obstacle-Crowded Environments: A Practical Improvement to the PRM Algorithm by Shimon Aviram, Eugene Levner

“…Probabilistic roadmap (PRM) approximation algorithm has been successful in solving many motion planning problems. …”
Get full text

Uncertainty evaluation of surface profile measurement error based on adaptive sparse grid polynomial chaos expansion by Ke Zhang, Xinya Zheng, Ruiyu Zhang

“…First, the surface profile error of the car door outer surface is initially evaluated using a NURBS surface fitting and segmentation approximation algorithm. Next, based on the error evaluation results, a polynomial chaos expansion model for the surface profile error is established. …”
Get full text

On the parameterized complexity of computing tree-partitions by Hans L. Bodlaender, Carla Groenland, Hugo Jacob

“…Finally, for the related parameter weighted tree-partition-width, we give a similar approximation algorithm (with ratio now $O(k^{15})$) and show XALP-completeness for the special case where vertices and edges have weight 1.…”
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

Intelligent Reconfigurable surface technique for Multiple Antenna Communication System by Noor Qasim, Ismail Hburi, Haider Salih Al Ammar

“…An iteration strategy called MMSE-MP has been developed, procedures a minimum mean squared error pre-coder (MMSE) approach for the Digital-BF and the Matching Pursuit (sparse approximation algorithm) for the Analog pre-coding, to cope with this complex challenge. …”
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&lt;sub&gt;p&lt;/sub&gt; 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

Early Warning of Low-Frequency Oscillations in Power System Using Rough Set and Cloud Model by Miao Yu, Jinyang Han, Shuoshuo Tian, Jianqun Sun, Honghao Wu, Jiaxin Yan

“…Compared with the existing methods, we have pioneered a synergistic mechanism of discrete attribute screening and continuous probabilistic feature fusion by combining the dynamic attribute approximation algorithm of rough sets with the cloud model, which effectively solves the loss of information caused by the discretization of continuous data in the traditional methods. …”
Get full text

Scalable Nonparametric Supervised Learning for Streaming and Massive Data: Applications in Healthcare Monitoring and Credit Risk by Mohamed Chaouch, Omama M. Al-Hamed

“…Additionally, an online classifier is developed for streaming data, combining online PCA with a kernel-based recursive classifier using a stochastic approximation algorithm. Application to fetal well-being monitoring demonstrates that the online classifier achieves a competitive median misclassification rate (11.92%), comparable to the offline classifier (11.54%) and Random Forest (11.31%), while requiring only 1/15th of the offline classifier&#x2019;s computation time. …”
Get full text

Adaptive Anomaly Detection in Network Flows With Low-Rank Tensor Decompositions and Deep Unrolling by Lukas Schynol, Marius Pesavento

“…We first propose a novel block-successive convex approximation algorithm based on a regularized model-fitting objective where the normal flows are modeled as low-rank tensors and anomalies as sparse. …”
Get full text

A sampling-based winner determination model and algorithm for logistics service procurement auctions under double uncertainty by Mingqiang Yin, Hao Wang, Qiang Liu, Xiaohu Qian, He Zhang, Xianming Lang

“…With the objective of minimizing total cost, a new two-stage stochastic winner determination model under double uncertainty is constructed, which is further transformed into mixed-integer linear programming model by using an improved sample average approximation algorithm based on the chi-square test and the Latin hypercube sampling method. …”
Get full text

FPGA-Based Channel Coding Architectures for 5G Wireless Using High-Level Synthesis by Swapnil Mhaske, Hojin Kee, Tai Ly, Ahsan Aziz, Predrag Spasojevic

“…By splitting the node processing operation in the min-sum approximation algorithm, we achieve pipelining in the layered decoding schedule without utilizing additional hardware resources. …”
Get full text

Implementation Method and Bench Testing of Fractional-Order Biquadratic Transfer Function-Based Mechatronic ISD Suspension by Yujie Shen, Dongdong Qiu, Haolun Xu, Yanling Liu, Kecheng Sun, Xiaofeng Yang, Yan Guo

“…Subsequently, the Oustaloup filter approximation algorithm was utilized to realize the integer-order equivalents of the fractional-order electrical components, and the approximation effectiveness was analyzed through frequency-domain and time-domain simulations. …”
Get full text

Accelerated discovery of high-density pyrazole-based energetic materials using machine learning and density functional theory by Muhammad Tukur Ibrahim, Muktar Musa Ibrahim, Adamu Uzairu, Gideon Adamu Shallangwa, Sani Uba

“…Using genetic function approximation algorithm, pertinent molecular descriptors were identified and used to build robust Quantitative Structure Property Relationship (QSPR) models for predicting crystalline density of energetic materials. …”
Get full text

On the Gap to Channel Capacity of Generalized Low-Density Parity-Check Codes by Dongxu Chang, Qingqing Peng, Guanghui Wang, Guiying Yan, Dawei Yin

“…Secondly, based on the characteristics of GLDPC codes, we develop a Gaussian mixture approximation algorithm to approximate the message distributions in density evolution. …”
Get full text

Spreading Social Influence with both Positive and Negative Opinions in Online Networks by Jing (Selena) He, Meng Han, Shouling Ji, Tianyu Du, Zhao Li

“…Subsequently, we present a greedy approximation algorithm to address the MPINS selection problem. …”
Get full text

Study on Online Correction of Polished Rod Dynamometer Cards and Digitalization Application of Pump Dynamometer Cards by Hukun Yang, Jianhua Ma, Yongqin Dai, Junmin Jia, Yu Lu, Xiyu Zhang, Ruihui Hao

“…Combined with basic well data, a one-dimensional wave equation difference calculation method is used to solve for the pump dynamometer card. An approximation algorithm is employed to achieve rapid calibration of the polished rod dynamometer card and inversion of the pump dynamometer card. …”
Get full text

A Lightweight Transformer-Based Spatiotemporal Analysis Prediction Algorithm for High-Dimensional Meteorological Data by Yinghao Tan, Junfeng Wu, Yihang Liu, Shiyu Shen, Xia Xu, Bin Pan

“…This paper presents the spatiotemporal analysis fitting prediction algorithm (SA-Fit), an approximation algorithm for regional high-dimensional meteorological data prediction. …”
Get full text