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.展开更多
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement...Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.展开更多
The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is propo...The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is proposed. IBA has two steps. The first step is the 1 stknot point planning under lower set position accuracy; the second step is the 2nd knot pointplanning that inherits the results of the 1st planning under higher set position accuracy. Thesimulation results reveal that the number of inverse kinematical calculation (IKC) caused by IBA isdecreased compared with BA. IBA is more efficient to plan knot points.展开更多
The separation-of-variable(SOV)methods,such as the improved SOV method,the variational SOV method,and the extended SOV method,have been proposed by the present authors and coworkers to obtain the closed-form analytica...The separation-of-variable(SOV)methods,such as the improved SOV method,the variational SOV method,and the extended SOV method,have been proposed by the present authors and coworkers to obtain the closed-form analytical solutions for free vibration and eigenbuckling of rectangular plates and circular cylindrical shells.By taking the free vibration of rectangular thin plates as an example,this work presents the theoretical framework of the SOV methods in an instructive way,and the bisection–based solution procedures for a group of nonlinear eigenvalue equations.Besides,the explicit equations of nodal lines of the SOV methods are presented,and the relations of nodal line patterns and frequency orders are investigated.It is concluded that the highly accurate SOV methods have the same accuracy for all frequencies,the mode shapes about repeated frequencies can also be precisely captured,and the SOV methods do not have the problem of missing roots as well.展开更多
To provide an energy-efficient and slab-demand-compliant rolling delay strategy,the simulation software is utilized to calculate the rolling delay process of the reheating furnace.Based on energy consumption evaluatio...To provide an energy-efficient and slab-demand-compliant rolling delay strategy,the simulation software is utilized to calculate the rolling delay process of the reheating furnace.Based on energy consumption evaluation,two optimization methods were employed.The bisection approach uses the needs of the slab to estimate the rolling delay temperature,and the golden section search method uses the energy consumption analysis of the slab to determine the high-temperature insulation duration.Generally,the slab closest to the discharge position in the control zone is selected as the optimization target.The optimized slab does not show a significant temperature rise after the end of the rolling delay process.When comparing the optimized rolling delay strategies with the traditional ones,the optimized rolling delay strategies not only meet the output requirements for slabs but also offer significant advantages in terms of energy efficiency,and this advantage increases with rolling delay time.展开更多
High-speed milling(HSM)is advantageous for machining high-quality complex-structure surface components with various materials.Identifying and estimating cutting force signals for characterizing HSM is of high signific...High-speed milling(HSM)is advantageous for machining high-quality complex-structure surface components with various materials.Identifying and estimating cutting force signals for characterizing HSM is of high significance.However,considering the tool runout and size effects,many proposed models focus on the material and mechanical characteristics.This study presents a novel approach for predicting micromilling cutting forces using a semianalytical multidimensional model that integrates experimental empirical data and a mechanical theoretical force model.A novel analytical optimization approach is provided to identify the cutting forces,classify the cutting states,and determine the tool runout using an adaptive algorithm that simplifies modeling and calculation.The instantaneous un-deformed chip thickness(IUCT)is determined from the trochoidal trajectories of each tool flute and optimized using the bisection method.Herein,the computational efficiency is improved,and the errors are clarified.The tool runout parameters are identified from the processed displacement signals and determined from the preprocessed vibration signals using an adaptive signal processing method.It is reliable and stable for determining tool runout and is an effective foundation for the force model.This approach is verified using HSM tests.Herein,the determination coefficients are stable above 0.9.It is convenient and efficient for achieving the key intermediate parameters(IUCT and tool runout),which can be generalized to various machining conditions and operations.展开更多
The notion of n-transitivity can be carried over from groups of diffeomorphisms on a manifold M to groups of bisections of a Lie groupoid over M. The main theorem states that the n-transitivity is fulfilled for all n ...The notion of n-transitivity can be carried over from groups of diffeomorphisms on a manifold M to groups of bisections of a Lie groupoid over M. The main theorem states that the n-transitivity is fulfilled for all n ∈N by an arbitrary group of Cr-bisections of a Lie groupoid F of class Cr, where 1 ≤ r ≤ ω, under mild conditions. For instance, the group of all bisections of any Lie groupoid and the group of all Lagrangian bisections of any symplectic groupoid are n-transitive in the sense of this theorem. In particular, if F is source connected for any arrow γ∈ Г, there is a bisection passing through γ.展开更多
In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require ...In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require storing the binary refinement tree explicitly. Instead, the structure is implicitly contained in a special ordering of triangular elements. Numerical experiments demonstrate that the proposed coarsening algorithm is efficient when applied for multilevel preconditioners and mesh adaptivity for time-dependent problems.展开更多
We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed cu...We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed curve. The existence of bisections through more than one prescribed point is also discussed. We give some interesting applications of these results.展开更多
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.
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.展开更多
Judicious bisection of hypergraphs asks for a balanced bipartition of the vertex set that optimizes several quantities simultaneously. In this paper, we prove that if G is a hypergraph with n vertices and ni edges of ...Judicious bisection of hypergraphs asks for a balanced bipartition of the vertex set that optimizes several quantities simultaneously. In this paper, we prove that if G is a hypergraph with n vertices and ni edges of size i for i = 1, 2,…, k, then G admits a bisection in which each vertex class spans at mostm1/2＋1/4m2＋…＋（1/2^k）mk＋o（m1＋…＋mk）edges, where G is dense enough or △（G） =o（n） but has no isolated vertex, which turns out to be a bisection version of a conjecture proposed by Bollobas and Scott.展开更多
The authors show that the 2-non-negative traceless bisectional curvature is preserved along the Kahler-Ricci flow. The positivity of Ricci curvature is also preserved along the Kahler-Ricci flow with 2-non-negative tr...The authors show that the 2-non-negative traceless bisectional curvature is preserved along the Kahler-Ricci flow. The positivity of Ricci curvature is also preserved along the Kahler-Ricci flow with 2-non-negative traceless bisectional curvature. As a corol- lary, the Kahler-Ricci flow with 2-non-negative traceless bisectional curvature will converge to a Kahler-Ricci soliton in the sense of Cheeger-Cromov-Hausdorff topology if complex dimension n ≥ 3.展开更多
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.展开更多
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.展开更多
Efficient numerical schemes were presented for the steady state solutions of towed marine cables. For most of towed systems,the steady state problem can be resolved into two-point boundary-value problem,or initial val...Efficient numerical schemes were presented for the steady state solutions of towed marine cables. For most of towed systems,the steady state problem can be resolved into two-point boundary-value problem,or initial value problem in some special cases where the initial values are available directly.A new technique was proposed and attempted to solve the two-point boundary-value problem rather than the conventional shooting method due to its algorithm complexity and low efficiency.First,the boundary conditions are transformed into a set of nonlinear governing equations about the initial values,then bisection method is employed to solve these nonlinear equations with the aid of 4th order Runge-Kutta method.In common sense,non-uniform (sheared) current is assumed,which varies in magnitude and direction with depth.The schemes are validated through the DE Zoysa's example,then several numerical examples are also presented to illustrate the numerical schemes.展开更多
文摘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.
基金supported by the 973 Program of China 2005CB321702China NSF 10531080.
文摘Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.
基金This project is supported by National 863 Hi-tech Foundation of China(No. 2001AA422210).
文摘The computation algorithm of knot point planning for Cartesian trajectorygeneration of manipulator is investigated, A novel inheritance bisection algorithm (IBA) based onconventional bisection algorithm (B A) is proposed. IBA has two steps. The first step is the 1 stknot point planning under lower set position accuracy; the second step is the 2nd knot pointplanning that inherits the results of the 1st planning under higher set position accuracy. Thesimulation results reveal that the number of inverse kinematical calculation (IKC) caused by IBA isdecreased compared with BA. IBA is more efficient to plan knot points.
基金supported by the National Natural Science Foundation of China(12172023).
文摘The separation-of-variable(SOV)methods,such as the improved SOV method,the variational SOV method,and the extended SOV method,have been proposed by the present authors and coworkers to obtain the closed-form analytical solutions for free vibration and eigenbuckling of rectangular plates and circular cylindrical shells.By taking the free vibration of rectangular thin plates as an example,this work presents the theoretical framework of the SOV methods in an instructive way,and the bisection–based solution procedures for a group of nonlinear eigenvalue equations.Besides,the explicit equations of nodal lines of the SOV methods are presented,and the relations of nodal line patterns and frequency orders are investigated.It is concluded that the highly accurate SOV methods have the same accuracy for all frequencies,the mode shapes about repeated frequencies can also be precisely captured,and the SOV methods do not have the problem of missing roots as well.
文摘To provide an energy-efficient and slab-demand-compliant rolling delay strategy,the simulation software is utilized to calculate the rolling delay process of the reheating furnace.Based on energy consumption evaluation,two optimization methods were employed.The bisection approach uses the needs of the slab to estimate the rolling delay temperature,and the golden section search method uses the energy consumption analysis of the slab to determine the high-temperature insulation duration.Generally,the slab closest to the discharge position in the control zone is selected as the optimization target.The optimized slab does not show a significant temperature rise after the end of the rolling delay process.When comparing the optimized rolling delay strategies with the traditional ones,the optimized rolling delay strategies not only meet the output requirements for slabs but also offer significant advantages in terms of energy efficiency,and this advantage increases with rolling delay time.
基金Supported by National Natural Science Foundation of China(Grant No.52175528).
文摘High-speed milling(HSM)is advantageous for machining high-quality complex-structure surface components with various materials.Identifying and estimating cutting force signals for characterizing HSM is of high significance.However,considering the tool runout and size effects,many proposed models focus on the material and mechanical characteristics.This study presents a novel approach for predicting micromilling cutting forces using a semianalytical multidimensional model that integrates experimental empirical data and a mechanical theoretical force model.A novel analytical optimization approach is provided to identify the cutting forces,classify the cutting states,and determine the tool runout using an adaptive algorithm that simplifies modeling and calculation.The instantaneous un-deformed chip thickness(IUCT)is determined from the trochoidal trajectories of each tool flute and optimized using the bisection method.Herein,the computational efficiency is improved,and the errors are clarified.The tool runout parameters are identified from the processed displacement signals and determined from the preprocessed vibration signals using an adaptive signal processing method.It is reliable and stable for determining tool runout and is an effective foundation for the force model.This approach is verified using HSM tests.Herein,the determination coefficients are stable above 0.9.It is convenient and efficient for achieving the key intermediate parameters(IUCT and tool runout),which can be generalized to various machining conditions and operations.
文摘The notion of n-transitivity can be carried over from groups of diffeomorphisms on a manifold M to groups of bisections of a Lie groupoid over M. The main theorem states that the n-transitivity is fulfilled for all n ∈N by an arbitrary group of Cr-bisections of a Lie groupoid F of class Cr, where 1 ≤ r ≤ ω, under mild conditions. For instance, the group of all bisections of any Lie groupoid and the group of all Lagrangian bisections of any symplectic groupoid are n-transitive in the sense of this theorem. In particular, if F is source connected for any arrow γ∈ Г, there is a bisection passing through γ.
基金supported in part by NSF Grant DMS-0811272in part by NIH Grant P50GM76516 and R01GM75309supported by NSF Grant DMS-0915153
文摘In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require storing the binary refinement tree explicitly. Instead, the structure is implicitly contained in a special ordering of triangular elements. Numerical experiments demonstrate that the proposed coarsening algorithm is efficient when applied for multilevel preconditioners and mesh adaptivity for time-dependent problems.
文摘We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed curve. The existence of bisections through more than one prescribed point is also discussed. We give some interesting applications of these results.
基金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.
基金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.
文摘Judicious bisection of hypergraphs asks for a balanced bipartition of the vertex set that optimizes several quantities simultaneously. In this paper, we prove that if G is a hypergraph with n vertices and ni edges of size i for i = 1, 2,…, k, then G admits a bisection in which each vertex class spans at mostm1/2＋1/4m2＋…＋（1/2^k）mk＋o（m1＋…＋mk）edges, where G is dense enough or △（G） =o（n） but has no isolated vertex, which turns out to be a bisection version of a conjecture proposed by Bollobas and Scott.
基金the National Science Foundation (No. DMS-0406346)
文摘The authors show that the 2-non-negative traceless bisectional curvature is preserved along the Kahler-Ricci flow. The positivity of Ricci curvature is also preserved along the Kahler-Ricci flow with 2-non-negative traceless bisectional curvature. As a corol- lary, the Kahler-Ricci flow with 2-non-negative traceless bisectional curvature will converge to a Kahler-Ricci soliton in the sense of Cheeger-Cromov-Hausdorff topology if complex dimension n ≥ 3.
文摘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 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.
文摘Efficient numerical schemes were presented for the steady state solutions of towed marine cables. For most of towed systems,the steady state problem can be resolved into two-point boundary-value problem,or initial value problem in some special cases where the initial values are available directly.A new technique was proposed and attempted to solve the two-point boundary-value problem rather than the conventional shooting method due to its algorithm complexity and low efficiency.First,the boundary conditions are transformed into a set of nonlinear governing equations about the initial values,then bisection method is employed to solve these nonlinear equations with the aid of 4th order Runge-Kutta method.In common sense,non-uniform (sheared) current is assumed,which varies in magnitude and direction with depth.The schemes are validated through the DE Zoysa's example,then several numerical examples are also presented to illustrate the numerical schemes.
