The Structure of Disjoint Groups of Continuous Functions by Hojjat Farzadfard, B. Khani Robati

“…We will show that (1) each group of the second type is conjugate, via a specific homeomorphism, to a piecewise linear group of the same type; (2) each group of the third type is a subgroup of a continuous disjoint iteration group. We conclude the Zdun's result on the structure of disjoint iteration groups of continuous functions as special case of our results.…”
Get full text

Algorithms for calculation damage processes by Aleksandr Dmitrievich Nikitin, Nikolay G. Burago, Ilia S. Nikitin, Boris A. Stratula

“…Implicit schemes are implemented using iterations of the conjugate gradient method, with the calculation of each iteration exactly coinciding with the calculation of the time step for two-layer explicit schemes. …”
Get full text

3D Large-Pose Face Alignment Method Based on the Truncated Alexnet Cascade Network by Qian Zhang, Hao Zheng, Tao Yan, Jiehui Li

“…Sending the intermediate parameter which is the result of each iteration into CNN and iterating repeatedly to optimize the pose parameter in order to get more accurate results of face alignment. …”
Get full text

Channel estimation for ambient Internet of things by WANG Ruoheng, DONG Lan, LIU Ming, WANG Gongpu, AI Bo

“…In practical applications of AIoT, there existed strong self-interference caused by phase noise and spurs, which brought about new challenges for channel estimation. Therefore, an iterative channel estimator considering phase noise and spurs were designed for the AIoT system with two nodes. …”
Get full text

A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps by Yamna Achik, Asmaa Idmbarek, Hajar Nafia, Imane Agmour, Youssef El foutayeni

“…The major drawback of many existing methods resides in the fact that, for large systems, they require a large number of operations during each iteration; also, they consume large amounts of memory and computation time. …”
Get full text

Extended Perturbed Mixed Variational-Like Inequalities for Fuzzy Mappings by Muhammad Bilal Khan, Muhammad Aslam Noor, Khalida Inayat Noor, Ahmad Termimi Ab Ghani, Lazim Abdullah

“…Some advanced and innovative iterative algorithms are also obtained, and the convergence criterion of iterative sequences generated by algorithms is also proven. …”
Get full text

Convergence Analysis of New Construction Explicit Methods for Solving Equilibrium Programming and Fixed Point Problems by Chainarong Khunpanuk, Nuttapol Pakkaranang, Bancha Panyanak

“…In this paper, we present improved iterative methods for evaluating the numerical solution of an equilibrium problem in a Hilbert space with a pseudomonotone and a Lipschitz-type bifunction. …”
Get full text

Blind Turbo equalization algorithm based on hidden Markov model for continuous phase modulation signals by Kai ZHONG, Hua PENG, Lin-dong GE

“…The algorithm improved the equalization performance by applying the soft-output Viterbi algorithm(SOVA) within an EM iteration. Simultaneously, a soft infor-mation iterative process was used for further improvement of the system performance at a low signal-to-noise ratio. …”
Get full text

On Convergence Results for Lipschitz Pseudocontractive Mappings by Shin Min Kang, Arif Rafiq

“…We establish the strong convergence for the Ishikawa iteration scheme associated with Lipschitz pseudocontractive mappings in real Banach spaces. …”
Get full text

SegChaNet: A Novel Model for Lung Cancer Segmentation in CT Scans by Mehmet Akif Cifci

“…The model has learned the dense-feature extraction in lung abnormalities, while iterative downsampling followed by iterative upsampling causes the network to remain invariant to the size of the dense abnormality. …”
Get full text

Yosida Complementarity Problem with Yosida Variational Inequality Problem and Yosida Proximal Operator Equation Involving XOR-Operation by Rais Ahmad, Arvind Kumar Rajpoot, Imran Ali, Ching-Feng Wen

“…Comparing different iterations, a computational table is assembled and some graphs are plotted to show the convergence of iterative sequences for different initial values.…”
Get full text

Self-Adaptive Predictor-Corrector Approach for General Variational Inequalities Using a Fixed-Point Formulation by Kubra Sanaullah, Saleem Ullah, Muhammad Shoaib Arif, Kamaleldin Abodayeh, Rabia Fayyaz

“…We introduced a new iterative method based on a self-adaptive predictor-corrector approach for finding a solution to the GVI. …”
Get full text

Dynamic adaptive trust evaluation model based on interaction-aware by Feng LI, Li-min SHEN, Ya-li SI, Jing-chun NIU

“…A dynamic adaptive trust evaluation model was established based on interaction-aware.The historical interaction window and trustworthy recommendation number was introduced in overall trust evaluation method,which overcomes the shortage of traditional models that lack the capacity to interaction-aware.The direct trust accumulation method based on interaction satisfaction degree iterative calculation was proposed,which achieved the incentive and penalty iterative strategy based on entity stability factor,and effectively inhibits malicious entities with camouflage.A synthetical recommendation trust aggregating method based on combination of direct and indirect recommendation trust was given,which solved the accuracy low and unreliable problems of traditional recommendation methods by introducing entity familiarity factor and scoring similarity factor.Simulation results show that,compared to the existing trust model,the model can effectively improve the accuracy of trust evaluation,and can provide a better capacity of resisting collusive entities.…”
Get full text

RSS localization algorithm based on second-order cone programming in non-line-of-sight environment by Xiaoping JIN, Jun LIANG, Shaofeng XIE

“…Aiming at the problem that the accuracy of localization using received signal strength (RSS) in wireless sensor network is insufficient in non-line-of-sight (NLOS) environment, a new robust localization algorithm based on second-order cone programming (SOCP) was proposed.Based on the assumption of the upper bound of NLOS biases, a location equation with robustness to NLOS biases was constructed to suppress the interference of NLOS biases, then convex optimization was used to transform the robust localization problem into a second-order cone programming problem with the intention of accurate estimation, thereby improved the localization accuracy.In addition, the localization problem was extended to the case of unknown transmission power, and an iterative SOCP algorithm was proposed.Simulation results show that the proposed algorithm can effectively solve the problems existing in NLOS localization, and the localization accuracy is better than Newton iteration method, UT method and SOCP method.…”
Get full text

Modified Homotopy Perturbation Method and Approximate Solutions to a Class of Local Fractional Integrodifferential Equations by Bo Xu, Sheng Zhang

“…In the process of solving, two initial solutions are selected for the iterative operation of local fractional HPM. One of the initial solutions has a critical condition of convergence and divergence related to the fractional order, and the other converges directly to the real solution. …”
Get full text

Energy-efficient optimal algorithm based on uplink multi-user very large MIMO system by UYing H, IBao-feng J, UANGYong-ming H, UFei Y, ANGLV-xi Y

“…Using the energy efficiency lower bound as the optimization criterion,a resource allocation algorithm was investigated under uplink multi-user very large MIMO systems.Specifically,both the number of antenna arrays at the BS and the transmit data rate at the user are adjusted to maximize the energy efficiency,in which the power consumption accounts for both transmit power and circuit power,meanwhile the BS uses a zero forcing(ZF) receiver.The existence of a unique globally optimal resource allocation solution was demonstrated by exploiting the properties of objective function.Furthermore,by transforming the originally fractional optimization problem into an equivalent subtractive form using the properties of fractional programming,an iterative resource allocation algorithm was developed to achieve the optimum was developed.Simulation results show that the algorithm converge to a near optimal solution only with a small number of iterations.…”
Get full text

Recognizing human activities from smartphone sensors using hierarchical continuous hidden Markov models by Charissa Ann Ronao, Sung-Bae Cho

“…This kind of system architecture not only enables the use of different feature subsets on different subclasses, which effectively reduces feature computation overhead, but also allows for varying number of states and iterations. Experiments show that the hierarchical structure dramatically increases classification performance. …”
Get full text

Blind adaptive matching pursuit algorithm for signal reconstruction based on sparsity trial and error by Wen-biao TIAN, Zheng FU, Guo-sheng RUI

“…Compressed sensing is a novel signal processing theory that it introduces a novel way of acquiring compressible signals,the test times of existing sparsity trial and error algorithms were always large.The novel algorithm,blind sparsity adaptive matching pursuit (BSAMP) was proposed,could recover the original signal fast in the case of unknown sparsity.Firstly,the range of sparsity was determined,and each time half of values in current range were eliminated by trial and error test.Secondly,the number of atoms was twice the sparsity,which was united with the set of signal approximation support (got by last iteration) and then reconstructed the signal by solving least-squares problems.Last but not least,the least-squares approximation was pruned by weakly matching for next iteration.The results of simulation show that the novel algorithm can reconstruct signal faster and get larger recovery probability than other similar algorithms in the same conditions.…”
Get full text

User-centric energy efficiency fairness in backscatter-assisted wireless powered communication network by Yinghui YE, Liqin SHI, Guangyue LU

“…In order to address the unfair user-centric energy efficiency (EE) problem caused by channel difference in the backscatter-assisted wireless powered communication network,a resource allocation scheme was proposed.Firstly,a mixed integer nonconvex fractional programming problem was formulated to maximize the minimum user-centric EE,subject to the quality of service and energy-causality constraints.Based on the generalized fractional programming theory,the original problem was transformed into a mixed integer nonconvex subtraction problem.With the aid of the slack variable,the proof by contradiction,the auxiliary variable and the mixed integer nonconvex subtraction problem were further transformed into an equivalent convex problem.Finally,an iterative algorithm was proposed to obtain the optimal solutions.Computer simulations validated the quick convergence of the proposed iterative algorithm,and that the developed resource allocation scheme efficiently guarantees the fairness among users in terms of EE.…”
Get full text

Energy-efficient resource allocation algorithm for massive MIMO OFDMA downlink system by Ying HU, Bao-feng JI, Yong-ming HUANG, Fei YU, Lv-xi YANG

“…An algorithm is proposed for energy-efficient resource allocation scheme in massive MIMO OFDMA downlink mobile communication system.A mathematical formulation of optimization issue is provided with the objective of maximizing system energy efficiency lower bound under the minimum data rate requirement of user,meanwhile the BS uses a zero-forcing(ZF) precoding.And then for optimizing energy efficiency function,the bandwidth allocation,power allocation and the number of antenna arrays at the BS are adjusted synchronously.First,an iterative algorithm derived from optimality condition for bandwidth assignment is proposed.Second,the properties of fractional programming and convex optimization are used to maximize the energy efficiency.Specifically,both the number of antenna arrays at the BS and the transmit data rate at the user are adjusted.Simulation results show that the proposed schemes not only have less iteration number but also have good perform for system energy efficiency and throughput.…”
Get full text