This paper points out an error in Davidov and Iliopoulos's (Biometrika 100, 778-80) proof of convergence of an iterative algorithm for the proportional likelihood ratio model. It is shown that the iterative algori...
详细信息
This paper points out an error in Davidov and Iliopoulos's (Biometrika 100, 778-80) proof of convergence of an iterative algorithm for the proportional likelihood ratio model. It is shown that the iterative algorithm increases the likelihood in each iteration and converges under mild additional conditions when the odds ratio function is bounded.
The purpose of this paper is to present a new iterative scheme for finding a common solution to a variational inclusion problem with a finite family of accretive operators and a modified system of variational inequali...
详细信息
The purpose of this paper is to present a new iterative scheme for finding a common solution to a variational inclusion problem with a finite family of accretive operators and a modified system of variational inequalities in infinite-dimensional Banach spaces. Under mild conditions, a strong convergence theorem for approximating this common solution is proved. The methods in the paper are novel and different from those in the early and recent literature.
The top-k query is an important type of query for the wireless sensor network. In this paper, we present an iterative algorithm to process the top-k query, which is a distributed algorithm combining the in-network agg...
详细信息
The top-k query is an important type of query for the wireless sensor network. In this paper, we present an iterative algorithm to process the top-k query, which is a distributed algorithm combining the in-network aggregation and the trace back techniques. By using the in-network aggregation technique, the iterative algorithm calculates the current maximum value in the network. By using the trace back technology, the maximum value just calculated is removed from the network. The two steps are repeated k times. As the current maximum value in the network is selected per round, the answer to a top-k query can be obtained after k repetitions. Experimental results show that the iterative algorithm can reduce the number of messages transmitted during the procedure of the top-k query processing.
In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, ba...
详细信息
In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, based on the auxiliary problem, a projection iterative algorithm for SVEP is proposed. Moreover, analysis of convergence of this iterative algorithm is investigated under suitable conditions of continuity and convexity. The main result obtained in this paper generalizes and improves the corresponding ones of Iusem and Sosa [Iusem AN, Sosa W. iterative algorithms for equilibrium problems. Optimization. 2003;52(3):301-316.] and Cheng and Liu [Cheng B, Liu SY. An iterative algorithm for vector equilibrium problems. J. Lanzhou Univ. (Nat. Sci.). 2009;45(5):105-109.].
In this paper, we present a new iterative algorithm with errors to solve the problems of finding zeros of the sum of finitely many m-accretive operators and finitely many alpha-inversely strongly accretive operators i...
详细信息
In this paper, we present a new iterative algorithm with errors to solve the problems of finding zeros of the sum of finitely many m-accretive operators and finitely many alpha-inversely strongly accretive operators in a real smooth and uniformly convex Banach space. Strong convergence theorems are established, which extend the corresponding works given by some authors. Moreover, the relationship among the zero of the sum of m-accretive operator and alpha-inversely strongly accretive operator, the solution of one kind variational inequality, and the solution of the capillarity equation is investigated.
In this paper, a new system of variational inclusions involving set-valued quasi-contractive, lower semi-continuous mappings with nonempty closed and convex values is introduced and studied in real Banach spaces. Firs...
详细信息
In this paper, a new system of variational inclusions involving set-valued quasi-contractive, lower semi-continuous mappings with nonempty closed and convex values is introduced and studied in real Banach spaces. First, both the existence of fixed points of the set-valued quasi-contractive mappings and the solution of the system of variational inclusions are proved. Then, using the existence result, a new iterative algorithm is constructed. And then the strong convergence of the iterative sequences is proved, and the proof is novel. Finally, a numerical example is given to demonstrate the algorithm. Our results improve and extend some known results.
This paper discusses two iterative solutions for a complex matrix equation with two unknowns of the form $ {A_1}V{B_1} + {C_1}W{D_1} + {A_2}\bar{V}{B_2} + {C_2}\bar{W}{D_2} = E $ A1VB1+C1WD1+A2VB2+C2WD2=E. When this m...
详细信息
This paper discusses two iterative solutions for a complex matrix equation with two unknowns of the form $ {A_1}V{B_1} + {C_1}W{D_1} + {A_2}\bar{V}{B_2} + {C_2}\bar{W}{D_2} = E $ A1VB1+C1WD1+A2VB2+C2WD2=E. When this matrix equation is consistent, by using a real inner product in complex matrix space as a tool, solutions for any initial matrices $ {V_1},{W_1} $ V1,W1 may be determined in finite iterative steps without round-off errors. In the same equation, we also consider a real iterative algorithm using a real representation of a complex matrix as a tool. Some lemmas and theorems are given and proven in the context of iterative solutions. A numerical example is provided to show the efficacy of the suggested algorithms.
A Holographic-QR (H-QR) code is a hologram numerically generated from a QR code pattern. When an H-QR hologram is illuminated by a coherent beam, the QR code it represents will be reconstructed as a visually observabl...
详细信息
ISBN:
(纸本)9781479966493
A Holographic-QR (H-QR) code is a hologram numerically generated from a QR code pattern. When an H-QR hologram is illuminated by a coherent beam, the QR code it represents will be reconstructed as a visually observable image. A H-QR code is less sensitive to damage than the classical QR code, but is still unreadable if the defective area is too extensive. In this paper, we propose a fast method to further strengthen the resiliency of the H-QR code to large scale damage. Experimental evaluation demonstrates that with our proposed algorithm, a QR code can be fully reconstructed from a H-QR hologram that has been damaged in over 50% of its area.
In this paper, subcarrier allocation problems of wireless Frequency Division Multiple Access systems is studied. The goal of this paper is to introduce new iterative scheduling algorithm for wireless OFDMA systems. Th...
详细信息
ISBN:
(纸本)9781467385268
In this paper, subcarrier allocation problems of wireless Frequency Division Multiple Access systems is studied. The goal of this paper is to introduce new iterative scheduling algorithm for wireless OFDMA systems. These scheduling algorithm maximizes system throughput and guarantees a minimum quality of service for each user. The proposed scheduler is compared to the most used resource allocation algorithms in terms of performance and computational complexity. Based on the simulation results, we note that the proposed scheduling algorithm improves the wireless OFDMA systems performances compared to the classical scheduling methods.
Since web born-digital images have low resolution and dense text atoms, text region over-merging and miss detection are still two open issues to be addressed. In this paper a novel iterative algorithm is proposed to l...
详细信息
ISBN:
(纸本)9781628418293
Since web born-digital images have low resolution and dense text atoms, text region over-merging and miss detection are still two open issues to be addressed. In this paper a novel iterative algorithm is proposed to locate and segment text regions. In each iteration, the candidate text regions are generated by detecting Maximally Stable Extremal Region (MSER) with diminishing thresholds, and categorized into different groups based on a new similarity graph, and the texted region groups are identified by applying several features and rules. With our proposed overlap checking method the final well-segmented text regions are selected from these groups in all iterations. Experiments have been carried out on the web born-digital image datasets used for robust reading competition in ICDAR 2011 and 2013, and the results demonstrate that our proposed scheme can significantly reduce both the number of over-merge regions and the lost rate of target atoms, and the overall performance outperforms the best compared with the methods shown in the two competitions in term of recall rate and f-score at the cost of slightly higher computational complexity.
暂无评论