In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise c...In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.展开更多
We deal with the properties of incompressible and pairwise incompressible surfaces in knot complements through the application of relevant properties of almost simple topological graphs.We analyze the topological grap...We deal with the properties of incompressible and pairwise incompressible surfaces in knot complements through the application of relevant properties of almost simple topological graphs.We analyze the topological graph invariants associated with surfaces embedded in the complements of alternating and almost alternating knots.Specifically,we prove that the characteristic numbers of these graphs remain invariant under two fundamental transformations(R-move and S^(2)-move).Leveraging the interplay between characteristic numbers and Euler characteristics,and further connecting Euler characteristics to surface genus,we derive novel results regarding the genus of incompressible pairwise incompressible surfaces.Additionally,we establish a discriminant criterion to determine when such surfaces in knot complements admit genus zero.展开更多
Semi-supervised clustering techniques attempt to improve clustering accuracy by utilizing a limited number of labeled data for guidance.This method effectively integrates prior knowledge using pre-labeled data.While s...Semi-supervised clustering techniques attempt to improve clustering accuracy by utilizing a limited number of labeled data for guidance.This method effectively integrates prior knowledge using pre-labeled data.While semi-supervised fuzzy clustering(SSFC)methods leverage limited labeled data to enhance accuracy,they remain highly susceptible to inappropriate or mislabeled prior knowledge,especially in noisy or overlapping datasets where cluster boundaries are ambiguous.To enhance the effectiveness of clustering algorithms,it is essential to leverage labeled data while ensuring the safety of the previous knowledge.Existing solutions,such as the Trusted Safe Semi-Supervised Fuzzy Clustering Method(TS3FCM),struggle with random centroid initialization,fixed neighbor radius formulas,and handling outliers or noise at cluster overlaps.A new framework called Active Safe Semi-Supervised Fuzzy Clustering with Pairwise Constraints Based on Cluster Boundary(AS3FCPC)is proposed in this paper to deal with these problems.It does this by combining pairwise constraints and active learning.AS3FCPC uses active learning to query only the most informative data instances close to the cluster boundaries.It also uses pairwise constraints to enforce the cluster structure,which makes the system more accurate and robust.Extensive test results on diverse datasets,including challenging noisy and overlapping scenarios,demonstrate that AS3FCPC consistently achieves superior performance compared to state-of-the-art methods like TS3FCM and other baselines,especially when the data is noisy and overlaps.This significant improvement underscores AS3FCPC’s potential for reliable and accurate semisupervised fuzzy clustering in complex,real-world applications,particularly by effectively managing mislabeled data and ambiguous cluster boundaries.展开更多
Contrast enhancement in medical images has been vitalsince the prevalence of image representationsin healthcare.In this research,the PRDHMCE(pairwise reversible data hiding for medical images with contrast enhancement...Contrast enhancement in medical images has been vitalsince the prevalence of image representationsin healthcare.In this research,the PRDHMCE(pairwise reversible data hiding for medical images with contrast enhancement)algorithm is proposed as an automatic contrast enhancement(CE)method for medical images based on region ofinterest(ROI)and non-region of interest(NROI).The PRDHMCE algorithm strategically enhances the ROI aftersegmentation using histogram stretching and data embedding.An initial histogram evaluation compares histogrambins with their neighbours to select the bin with the maximum pixel count.The selected bin is set as the point forcontrast stretching with enhancement and secret data embedding in the ROI.The remaining data is embedded inthe NROIwhile reducing image distortions.Experimentalresultsshowthe effectiveness of PRDHMCE in optimallyimproving image contrast and increasing embedding capacity comparedwith existing methods based on qualitativeand objective metricssuch as peak signal-to-noise ratio(PSNR),structuralsimilarity index(SSIM),relative contrasterror(RCE),relative mean brightness error(RMBE)and mean opinion score(MOS).Additionally,PRDHMCErecovers medical images fully without data loss.展开更多
Learning to Rank(L2R)技术是对搜索结果进行排序,是近几年的研究热点。现关于L2R中的PairWise方法进行研究分析,PairWise方法将排序问题转化为二元分类问题,其缺点是只考虑两篇文档的相对顺序,而不考虑文档出现在搜索结果列表中的位置...Learning to Rank(L2R)技术是对搜索结果进行排序,是近几年的研究热点。现关于L2R中的PairWise方法进行研究分析,PairWise方法将排序问题转化为二元分类问题,其缺点是只考虑两篇文档的相对顺序,而不考虑文档出现在搜索结果列表中的位置。另外,不同的查询拥有的文档对数目不同,结果会向拥有文档对较多的查询偏移。对常用的PairWise算法的损失函数及其求解方法、基本思想、算法框架、效用评价以及算法应用进行概括分析。展开更多
We discuss the properties of incompressible pairwise incompressible surfaces in a knot complement by using twist crossing number. Let K be a pretzel knot or rational knot that its twistindex is less than 6, and l...We discuss the properties of incompressible pairwise incompressible surfaces in a knot complement by using twist crossing number. Let K be a pretzel knot or rational knot that its twistindex is less than 6, and let F be an incompressible pairwise incompressible surface in S 3-K. Then F is a punctured sphere.展开更多
In this paper we introduce the concept of pairwise singular sets and pairwise singular maps between pairwise locally compact and pairwise hausdorff spaces and study the properties of pairwise singular maps.
In this article, the authors study some limit properties for sequences of pairwise NQD random variables, which are not necessarily identically distributed. They obtain Baum and Katz complete convergence and the strong...In this article, the authors study some limit properties for sequences of pairwise NQD random variables, which are not necessarily identically distributed. They obtain Baum and Katz complete convergence and the strong stability of Jamison＇s weighted sums for pairwise NQD random variables, which may have different distributions. Some wellknown results are improved and extended.展开更多
The central subject of studying in this paper is incompressible pairwise incompressible surfaces in link complements. Let L be a non-split prime link and let F be an incompressible pairwise incompressible surface in S...The central subject of studying in this paper is incompressible pairwise incompressible surfaces in link complements. Let L be a non-split prime link and let F be an incompressible pairwise incompressible surface in S3 - L. We discuss the properties that the surface F intersects with 2-spheres in S3 - L. The intersection forms a topological graph consisting of a collection of circles and saddle-shaped discs. We introduce topological graphs and their moves （R-move and S2-move）, and define the characteristic number of the topological graph for F∩S2±. The characteristic number is unchanged under the moves. In fact, the number is exactly the Euler Characteristic number of the surface when a graph satisfies some conditions. By these ways, we characterize the properties of incompressible pairwise incompressible surfaces in alternating （or almost alternating） link complements. We prove that the genus of the surface equals zero if the component number of F∩S2＋（or F∩S2-） is less than five and the graph is simple for alternating or almost alternating links. Furthermore, one can prove that the genus of the surface is zero if #（F） ≤8.展开更多
Based on the calculation of all the pairwise entanglements in the n （n ≤ 6）-qubit Heisenberg XX open chain with system impurity, we find an important result： pairwise entanglement can only be transferred by an ent...Based on the calculation of all the pairwise entanglements in the n （n ≤ 6）-qubit Heisenberg XX open chain with system impurity, we find an important result： pairwise entanglement can only be transferred by an entangled pair. The non-nearest pairwise entanglements will have the possibility to exist as long as there has been even number of qubits in their middle. This point indicates that we can obtain longer distance entanglement in a solid system.展开更多
We first obtain the Petrov theorem for pairwise NQD（negative quadrant dependent） random variables which may have different distributions.Some well-known results are improved and extended.Next,we give an example to c...We first obtain the Petrov theorem for pairwise NQD（negative quadrant dependent） random variables which may have different distributions.Some well-known results are improved and extended.Next,we give an example to clarify one of the important properties of sequences of pairwise NQD random variables,so that we can point out some mistakes that have appeared in recent published papers.展开更多
This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming dist...This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.展开更多
Image quality assessment(IQA)is constantly innovating,but there are still three types of stickers that have not been resolved:the“content sticker”-limitation of training set,the“annotation sticker”-subjective inst...Image quality assessment(IQA)is constantly innovating,but there are still three types of stickers that have not been resolved:the“content sticker”-limitation of training set,the“annotation sticker”-subjective instability in opinion scores and the“distortion sticker”-disordered distortion settings.In this paper,a No-Reference Image Quality Assessment(NR IQA)approach is proposed to deal with the problems.For“content sticker”,we introduce the idea of pairwise comparison and generate a largescale ranking set to pre-train the network;For“annotation sticker”,the absolute noise-containing subjective scores are transformed into ranking comparison results,and we design an indirect unsupervised regression based on EigenValue Decomposition(EVD);For“distortion sticker”,we propose a perception-based distortion classification method,which makes the distortion types clear and refined.Experiments have proved that our NR IQA approach Experiments show that the algorithm performs well and has good generalization ability.Furthermore,the proposed perception based distortion classification method would be able to provide insights on how the visual related studies may be developed and to broaden our understanding of human visual system.展开更多
By using the moment inequality, maximal inequality and the truncated method of random variables, we establish the strong law of large numbers of partial sums for pairwise NQD sequences, which extends the corresponding...By using the moment inequality, maximal inequality and the truncated method of random variables, we establish the strong law of large numbers of partial sums for pairwise NQD sequences, which extends the corresponding result of pairwise NQD random variables.展开更多
In a panmictic population of constant size N, random pairs of individuals will have a most recent shared ancestor who lived slightly more than 0.5 log<sub>2</sub>N generations previously, on average. The p...In a panmictic population of constant size N, random pairs of individuals will have a most recent shared ancestor who lived slightly more than 0.5 log<sub>2</sub>N generations previously, on average. The probability that a random pair of individuals will share at least one ancestor who lived 0.5 log<sub>2</sub>N generations ago, or more recently, is about 50%. Those individuals, if they do share an ancestor from that generation, would be cousins of degree (0.5 log<sub>2</sub>N) - 1. Shared ancestry from progressively earlier generations increases rapidly until there is universal pairwise shared ancestry. At that point, every individual has one or more ancestors in common with every other individual in the population, although different pairs may share different ancestors. Those ancestors lived approximately 0.7 log<sub>2</sub>N generations in the past, or more recently. Qualitatively, the ancestries of random pairs have about 50% similarity for ancestors who lived about 0.9 log<sub>2</sub>N generations before the present. That is, about half of the ancestors from that generation belonging to one member of the pair are present also in the genealogy of the other member. Qualitative pairwise similarity increases to more than 99% for ancestors who lived about 1.4 log<sub>2</sub>N generations in the past. Similar results apply to a metric of quantitative pairwise genealogical overlap.展开更多
文摘In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.
基金Supported by the National Natural Science Foundation of China(Grant No.12026411)。
文摘We deal with the properties of incompressible and pairwise incompressible surfaces in knot complements through the application of relevant properties of almost simple topological graphs.We analyze the topological graph invariants associated with surfaces embedded in the complements of alternating and almost alternating knots.Specifically,we prove that the characteristic numbers of these graphs remain invariant under two fundamental transformations(R-move and S^(2)-move).Leveraging the interplay between characteristic numbers and Euler characteristics,and further connecting Euler characteristics to surface genus,we derive novel results regarding the genus of incompressible pairwise incompressible surfaces.Additionally,we establish a discriminant criterion to determine when such surfaces in knot complements admit genus zero.
文摘Semi-supervised clustering techniques attempt to improve clustering accuracy by utilizing a limited number of labeled data for guidance.This method effectively integrates prior knowledge using pre-labeled data.While semi-supervised fuzzy clustering(SSFC)methods leverage limited labeled data to enhance accuracy,they remain highly susceptible to inappropriate or mislabeled prior knowledge,especially in noisy or overlapping datasets where cluster boundaries are ambiguous.To enhance the effectiveness of clustering algorithms,it is essential to leverage labeled data while ensuring the safety of the previous knowledge.Existing solutions,such as the Trusted Safe Semi-Supervised Fuzzy Clustering Method(TS3FCM),struggle with random centroid initialization,fixed neighbor radius formulas,and handling outliers or noise at cluster overlaps.A new framework called Active Safe Semi-Supervised Fuzzy Clustering with Pairwise Constraints Based on Cluster Boundary(AS3FCPC)is proposed in this paper to deal with these problems.It does this by combining pairwise constraints and active learning.AS3FCPC uses active learning to query only the most informative data instances close to the cluster boundaries.It also uses pairwise constraints to enforce the cluster structure,which makes the system more accurate and robust.Extensive test results on diverse datasets,including challenging noisy and overlapping scenarios,demonstrate that AS3FCPC consistently achieves superior performance compared to state-of-the-art methods like TS3FCM and other baselines,especially when the data is noisy and overlaps.This significant improvement underscores AS3FCPC’s potential for reliable and accurate semisupervised fuzzy clustering in complex,real-world applications,particularly by effectively managing mislabeled data and ambiguous cluster boundaries.
基金supported in part by the National Natural Science Foundation of China under Grant No.61662039in part by the Jiangxi Key Natural Science Foundation under No.20192ACBL20031+1 种基金in part by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology(NUIST)under Grant No.2019r070in part by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)Fund.
文摘Contrast enhancement in medical images has been vitalsince the prevalence of image representationsin healthcare.In this research,the PRDHMCE(pairwise reversible data hiding for medical images with contrast enhancement)algorithm is proposed as an automatic contrast enhancement(CE)method for medical images based on region ofinterest(ROI)and non-region of interest(NROI).The PRDHMCE algorithm strategically enhances the ROI aftersegmentation using histogram stretching and data embedding.An initial histogram evaluation compares histogrambins with their neighbours to select the bin with the maximum pixel count.The selected bin is set as the point forcontrast stretching with enhancement and secret data embedding in the ROI.The remaining data is embedded inthe NROIwhile reducing image distortions.Experimentalresultsshowthe effectiveness of PRDHMCE in optimallyimproving image contrast and increasing embedding capacity comparedwith existing methods based on qualitativeand objective metricssuch as peak signal-to-noise ratio(PSNR),structuralsimilarity index(SSIM),relative contrasterror(RCE),relative mean brightness error(RMBE)and mean opinion score(MOS).Additionally,PRDHMCErecovers medical images fully without data loss.
文摘Learning to Rank(L2R)技术是对搜索结果进行排序,是近几年的研究热点。现关于L2R中的PairWise方法进行研究分析,PairWise方法将排序问题转化为二元分类问题,其缺点是只考虑两篇文档的相对顺序,而不考虑文档出现在搜索结果列表中的位置。另外,不同的查询拥有的文档对数目不同,结果会向拥有文档对较多的查询偏移。对常用的PairWise算法的损失函数及其求解方法、基本思想、算法框架、效用评价以及算法应用进行概括分析。
文摘We discuss the properties of incompressible pairwise incompressible surfaces in a knot complement by using twist crossing number. Let K be a pretzel knot or rational knot that its twistindex is less than 6, and let F be an incompressible pairwise incompressible surface in S 3-K. Then F is a punctured sphere.
文摘In this paper we introduce the concept of pairwise singular sets and pairwise singular maps between pairwise locally compact and pairwise hausdorff spaces and study the properties of pairwise singular maps.
基金the National Natural Science Foundation of China(10671149)
文摘In this article, the authors study some limit properties for sequences of pairwise NQD random variables, which are not necessarily identically distributed. They obtain Baum and Katz complete convergence and the strong stability of Jamison＇s weighted sums for pairwise NQD random variables, which may have different distributions. Some wellknown results are improved and extended.
基金Supported by NSF of China (11071106)supported by Liaoning Educational Committee (2009A418)
文摘The central subject of studying in this paper is incompressible pairwise incompressible surfaces in link complements. Let L be a non-split prime link and let F be an incompressible pairwise incompressible surface in S3 - L. We discuss the properties that the surface F intersects with 2-spheres in S3 - L. The intersection forms a topological graph consisting of a collection of circles and saddle-shaped discs. We introduce topological graphs and their moves （R-move and S2-move）, and define the characteristic number of the topological graph for F∩S2±. The characteristic number is unchanged under the moves. In fact, the number is exactly the Euler Characteristic number of the surface when a graph satisfies some conditions. By these ways, we characterize the properties of incompressible pairwise incompressible surfaces in alternating （or almost alternating） link complements. We prove that the genus of the surface equals zero if the component number of F∩S2＋（or F∩S2-） is less than five and the graph is simple for alternating or almost alternating links. Furthermore, one can prove that the genus of the surface is zero if #（F） ≤8.
基金Project supported in part by the National Natural Science Foundation of China （Grant No 10547008）, and the Foundation of Xi＇an Institute of Posts and Telecommunications, China （Grant No 105-0414）.
文摘Based on the calculation of all the pairwise entanglements in the n （n ≤ 6）-qubit Heisenberg XX open chain with system impurity, we find an important result： pairwise entanglement can only be transferred by an entangled pair. The non-nearest pairwise entanglements will have the possibility to exist as long as there has been even number of qubits in their middle. This point indicates that we can obtain longer distance entanglement in a solid system.
基金Supported by the National Natural Science Foundation of China (10671149)
文摘We first obtain the Petrov theorem for pairwise NQD（negative quadrant dependent） random variables which may have different distributions.Some well-known results are improved and extended.Next,we give an example to clarify one of the important properties of sequences of pairwise NQD random variables,so that we can point out some mistakes that have appeared in recent published papers.
基金Supported by the National High-Technology Research and Development Program of China (863 Program)(2006AA01Z422)the National Natural Science Foundation of China(60672102)
文摘This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China, "Research of Visual Perception for Impairments of Color Information in High-Definition Images" (No.20110018110001)
文摘Image quality assessment(IQA)is constantly innovating,but there are still three types of stickers that have not been resolved:the“content sticker”-limitation of training set,the“annotation sticker”-subjective instability in opinion scores and the“distortion sticker”-disordered distortion settings.In this paper,a No-Reference Image Quality Assessment(NR IQA)approach is proposed to deal with the problems.For“content sticker”,we introduce the idea of pairwise comparison and generate a largescale ranking set to pre-train the network;For“annotation sticker”,the absolute noise-containing subjective scores are transformed into ranking comparison results,and we design an indirect unsupervised regression based on EigenValue Decomposition(EVD);For“distortion sticker”,we propose a perception-based distortion classification method,which makes the distortion types clear and refined.Experiments have proved that our NR IQA approach Experiments show that the algorithm performs well and has good generalization ability.Furthermore,the proposed perception based distortion classification method would be able to provide insights on how the visual related studies may be developed and to broaden our understanding of human visual system.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1117100112101001)+2 种基金Natural Science Foundation of Anhui Province(Grant No.1208085QA03)Talents Youth Fund of Anhui Province Universities(Grant No.2012SQRL204)Doctoral Research Start-up Funds Projects of Anhui University
文摘By using the moment inequality, maximal inequality and the truncated method of random variables, we establish the strong law of large numbers of partial sums for pairwise NQD sequences, which extends the corresponding result of pairwise NQD random variables.
文摘In a panmictic population of constant size N, random pairs of individuals will have a most recent shared ancestor who lived slightly more than 0.5 log<sub>2</sub>N generations previously, on average. The probability that a random pair of individuals will share at least one ancestor who lived 0.5 log<sub>2</sub>N generations ago, or more recently, is about 50%. Those individuals, if they do share an ancestor from that generation, would be cousins of degree (0.5 log<sub>2</sub>N) - 1. Shared ancestry from progressively earlier generations increases rapidly until there is universal pairwise shared ancestry. At that point, every individual has one or more ancestors in common with every other individual in the population, although different pairs may share different ancestors. Those ancestors lived approximately 0.7 log<sub>2</sub>N generations in the past, or more recently. Qualitatively, the ancestries of random pairs have about 50% similarity for ancestors who lived about 0.9 log<sub>2</sub>N generations before the present. That is, about half of the ancestors from that generation belonging to one member of the pair are present also in the genealogy of the other member. Qualitative pairwise similarity increases to more than 99% for ancestors who lived about 1.4 log<sub>2</sub>N generations in the past. Similar results apply to a metric of quantitative pairwise genealogical overlap.
