Showing 721 - 740 results of 3,044 for search '"ITER"', query time: 0.08s Refine Results
  1. 721

    A Low-Complexity Decision Feedforward Equalizer Architecture for High-Speed Receivers on Highly Dispersive Channels by Ariel L. Pola, Juan E. Cousseau, Oscar E. Agazzi, Mario R. Hueda

    Published 2013-01-01
    “…Additionally, we propose a theoretical approximation for the error probability in each iteration. In fact, when the number of iteration increases, the error probability in the DFFE tends to approach the DFE. …”
    Get full text
    Article
  2. 722

    GENERAL MODEL AND STABILITY STUDY OF CYLINDIRCAL GRINDING CHATTER (MT) by CHI YuLun, LIU Bin, SHEN YiFeng

    Published 2023-01-01
    “…In this model, Newton iterative method was used to solve the transcendental equation with time delay, Gaussian elimination method was used to improve the iterative convergence speed, the continuation algorithm was used to continuously provide effective initial values to improve the accuracy of the iterative results, and the accurate grinding stability boundary was obtained. …”
    Get full text
    Article
  3. 723

    Solution of the Stochastic Heat Equation with Nonlinear Losses Using Wiener-Hermite Expansion by Mohamed A. El-Beltagy, Noha A. Al-Mulla

    Published 2014-01-01
    “…The finite-volume method (FVM) with Pickard iteration is used to solve the equivalent system iteratively. …”
    Get full text
    Article
  4. 724

    On Particle Swarm Optimization for MIMO Channel Estimation by Christopher Knievel, Peter Adam Hoeher

    Published 2012-01-01
    “…Instead of determining the average iterations needed empirically, a method to calculate the maximum number of iterations is developed, which enables the evaluation of the complexity for a wide range of parameters. …”
    Get full text
    Article
  5. 725

    Active Learning for Constrained Document Clustering with Uncertainty Region by M. A. Balafar, R. Hazratgholizadeh, M. R. F. Derakhshi

    Published 2020-01-01
    “…In each iteration, first, the support vector machine (SVM) is utilized based on the label produced by the current clustering. …”
    Get full text
    Article
  6. 726

    Variational Quantum Simulation: A Case Study for Understanding Warm Starts by Ricard Puig, Marc Drudis, Supanut Thanasilp, Zoë Holmes

    Published 2025-01-01
    “…While our main focus is on this case study of variational quantum simulation, we end by discussing how our results work in other iterative settings.…”
    Get full text
    Article
  7. 727

    Loopback matching algorithm with support set protection by Shu-juan TIAN, Xiao-ping FAN, Ting-rui PEI, Shu YANG, Zhe-tao LI

    Published 2015-09-01
    “…There was a drawback of deleting right support elements in some greedy iterative reconstruction algorithms.To resolve this problem,loopback matching algorithm with support set protection (LM-P) was proposed.First,LM-P ini-tialized elements of non-protected support set based on minimum residual inner product.Second,it computed the projec-tions of observations on the observation sub-matrix corresponding to non-protected support set elements.Then,an ele-ment in non-protected support set with the largest projection was added to the protected support set.An alternative multi-plicative iteration method was employed to obtain the whole protected support set.As to reconstruct a sparse signal whose nonzero elements are normally distributed and the signal sparsity is less than half the number of measurements,experimental results show that the reconstruction accuracy of LM-P algorithm exceeds 86%.For sparse signals with small noise,the reconstruction accuracy of LM-P can maintain over 99 %.Compared with OMP,CoSaMP,SP and GPA algo-rithms,LM-P's observations are smaller.LM-P also has good performance for image reconstruction.greedy iteration;support set;sparse signal;LM-P…”
    Get full text
    Article
  8. 728

    Differential fault attack on LiCi cipher by Weijian CHEN, Haoxiang LUO

    Published 2021-04-01
    “…LiCi lightweight block cipher is a new algorithm proposed in 2017.With advantages of small structure and low energy consumption, LiCi is more suitable for resource-constrained environments such as the internet of things (IoT).In the design document of LiCi, the ability of LiCi algorithm to resist differential attack and linear attack is analyzed, but the resistance of LiCi algorithm to differential fault attack has not been discussed.According to the permutation law of each round iteration of LiCi algorithm, 32-bit key can be recovered by injecting a single bit fault into the left half of the 31st round iteration combined with its differential property.According to the key choreography scheme of the LiCi algorithm, the same differential fault attack was performed on iterations 30th, 29th, 28th, 27th and 26th round to recover all the original keys.The attack requires a total of 48-bit faults, and the computational complexity is 2<sup>32</sup>, which indicates the LiCi algorithm is difficult to resist differential fault attacks.…”
    Get full text
    Article
  9. 729

    The Precompression Processing of LMS Algorithm in Noise Elimination by Pengfei Lin, Chunsheng Lin, Ning Zhang, Xingya wu

    Published 2019-01-01
    “…The precompressed input signal is not only related to the regulator factor α and the current value of the input signal at each iteration but also related to the amplitude of the input signal before this iteration. …”
    Get full text
    Article
  10. 730

    On a Class of Self-Adjoint Compact Operators in Hilbert Spaces and Their Relations with Their Finite-Range Truncations by M. De la Sen

    Published 2013-01-01
    “…The iterated sequences are expanded in separable Hilbert spaces through the use of numerable orthonormal bases.…”
    Get full text
    Article
  11. 731

    Generalized Mixed Equilibria, Variational Inclusions, and Fixed Point Problems by A. E. Al-Mazrooei, A. S. M. Alofi, A. Latif, J.-C. Yao

    Published 2014-01-01
    “…We prove some strong and weak convergence theorems for the proposed iterative algorithms under suitable conditions.…”
    Get full text
    Article
  12. 732

    Convergence Theorems for Infinite Family of Multivalued Quasi-Nonexpansive Mappings in Uniformly Convex Banach Spaces by Aunyarat Bunyawat, Suthep Suantai

    Published 2012-01-01
    “…We introduce an iterative method for finding a common fixed point of a countable family of multivalued quasi-nonexpansive mapping {Ti} in a uniformly convex Banach space. …”
    Get full text
    Article
  13. 733

    Research and design of authenticated encryption algorithm based on AES round function by Guoqiang GAO, Zichen LI

    Published 2020-04-01
    “…The authenticated encryption algorithm guarantees the confidentiality and integrity of the information at the same time,and has extensive research and application prospects in the field of information security.With the mixed integer linear programming (MILP) method,the iterative structure with high efficiency and more active S boxes is searched.Based on this new round iterative function and the generalized Feistel structure,an authenticated encryption algorithm with the ability to resist collision attack,differential attack,linear attack and other attacks was designed and implemented,and the efficiency was twice that of AES-GCM.…”
    Get full text
    Article
  14. 734

    Strong Convergence Theorems for Common Fixed Points of an Infinite Family of Asymptotically Nonexpansive Mappings by Yuanheng Wang

    Published 2014-01-01
    “…In the framework of a real Banach space with uniformly Gateaux differentiable norm, some new viscosity iterative sequences {xn} are introduced for an infinite family of asymptotically nonexpansive mappings Tii=1∞ in this paper. …”
    Get full text
    Article
  15. 735

    Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces

    Published 2006-01-01
    “…First, several basic mathematical concepts involved in the construction and study of Bregman type iterative algorithms are presented from a unified analytic perspective. …”
    Get full text
    Article
  16. 736

    A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2 by Aijing Liu, Guoliang Chen, Xiangyun Zhang

    Published 2013-01-01
    “…We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. …”
    Get full text
    Article
  17. 737

    Computational Methods for Solving Linear Fuzzy Volterra Integral Equation by Jihan Hamaydi, Naji Qatanani

    Published 2017-01-01
    “…Two numerical schemes, namely, the Taylor expansion and the variational iteration methods, have been implemented to give an approximate solution of the fuzzy linear Volterra integral equation of the second kind. …”
    Get full text
    Article
  18. 738

    A Hybrid Extragradient-Like Method for Variational Inequalities, Equilibrium Problems, and an Infinitely Family of Strictly Pseudocontractive Mappings by Yaqin Wang, Hongkun Xu, Xiaoli Fang

    Published 2012-01-01
    “…Then, we obtain a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm. …”
    Get full text
    Article
  19. 739

    Numerical Scheme for Finding Roots of Interval-Valued Fuzzy Nonlinear Equation with Application in Optimization by Ahmed Elmoasry, Mudassir Shams, Naveed Yaqoob, Nasreen Kausar, Yaé Ulrich Gaba, Naila Rafiq

    Published 2021-01-01
    “…In this research article, we propose efficient numerical iterative methods for estimating roots of interval-valued trapezoidal fuzzy nonlinear equations. …”
    Get full text
    Article
  20. 740

    A New Approach to the Approximation of Common Fixed Points of an Infinite Family of Relatively Quasinonexpansive Mappings with Applications by Wei-Qi Deng

    Published 2012-01-01
    “…By using a specific way of choosing the indexes, we propose an iteration algorithm generated by the monotone CQ method for approximating common fixed points of an infinite family of relatively quasinonexpansive mappings. …”
    Get full text
    Article