Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satis...Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satisfies ∥V<sub>1</sub>∣ - ∣V<sub>2</sub>∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V<sub>1</sub>, V<sub>2</sub>) such that ∀v ∈ V<sub>1</sub>, at least half minuses one of the neighbors of v are in the V<sub>2</sub>;∀v ∈ V<sub>2</sub>, at least half minuses one of the neighbors of v are in the V<sub>1</sub>. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs.展开更多
In this article,we study Kahler metrics on a certain line bundle over some compact Kahler manifolds to find complete Kahler metrics with positive holomorphic sectional(or bisectional)curvatures.Thus,we apply a strateg...In this article,we study Kahler metrics on a certain line bundle over some compact Kahler manifolds to find complete Kahler metrics with positive holomorphic sectional(or bisectional)curvatures.Thus,we apply a strategy to a famous Yau conjecture with a co-homogeneity one geometry.展开更多
In this note, we show that on Hopf manifold S^(2n-1)×S^1, the non-negativity of the holomorphic bisectional curvature is not preserved along the Chern-Ricci flow.
Indoor positioning is a key technology in today’s intelligent environments,and it plays a crucial role in many application areas.This paper proposed an unscented Kalman filter(UKF)based on the maximum correntropy cri...Indoor positioning is a key technology in today’s intelligent environments,and it plays a crucial role in many application areas.This paper proposed an unscented Kalman filter(UKF)based on the maximum correntropy criterion(MCC)instead of the minimummean square error criterion(MMSE).This innovative approach is applied to the loose coupling of the Inertial Navigation System(INS)and Ultra-Wideband(UWB).By introducing the maximum correntropy criterion,the MCCUKF algorithm dynamically adjusts the covariance matrices of the system noise and the measurement noise,thus enhancing its adaptability to diverse environmental localization requirements.Particularly in the presence of non-Gaussian noise,especially heavy-tailed noise,the MCCUKF exhibits superior accuracy and robustness compared to the traditional UKF.The method initially generates an estimate of the predicted state and covariance matrix through the unscented transform(UT)and then recharacterizes the measurement information using a nonlinear regression method at the cost of theMCC.Subsequently,the state and covariance matrices of the filter are updated by employing the unscented transformation on the measurement equations.Moreover,to mitigate the influence of non-line-of-sight(NLOS)errors positioning accuracy,this paper proposes a k-medoid clustering algorithm based on bisection k-means(Bikmeans).This algorithm preprocesses the UWB distance measurements to yield a more precise position estimation.Simulation results demonstrate that MCCUKF is robust to the uncertainty of UWB and realizes stable integration of INS and UWB systems.展开更多
A basic technique for designing synchronous parallel algorithms, the so-called bisection technique, is proposed. The basic pattern of designing parallel algorithms is described. The relationship between the designing ...A basic technique for designing synchronous parallel algorithms, the so-called bisection technique, is proposed. The basic pattern of designing parallel algorithms is described. The relationship between the designing idea and I Ching (principles of change) is discussed.展开更多
[Objectives]This study was conducted to explore the effects of three different splitting fluids on the bisection effects of bovine morulae and blastocysts.[Methods]With the help of a micromanipulator,the morulae and b...[Objectives]This study was conducted to explore the effects of three different splitting fluids on the bisection effects of bovine morulae and blastocysts.[Methods]With the help of a micromanipulator,the morulae and blastocysts that were routinely produced in the body from the 6 th to the 8 th d were divided into half-embryos in vitro to observe their development,and the half-embryos with a restored morphology and a blastocyst trophoblast were selected.[Results]The success rates of bisection of morulae in PBS+0.2 mol/L sucrose and PBS+5%PVP were significantly higher than that in PBS(P<0.05),and the values in the three liquids were 95.7%,97.2% and 50%,respectively,while the blastocyst development rates and of half-embryos and the pregnancy rates of transplantation were not significantly different(P>0.05).When blastocysts were bisected in PBS+0.2 mol/L sucrose and PBS+5% PVP,the success rates of bisection were significantly higher than that of PBS(P<0.05),and the values in the three liquids were 96.8%,95.5% and 50.0%,respectively,while the development rates of half-embryos and the pregnancy rates of transplantation were not significantly different(P>0.05).The development rate of half-embryos bisected from blastocysts was significantly higher than that of morulae.[Conclusions]This study improves the efficiency of bovine embryo bisection,which is beneficial to the application of embryo bisection technology in cattle breeding.展开更多
A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickl...A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickly produce balanced clusters of similar sizes in the kernel feature space,which makes it efficient and effective for reducing training samples.Theoretical analysis and experimental results on three UCI real data benchmarks both show that,with very short sampling time,the proposed algorithm dramatically accelerates SVM sampling and training while maintaining high test accuracy.展开更多
Due to the exponential growth of video data,aided by rapid advancements in multimedia technologies.It became difficult for the user to obtain information from a large video series.The process of providing an abstract ...Due to the exponential growth of video data,aided by rapid advancements in multimedia technologies.It became difficult for the user to obtain information from a large video series.The process of providing an abstract of the entire video that includes the most representative frames is known as static video summarization.This method resulted in rapid exploration,indexing,and retrieval of massive video libraries.We propose a framework for static video summary based on a Binary Robust Invariant Scalable Keypoint(BRISK)and bisecting K-means clustering algorithm.The current method effectively recognizes relevant frames using BRISK by extracting keypoints and the descriptors from video sequences.The video frames’BRISK features are clustered using a bisecting K-means,and the keyframe is determined by selecting the frame that is most near the cluster center.Without applying any clustering parameters,the appropriate clusters number is determined using the silhouette coefficient.Experiments were carried out on a publicly available open video project(OVP)dataset that contained videos of different genres.The proposed method’s effectiveness is compared to existing methods using a variety of evaluation metrics,and the proposed method achieves a trade-off between computational cost and quality.展开更多
Two residual-based a posteriori error estimators of the nonconforming Crouzeix-Raviart element are derived for elliptic problems with Dirac delta source terms.One estimator is shown to be reliable and efficient,which ...Two residual-based a posteriori error estimators of the nonconforming Crouzeix-Raviart element are derived for elliptic problems with Dirac delta source terms.One estimator is shown to be reliable and efficient,which yields global upper and lower bounds for the error in piecewise W1,p seminorm.The other one is proved to give a global upper bound of the error in Lp-norm.By taking the two estimators as refinement indicators,adaptive algorithms are suggested,which are experimentally shown to attain optimal convergence orders.展开更多
With the natural splitting of a Hamiltonian system into kinetic energy and potential energy,we construct two new optimal thirdorder force-gradient symplectic algorithms in each of which the norm of fourth-order trunca...With the natural splitting of a Hamiltonian system into kinetic energy and potential energy,we construct two new optimal thirdorder force-gradient symplectic algorithms in each of which the norm of fourth-order truncation errors is minimized.They are both not explicitly superior to their no-optimal counterparts in the numerical stability and the topology structure-preserving,but they are in the accuracy of energy on classical problems and in one of the energy eigenvalues for one-dimensional time-independent Schrdinger equations.In particular,they are much better than the optimal third-order non-gradient symplectic method.They also have an advantage over the fourth-order non-gradient symplectic integrator.展开更多
For any complete noncompact Kahler manifold with nonnegative and bounded holomorphic bisectional curvature, we provide the necessary and sufficient condition for the immortal solution to the Ricci flow.
In this paper,we will give an extension of Mok's theorem on the generalized Frankel conjecture under the condition of the orthogonal holomorphic bisectional curvature.
Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex fri...Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex friendly labeling/induces an edge labeling f*E(G)→Z2,defined by f*(xy)=f(x)+f(y)for each xy∈E(G).Let er(i)=\{e∈E(G):f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ep(0):f is friendly}.In this paper,we determine the full friendly index set of a family of cycle union graphs which are edge subdivisions of P2×Pn.展开更多
文摘Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satisfies ∥V<sub>1</sub>∣ - ∣V<sub>2</sub>∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V<sub>1</sub>, V<sub>2</sub>) such that ∀v ∈ V<sub>1</sub>, at least half minuses one of the neighbors of v are in the V<sub>2</sub>;∀v ∈ V<sub>2</sub>, at least half minuses one of the neighbors of v are in the V<sub>1</sub>. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs.
文摘In this article,we study Kahler metrics on a certain line bundle over some compact Kahler manifolds to find complete Kahler metrics with positive holomorphic sectional(or bisectional)curvatures.Thus,we apply a strategy to a famous Yau conjecture with a co-homogeneity one geometry.
基金supported by the Recruitment Program of Global Youth Experts and National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences
文摘In this note, we show that on Hopf manifold S^(2n-1)×S^1, the non-negativity of the holomorphic bisectional curvature is not preserved along the Chern-Ricci flow.
基金supported by the National Natural Science Foundation of China under Grant Nos.62273083 and 61803077Natural Science Foundation of Hebei Province under Grant No.F2020501012.
文摘Indoor positioning is a key technology in today’s intelligent environments,and it plays a crucial role in many application areas.This paper proposed an unscented Kalman filter(UKF)based on the maximum correntropy criterion(MCC)instead of the minimummean square error criterion(MMSE).This innovative approach is applied to the loose coupling of the Inertial Navigation System(INS)and Ultra-Wideband(UWB).By introducing the maximum correntropy criterion,the MCCUKF algorithm dynamically adjusts the covariance matrices of the system noise and the measurement noise,thus enhancing its adaptability to diverse environmental localization requirements.Particularly in the presence of non-Gaussian noise,especially heavy-tailed noise,the MCCUKF exhibits superior accuracy and robustness compared to the traditional UKF.The method initially generates an estimate of the predicted state and covariance matrix through the unscented transform(UT)and then recharacterizes the measurement information using a nonlinear regression method at the cost of theMCC.Subsequently,the state and covariance matrices of the filter are updated by employing the unscented transformation on the measurement equations.Moreover,to mitigate the influence of non-line-of-sight(NLOS)errors positioning accuracy,this paper proposes a k-medoid clustering algorithm based on bisection k-means(Bikmeans).This algorithm preprocesses the UWB distance measurements to yield a more precise position estimation.Simulation results demonstrate that MCCUKF is robust to the uncertainty of UWB and realizes stable integration of INS and UWB systems.
基金Project supported by the National Natural Science Foundation of China.
文摘A basic technique for designing synchronous parallel algorithms, the so-called bisection technique, is proposed. The basic pattern of designing parallel algorithms is described. The relationship between the designing idea and I Ching (principles of change) is discussed.
基金Supported by General Directive Project of Qiqihar City(NYGG-201904)National Beef and Yak Industry Reseach System Construction Project(CARS-37).
文摘[Objectives]This study was conducted to explore the effects of three different splitting fluids on the bisection effects of bovine morulae and blastocysts.[Methods]With the help of a micromanipulator,the morulae and blastocysts that were routinely produced in the body from the 6 th to the 8 th d were divided into half-embryos in vitro to observe their development,and the half-embryos with a restored morphology and a blastocyst trophoblast were selected.[Results]The success rates of bisection of morulae in PBS+0.2 mol/L sucrose and PBS+5%PVP were significantly higher than that in PBS(P<0.05),and the values in the three liquids were 95.7%,97.2% and 50%,respectively,while the blastocyst development rates and of half-embryos and the pregnancy rates of transplantation were not significantly different(P>0.05).When blastocysts were bisected in PBS+0.2 mol/L sucrose and PBS+5% PVP,the success rates of bisection were significantly higher than that of PBS(P<0.05),and the values in the three liquids were 96.8%,95.5% and 50.0%,respectively,while the development rates of half-embryos and the pregnancy rates of transplantation were not significantly different(P>0.05).The development rate of half-embryos bisected from blastocysts was significantly higher than that of morulae.[Conclusions]This study improves the efficiency of bovine embryo bisection,which is beneficial to the application of embryo bisection technology in cattle breeding.
基金National Natural Science Foundation of China (No. 60975083)Key Grant Project,Ministry of Education,China(No. 104145)
文摘A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickly produce balanced clusters of similar sizes in the kernel feature space,which makes it efficient and effective for reducing training samples.Theoretical analysis and experimental results on three UCI real data benchmarks both show that,with very short sampling time,the proposed algorithm dramatically accelerates SVM sampling and training while maintaining high test accuracy.
基金The authors would like to thank Research Supporting Project Number(RSP2024R444)King Saud University,Riyadh,Saudi Arabia.
文摘Due to the exponential growth of video data,aided by rapid advancements in multimedia technologies.It became difficult for the user to obtain information from a large video series.The process of providing an abstract of the entire video that includes the most representative frames is known as static video summarization.This method resulted in rapid exploration,indexing,and retrieval of massive video libraries.We propose a framework for static video summary based on a Binary Robust Invariant Scalable Keypoint(BRISK)and bisecting K-means clustering algorithm.The current method effectively recognizes relevant frames using BRISK by extracting keypoints and the descriptors from video sequences.The video frames’BRISK features are clustered using a bisecting K-means,and the keyframe is determined by selecting the frame that is most near the cluster center.Without applying any clustering parameters,the appropriate clusters number is determined using the silhouette coefficient.Experiments were carried out on a publicly available open video project(OVP)dataset that contained videos of different genres.The proposed method’s effectiveness is compared to existing methods using a variety of evaluation metrics,and the proposed method achieves a trade-off between computational cost and quality.
基金the National Natural Science Foundation of China(Grant No.10771150)the National Basic Research Program of China(Grant No.2005CB321701)the Program for New Century Excellent Talents in University(Grant No.NCET-07-0584)
文摘Two residual-based a posteriori error estimators of the nonconforming Crouzeix-Raviart element are derived for elliptic problems with Dirac delta source terms.One estimator is shown to be reliable and efficient,which yields global upper and lower bounds for the error in piecewise W1,p seminorm.The other one is proved to give a global upper bound of the error in Lp-norm.By taking the two estimators as refinement indicators,adaptive algorithms are suggested,which are experimentally shown to attain optimal convergence orders.
基金supported by the NationalNatural Science Foundation of China (Grant No.10873007)supported by the Science Foundation of Jiangxi Education Bureau (Grant No.GJJ09072)the Program for Innovative Research Team of Nanchang University
文摘With the natural splitting of a Hamiltonian system into kinetic energy and potential energy,we construct two new optimal thirdorder force-gradient symplectic algorithms in each of which the norm of fourth-order truncation errors is minimized.They are both not explicitly superior to their no-optimal counterparts in the numerical stability and the topology structure-preserving,but they are in the accuracy of energy on classical problems and in one of the energy eigenvalues for one-dimensional time-independent Schrdinger equations.In particular,they are much better than the optimal third-order non-gradient symplectic method.They also have an advantage over the fourth-order non-gradient symplectic integrator.
基金supported by the Fund of Department of Education of Fujian Province(No.JA04266)the National Natural Science Foundation of China{Grant No.10271089)STC of Shanghai(No.03JC1402).
文摘For any complete noncompact Kahler manifold with nonnegative and bounded holomorphic bisectional curvature, we provide the necessary and sufficient condition for the immortal solution to the Ricci flow.
基金supported by the Young Faculty Career Start Program(Grant No.34000-3171917)Natural Science Foundation of Guangdong Province (Grant No.9451027501002600)National Natural Science Foundation of China (Grant No.10901165)
文摘In this paper,we will give an extension of Mok's theorem on the generalized Frankel conjecture under the condition of the orthogonal holomorphic bisectional curvature.
基金This work was supported partly by the National Natural Science Foundation of China(Grant Nos.11801149,11801148)S.Wu was also partially supported by the Doctoral Fund of Henan Polytechnic University(B2018-55).
文摘Let G be a connected simple graph with vertex set V(G)and edge set E(G).A binary vertex labeling f:V(G)→Z2,is said to be friendly if the number of vertices with different labels differs by at most one.Each vertex friendly labeling/induces an edge labeling f*E(G)→Z2,defined by f*(xy)=f(x)+f(y)for each xy∈E(G).Let er(i)=\{e∈E(G):f*(e)=i}|.The full friendly index set of G,denoted by FFI(G),is the set{ef*(1)-ep(0):f is friendly}.In this paper,we determine the full friendly index set of a family of cycle union graphs which are edge subdivisions of P2×Pn.
