In this paper,we concerned with the problem of the unicity of meromorphic functions and its derivatives covering certain finite sets at the same points and obtain some results that are extensions of that of K.Tohge an...In this paper,we concerned with the problem of the unicity of meromorphic functions and its derivatives covering certain finite sets at the same points and obtain some results that are extensions of that of K.Tohge and Yi Hongxun etc.,展开更多
When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for comp...When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.展开更多
In complete metric spaces, the common fixed point theorems for sequences of φ-type contraction set-valued mappings are established, and the corresponding random com- mon fixed point theorems for set-valued mappings a...In complete metric spaces, the common fixed point theorems for sequences of φ-type contraction set-valued mappings are established, and the corresponding random com- mon fixed point theorems for set-valued mappings are also obtained.展开更多
Suppose {X,X n,n≥1} are the i.i.d. random variables with values in 2 type Banach space B,S n=∑nk=1X k,φ(x) is a increasing function on [0,+∞), φ(x)→+∞, and φ(x)x is no increasing; then we point out that the cl...Suppose {X,X n,n≥1} are the i.i.d. random variables with values in 2 type Banach space B,S n=∑nk=1X k,φ(x) is a increasing function on [0,+∞), φ(x)→+∞, and φ(x)x is no increasing; then we point out that the cluster set CS n2nφ(n) is ρK, where ρ= lim L 2nφ(n)<+∞, ∫ ∞e -ρ 2φ(x) 1xd x=+∞,X∈WM 2 0, and E‖X‖ 2φ(‖X‖)<+∞.展开更多
In this paper,we give a fixed point theorem for multi-valued composite increasing operators,in partially ordered spaces,which generalizes the results of [1]-[3] and [5]- [8].
In this paper,we give a fixed point theorem for multi-valued composite increasing operators, which generalizes the theorem of the paper [1] under not only multi-valued mappings but also single-valued mappings. And we...In this paper,we give a fixed point theorem for multi-valued composite increasing operators, which generalizes the theorem of the paper [1] under not only multi-valued mappings but also single-valued mappings. And we generalizes the corresponding results of [2]-[5].展开更多
Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propos...Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propose the preconditioned prestack plane-wave least squares reverse time migration （PLSRTM） method with singular spectrum constraint. Singular spectrum analysis （SSA） is used in the preconditioning of the take-off angle-domain common-image gathers （TADCIGs）. In addition, we adopt randomized singular value decomposition （RSVD） to calculate the singular values. RSVD reduces the computational cost of SSA by replacing the singular value decomposition （SVD） of one large matrix with the SVD of two small matrices. We incorporate a regularization term into the preconditioned PLSRTM method that penalizes misfits between the migration images from the plane waves with adjacent angles to reduce the migration noise because the stacking of the migration results cannot effectively suppress the migration noise when the migration velocity contains errors. The regularization imposes smoothness constraints on the TADCIGs that favor differential semblance optimization constraints. Numerical analysis of synthetic data using the Marmousi model suggests that the proposed method can efficiently suppress the artifacts introduced by plane-wave gathers or irregular seismic data and improve the imaging quality of PLSRTM. Furthermore, it produces better images with less noise and more continuous structures even for inaccurate migration velocities.展开更多
The concept of quasi-coincidence of a fuzzy interval value in an interval valued fuzzy set is considered. In fact, this concept is a generalized concept of the quasi-coincidence of a fuzzy point in a fuzzy set. By usi...The concept of quasi-coincidence of a fuzzy interval value in an interval valued fuzzy set is considered. In fact, this concept is a generalized concept of the quasi-coincidence of a fuzzy point in a fuzzy set. By using this new concept, the authors define the notion of interval valued （∈, ∈ Vq）fuzzy h-ideals of hemirings and study their related properties. In addition, the authors also extend the concept of a fuzzy subgroup with thresholds to the concept of an interval valued fuzzy h-ideal with thresholds in hemirings.展开更多
The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G-U,which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edge...The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G-U,which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges.Also,some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.展开更多
A new fixed point theorem and the selection property for upper semi-continuous set-valued mappings in abstract convexity space are established. As their applications the existence of Nash equilibrium for n-person non-...A new fixed point theorem and the selection property for upper semi-continuous set-valued mappings in abstract convexity space are established. As their applications the existence of Nash equilibrium for n-person non-cooperative generalized games is proved.展开更多
文摘In this paper,we concerned with the problem of the unicity of meromorphic functions and its derivatives covering certain finite sets at the same points and obtain some results that are extensions of that of K.Tohge and Yi Hongxun etc.,
基金Project (No. 2004AA420100) supported by the National Hi-TechResearch and Development Program (863) of China
文摘When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.
基金Foundation item： Supported by the Science Foundation from the Ministry of Education of Jiangsu Province（04KJD110168, 06KJBll0107）
文摘In complete metric spaces, the common fixed point theorems for sequences of φ-type contraction set-valued mappings are established, and the corresponding random com- mon fixed point theorems for set-valued mappings are also obtained.
文摘Suppose {X,X n,n≥1} are the i.i.d. random variables with values in 2 type Banach space B,S n=∑nk=1X k,φ(x) is a increasing function on [0,+∞), φ(x)→+∞, and φ(x)x is no increasing; then we point out that the cluster set CS n2nφ(n) is ρK, where ρ= lim L 2nφ(n)<+∞, ∫ ∞e -ρ 2φ(x) 1xd x=+∞,X∈WM 2 0, and E‖X‖ 2φ(‖X‖)<+∞.
文摘In this paper,we give a fixed point theorem for multi-valued composite increasing operators,in partially ordered spaces,which generalizes the results of [1]-[3] and [5]- [8].
文摘In this paper,we give a fixed point theorem for multi-valued composite increasing operators, which generalizes the theorem of the paper [1] under not only multi-valued mappings but also single-valued mappings. And we generalizes the corresponding results of [2]-[5].
基金supported by the National Science and Technology Major Project(No.2016ZX05014-001-008)the National Key Basic Research Program of China(No.2014CB239006)+2 种基金the National Natural Science Foundation of China(Nos.41104069 and 41274124)the Open foundation of SINOPEC Key Laboratory of Geophysics(No.33550006-15-FW2099-0033)the Fundamental Research Funds for Central Universities(No.16CX06046A)
文摘Least squares migration can eliminate the artifacts introduced by the direct imaging of irregular seismic data but is computationally costly and of slow convergence. In order to suppress the migration noise, we propose the preconditioned prestack plane-wave least squares reverse time migration （PLSRTM） method with singular spectrum constraint. Singular spectrum analysis （SSA） is used in the preconditioning of the take-off angle-domain common-image gathers （TADCIGs）. In addition, we adopt randomized singular value decomposition （RSVD） to calculate the singular values. RSVD reduces the computational cost of SSA by replacing the singular value decomposition （SVD） of one large matrix with the SVD of two small matrices. We incorporate a regularization term into the preconditioned PLSRTM method that penalizes misfits between the migration images from the plane waves with adjacent angles to reduce the migration noise because the stacking of the migration results cannot effectively suppress the migration noise when the migration velocity contains errors. The regularization imposes smoothness constraints on the TADCIGs that favor differential semblance optimization constraints. Numerical analysis of synthetic data using the Marmousi model suggests that the proposed method can efficiently suppress the artifacts introduced by plane-wave gathers or irregular seismic data and improve the imaging quality of PLSRTM. Furthermore, it produces better images with less noise and more continuous structures even for inaccurate migration velocities.
基金Supported by the National Natural Science Foundation of China under Grant No.60474022the Key Science Foundation of Education Committee of Hubei Province,China under Grant No.D200729003
文摘The concept of quasi-coincidence of a fuzzy interval value in an interval valued fuzzy set is considered. In fact, this concept is a generalized concept of the quasi-coincidence of a fuzzy point in a fuzzy set. By using this new concept, the authors define the notion of interval valued （∈, ∈ Vq）fuzzy h-ideals of hemirings and study their related properties. In addition, the authors also extend the concept of a fuzzy subgroup with thresholds to the concept of an interval valued fuzzy h-ideal with thresholds in hemirings.
基金supported by the National Natural Science Foundation of China (No.10731040)the Shanghai Leading Academic Discipline Project (No.S30104)
文摘The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G-U,which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges.Also,some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.
基金the National Natural Science Foundation of China(No.10561003)
文摘A new fixed point theorem and the selection property for upper semi-continuous set-valued mappings in abstract convexity space are established. As their applications the existence of Nash equilibrium for n-person non-cooperative generalized games is proved.
