A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence o...A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence of the algorithm is discussed and all example is given.展开更多
Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ...Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.展开更多
Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubit...Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O（n） messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.展开更多
Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltage...Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.展开更多
In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined...In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined by the iterative method converges strongly to a common element of the set of fixed points,which is the unique solution of the variational inequality<(λφ−νF)z,jq(z−z)>≤0,for z∈⋂_(i=1)^(∞)Γ(S_(i)).The results introduced in our work extend to some corresponding theorems.展开更多
By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative a...By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative algorithm to compute approximate solutions are proved in Hilbert spaces. The obtained result is a improvement over and generalization of the main theorem proposed by Ding.展开更多
The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but ba...The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].展开更多
The purpose of this paper is to study necessary and su？cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Bana...The purpose of this paper is to study necessary and su？cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Banach spaces. The results presented in this paper improve and extend the recent ones announced by [2–7].展开更多
In this paper, we first introduce a new class of generalized accretive operators named （H,η）-accretive in Banach space. By studying the properties of （H,η）-accretive, we extend the concept of resolvent operators...In this paper, we first introduce a new class of generalized accretive operators named （H,η）-accretive in Banach space. By studying the properties of （H,η）-accretive, we extend the concept of resolvent operators associated with m-accretive operators to the new （H,η）-accretive operators. In terms of the new resolvent operator technique, we prove the existence and uniqueness of solutions for this new system of variational inclusions. We also construct a new algorithm for approximating the solution of this system and discuss the convergence of the sequence of iterates generated by the algorithm.展开更多
A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for sol...A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.展开更多
A novel wavelength modulation spectroscopy sensor for studying gas properties near 1.4 μm is developed, validated and used in a direct-connect supersonic combustion test facility. In this sensor there are two H2O tra...A novel wavelength modulation spectroscopy sensor for studying gas properties near 1.4 μm is developed, validated and used in a direct-connect supersonic combustion test facility. In this sensor there are two H2O transitions near 7185.60 cm^-1 and 7454.45 cm^-1 that are used to enable the measurements along the line-of-sight. According to an iterative algorithm, the gas pressure, temperature and species mole fraction can be measured simultaneously. The new sensor is used in the isolator and extender of the supersonic combustion test facility. In the isolator, the sensor resolves the transient and measured pressure, temperature and H2O mole fraction with accuracies of 2.5%, 8.2%, and 7.2%, respectively. Due to the non-uniform characteristic in the extender, the measured results cannot precisely characterize gas properties, but they can qualitatively describe the distinctions of different zones or the changes or fluctuations of the gas parameters.展开更多
Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudaf...Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.展开更多
In this paper, an efficient thermal analysis method is presented for large scale compound semiconductor integrated circuits based on a heterojunction bipolar transistor with considering the change of thermal conductiv...In this paper, an efficient thermal analysis method is presented for large scale compound semiconductor integrated circuits based on a heterojunction bipolar transistor with considering the change of thermal conductivity with temperature.The influence caused by the thermal conductivity can be equivalent to the increment of the local temperature surrounding the individual device. The junction temperature for each device can be efficiently calculated by the combination of the semianalytic temperature distribution function and the iteration of local temperature with high accuracy, providing a temperature distribution for a full chip. Applying this method to the InP frequency divider chip and the GaAs analog to digital converter chip, the computational results well agree with the results from the simulator COMSOL and the infrared thermal imager respectively. The proposed method can also be applied to thermal analysis in various kinds of semiconductor integrated circuits.展开更多
In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all ...In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all elements of each column of the binary parity-check matrix H corresponding to the original code with the same nonzero element of any field, the first class of nonbinary LDPC codes with flexible field order is proposed. The second method is to replace the nonzero elements of some columns in H with different nonzero field elements in a given field, and then another class of nonbinary LDPC codes with various rates is obtained. Simulation results show that the proposed nonbinary LDPC codes perform well over the AWGN channel with the iterative decoding algorithms.展开更多
Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entangleme...Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.展开更多
A system of generalized mixed equilibrium-like problems is introduced and the existence of its solutions is shown by using the auxiliary principle technique in Hilbert spaces.
In this paper,a perturbed iterative algorithm for finding approximate solutions of variational inclusions for fuzzy mapping,is presented and a convergence result which includes,as a special case,some known results in ...In this paper,a perturbed iterative algorithm for finding approximate solutions of variational inclusions for fuzzy mapping,is presented and a convergence result which includes,as a special case,some known results in this field,is given.展开更多
A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the enco...A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.展开更多
A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the sol...A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.展开更多
Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information belo...Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.展开更多
基金Supported by the National Natural Science Foundation of China
文摘A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence of the algorithm is discussed and all example is given.
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62025110 and 62101308).
文摘Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11147174 and 61068001)the Talent Program of Yanbian University,China (Grant No. 950010001)
文摘Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O（n） messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.
基金supported by the National Key Scientific and Research Equipment Development Project of China(Grant No.ZDYZ2013-2)the National Natural Science Foundation of China(Grant No.11173008)the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program,China(Grant No.2012JQ0012)
文摘Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.
基金supported by the National Natural Science Foundation of China(12001416,11771347 and 12031003)the Natural Science Foundations of Shaanxi Province(2021JQ-678).
文摘In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined by the iterative method converges strongly to a common element of the set of fixed points,which is the unique solution of the variational inequality<(λφ−νF)z,jq(z−z)>≤0,for z∈⋂_(i=1)^(∞)Γ(S_(i)).The results introduced in our work extend to some corresponding theorems.
文摘By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative algorithm to compute approximate solutions are proved in Hilbert spaces. The obtained result is a improvement over and generalization of the main theorem proposed by Ding.
文摘The classical Gerchberg-Saxton algorithm is introduced into the image recovery in fractional Fourier domain after adaptation. When this algorithm is applied directly, its performance is good for smoothed image, but bad for unsmoothed image. Based on the diversity of fractional Fourier transform on its orders, this paper suggests a novel iterative algorithm, which extracts the information of the original image from amplitudes of its fractional Fourier transform at two orders. This new algorithm consists of two independent Gerchberg-Saxton procedures and an averaging operation in each circle. Numerical simulations are carried out to show its validity for both smoothed and unsmoothed images with most pairs of orders in the interval [0, 1].
基金supported by the National Natural Science Foun-dation of China (11071169)the Natural Science Foundation of Zhejiang Province (Y6110287)
文摘The purpose of this paper is to study necessary and su？cient condition for the strong convergence of a new parallel iterative algorithm with errors for two finite families of uniformly L-Lipschitzian mappings in Banach spaces. The results presented in this paper improve and extend the recent ones announced by [2–7].
文摘In this paper, we first introduce a new class of generalized accretive operators named （H,η）-accretive in Banach space. By studying the properties of （H,η）-accretive, we extend the concept of resolvent operators associated with m-accretive operators to the new （H,η）-accretive operators. In terms of the new resolvent operator technique, we prove the existence and uniqueness of solutions for this new system of variational inclusions. We also construct a new algorithm for approximating the solution of this system and discuss the convergence of the sequence of iterates generated by the algorithm.
基金supported by the Scientific Research Fun of Sichuan Normal University (11ZDL01)the Sichuan Province Leading Academic Discipline Project (SZD0406)
文摘A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.
基金supported by the Young Scientists Fund of the National Natural Science Foundation of China(Grant No.21403299)
文摘A novel wavelength modulation spectroscopy sensor for studying gas properties near 1.4 μm is developed, validated and used in a direct-connect supersonic combustion test facility. In this sensor there are two H2O transitions near 7185.60 cm^-1 and 7454.45 cm^-1 that are used to enable the measurements along the line-of-sight. According to an iterative algorithm, the gas pressure, temperature and species mole fraction can be measured simultaneously. The new sensor is used in the isolator and extender of the supersonic combustion test facility. In the isolator, the sensor resolves the transient and measured pressure, temperature and H2O mole fraction with accuracies of 2.5%, 8.2%, and 7.2%, respectively. Due to the non-uniform characteristic in the extender, the measured results cannot precisely characterize gas properties, but they can qualitatively describe the distinctions of different zones or the changes or fluctuations of the gas parameters.
基金supported by National Natural Science Foundation of China(61503385)Fundamental Research Funds for the Central Universities of China(3122016L002)
文摘Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.
基金Project supported by the Advance Research Foundation of China(Grant No.9140Axxx501)the National Defense Advance Research Project,China(Grant No.3151xxxx301)+1 种基金the Frontier Innovation Program,China(Grant No.48xx4)the 111 Project,China(Grant No.B12026)
文摘In this paper, an efficient thermal analysis method is presented for large scale compound semiconductor integrated circuits based on a heterojunction bipolar transistor with considering the change of thermal conductivity with temperature.The influence caused by the thermal conductivity can be equivalent to the increment of the local temperature surrounding the individual device. The junction temperature for each device can be efficiently calculated by the combination of the semianalytic temperature distribution function and the iteration of local temperature with high accuracy, providing a temperature distribution for a full chip. Applying this method to the InP frequency divider chip and the GaAs analog to digital converter chip, the computational results well agree with the results from the simulator COMSOL and the infrared thermal imager respectively. The proposed method can also be applied to thermal analysis in various kinds of semiconductor integrated circuits.
基金supported in part by National Basic Research Program of China under Grant No.2012CB316100National Natural Science Foundation of China under Grants 61372074 and 91438101+1 种基金Joint Funds of the National Natural Science Foundation of China under Grant No.U1504601Science and Technology on Communication Networks Laboratory under Grant KX132600032
文摘In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all elements of each column of the binary parity-check matrix H corresponding to the original code with the same nonzero element of any field, the first class of nonbinary LDPC codes with flexible field order is proposed. The second method is to replace the nonzero elements of some columns in H with different nonzero field elements in a given field, and then another class of nonbinary LDPC codes with various rates is obtained. Simulation results show that the proposed nonbinary LDPC codes perform well over the AWGN channel with the iterative decoding algorithms.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60972071 and 11375152)
文摘Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.
文摘A system of generalized mixed equilibrium-like problems is introduced and the existence of its solutions is shown by using the auxiliary principle technique in Hilbert spaces.
文摘In this paper,a perturbed iterative algorithm for finding approximate solutions of variational inclusions for fuzzy mapping,is presented and a convergence result which includes,as a special case,some known results in this field,is given.
文摘A new method for the construction of the high performance systematic irregular low-density paritycheck （LDPC） codes based on the sparse generator matrix （G-LDPC） is introduced. The code can greatly reduce the encoding complexity while maintaining the same decoding complexity as traditional regular LDPC （H-LDPC） codes defined by the sparse parity check matrix. Simulation results show that the performance of the proposed irregular LDPC codes can offer significant gains over traditional LDPC codes in low SNRs with a few decoding iterations over an additive white Gaussian noise （AWGN） channel.
文摘A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.
基金supported by the National Natural Science Foundation of China,Grant Number 41961060by the Program for Innovative Research Team (in Science and Technology) in the University of Yunnan Province,Grant Number IRTSTYN+1 种基金by the Scientific Research Fund Project of the Education Department of Yunnan Province,Grant Numbers 2020J0256 and 2021J0438by the Postgraduate Scientific Research and Innovation Fund Project of Yunnan Normal University,Grant Number YJSJJ21-A08
文摘Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.
