Body-fitted mesh generation has long been the bottleneck of simulating fluid flows involving complex geometries. Immersed boundary methods are non-boundary-conforming methods that have gained great popularity in the l...Body-fitted mesh generation has long been the bottleneck of simulating fluid flows involving complex geometries. Immersed boundary methods are non-boundary-conforming methods that have gained great popularity in the last two decades for their simplicity and flexibility, as well as their non-compromised accuracy. This paper presents a summary of some numerical algori- thms along the line of sharp interface direct forcing approaches and their applications in some practical problems. The algorithms include basic Navier-Stokes solvers, immersed boundary setup procedures, treatments of stationary and moving immersed bounda- ries, and fluid-structure coupling schemes. Applications of these algorithms in particulate flows, flow-induced vibrations, biofluid dynamics, and free-surface hydrodynamics are demonstrated. Some concluding remarks are made, including several future research directions that can further expand the application regime of immersed boundary methods.展开更多
Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules...Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.展开更多
In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condi...In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms.展开更多
In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are ch...In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.展开更多
Deployment of buoy systems is one of the most important procedures for the operation of buoy system. In the present study, a single-point mooring buoy system which contains surface buoy, cable segments with components...Deployment of buoy systems is one of the most important procedures for the operation of buoy system. In the present study, a single-point mooring buoy system which contains surface buoy, cable segments with components, anchor and so on is modeled by applying multi-body dynamics method. The motion equations are developed in discrete node description and fully Cartesian coordinates. Then numerical method is used to solve the ordinary differential equations and dynamics simulations are achieved while anchor is casting from board. The trajectories and velocities of different nodes without current and with current in buoy system are obtained. The transient tension force of each part of the cable is analyzed in the process of deployment. Numerical results indicate that the transient payload increases to a peak value when the anchor is touching the seabed and the maximum tension force will vary with different floating configuration. This work is helpful for design and deployment planning of buoy system.展开更多
Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose m...Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose maximum periodic Hamming correlation is 0 at the origin result in an LHZ FHS set based on the Cartesian product, and Proposition 4 presented an upper bound of the maximum periodic Hamming correlation of FHSs. However, their statements are imperfect or incorrect. In this paper, we give counterexamples and make corrections to them. Furthermore, based on the Cartesian product, we construct two classes of LHZ FHS sets with optimal maximum periodic partial Hamming correlation property. It is shown that new FHS sets are optimal by the maximum periodic partial Hamming correlation bound of LHZ FHS set.展开更多
A dynamic uniform Cartesian grid system was developed in order to reduce the computational time in inundation simulation using a Godunov-type finite volume scheme. The reduction is achieved by excluding redundant dry ...A dynamic uniform Cartesian grid system was developed in order to reduce the computational time in inundation simulation using a Godunov-type finite volume scheme. The reduction is achieved by excluding redundant dry cells, which cannot be effectively avoided with a conventional Cartesian uniform grid system, as the wet area is unknown before computation. The new grid system expands dynamically with wetting, through addition of new cells according to moving wet-dry fronts. The new grid system is straightforward in implementation. Its application in a field-scale flood simulation shows that the new grid system is able to produce the same results as the conventional grid, but the computational efficiency is fairly improved.展开更多
To meet the requirements of fast and automatic computation of subsonic and transonic aerodynamics in aircraft conceptual design,a novel finite volume solver for full potential flows on adaptive Cartesian grids is deve...To meet the requirements of fast and automatic computation of subsonic and transonic aerodynamics in aircraft conceptual design,a novel finite volume solver for full potential flows on adaptive Cartesian grids is developed in this paper.Cartesian grids with geometric adaptation are firstly generated automatically with boundary cells processed by cell-cutting and cell-merging algorithms.The nonlinear full potential equation is discretized by a finite volume scheme on these Cartesian grids and iteratively solved in an implicit fashion with a generalized minimum residual（GMRES） algorithm.During computation,solution-based mesh adaptation is also applied so as to capture flow features more accurately.An improved ghost-cell method is proposed to implement the non-penetration wall boundary condition where the velocity-potential of a ghost cell is modified by an analytic method instead.According to the characteristics of the Cartesian grids,the Kutta condition is applied by specially computing the gradients on Kutta-faces without directly assigning the potential jump to cells adjacent wake faces,which can significantly improve the solution converging speed.The feasibility and accuracy of the proposed method are validated by several typical cases of sub/transonic flows around an ONERA M6 wing,a DLR-F4 wing-body,and an unconventional figuration of a blended wing body（BWB）.The validation cases demonstrate a fast convergence with fully automatic grid treatment and computation,and the results suggest its capacity in application for aircraft conceptual design.展开更多
In this article, the authors mainly study how to obtain new semicontinuous lattices from the given semicontinuous lattices and discuss the conditions under which the image of a semicontinuous projection operator is al...In this article, the authors mainly study how to obtain new semicontinuous lattices from the given semicontinuous lattices and discuss the conditions under which the image of a semicontinuous projection operator is also semicontinuous. Moreover, the authors investigate the relation between semicontinuous lattices and completely distributive lattices. Finally, it is proved that the strongly semicontinuous lattice category is a Cartesian closed category.展开更多
Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian prod...Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian products of wheel Wm with path Pn for arbitrary m ≥ 3 and n ≥ 1.展开更多
By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Car...By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Cartesian products of K5 with star Sn is Z（5, n） ＋ 5n ＋ [n/2] ＋ 1.展开更多
Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i...Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.展开更多
We present a Cartesian grid method for numerical simulation of strongly nonlinear phenomena of ship-wave interactions. The Constraint Interpolation Profile （CIP） method is applied to the flow solver, which can effic...We present a Cartesian grid method for numerical simulation of strongly nonlinear phenomena of ship-wave interactions. The Constraint Interpolation Profile （CIP） method is applied to the flow solver, which can efficiently increase the discretization accuracy on the moving boundaries for the Cartesian grid method. Tangent of Hyperbola for Interface Capturing （THINC） is imple- mented as an interface capturing scheme for free surface calculation. An improved immersed boundary method is developed to treat moving bodies with complex-shaped geometries. In this paper, the main features and some recent improvements of the Cartesian grid method are described and several numerical simulation results are presented to discuss its performance.展开更多
Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on rel...Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on relaxed AVL tree is investigated to construct topological structure for stereo lithography （STL） files, and a topology-based self-adaptive layered slicing algorithm with special features control strategy is brought forward. With the help of convex hull, a new points-in-polygon method is employed to improve the Cartesian cut cell method. By integrating the self-adaptive layered slicing algorithm and the improved Cartesian cut cell method, the adaptive layered Cartesian cut cell method gains the volume data of the complex CAD model in STL file and generates the unstructured hexahedral anisotropic Cartesian grids.展开更多
The pebbling number of a graph G,f(G),is the least n such that,no matter how n pebbles are placed on the vertices of G,we can move a pebble to any vertex by a sequence of moves,each move taking two pebbles off one ver...The pebbling number of a graph G,f(G),is the least n such that,no matter how n pebbles are placed on the vertices of G,we can move a pebble to any vertex by a sequence of moves,each move taking two pebbles off one vertex and placing one on an adjacent vertex.Graham conjectured that for any connected graphs G and H,f(G×H)≤f(G)f(H).We show that Graham's conjecture holds true of a complete bipartite graph by a graph with the two-pebbling property.As a corollary,Graham's conjecture holds when G and H are complete bipartite graphs.展开更多
文摘Body-fitted mesh generation has long been the bottleneck of simulating fluid flows involving complex geometries. Immersed boundary methods are non-boundary-conforming methods that have gained great popularity in the last two decades for their simplicity and flexibility, as well as their non-compromised accuracy. This paper presents a summary of some numerical algori- thms along the line of sharp interface direct forcing approaches and their applications in some practical problems. The algorithms include basic Navier-Stokes solvers, immersed boundary setup procedures, treatments of stationary and moving immersed bounda- ries, and fluid-structure coupling schemes. Applications of these algorithms in particulate flows, flow-induced vibrations, biofluid dynamics, and free-surface hydrodynamics are demonstrated. Some concluding remarks are made, including several future research directions that can further expand the application regime of immersed boundary methods.
文摘Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.
基金supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)
文摘In this paper, we establish a theoretical framework of path-following interior point al- gorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms.
文摘In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.
基金supported by the National Natural Science Foundation of China (Grant No. 51175484)the Science Foundation of Shandong Province (Grant No. ZR2010EM052)
文摘Deployment of buoy systems is one of the most important procedures for the operation of buoy system. In the present study, a single-point mooring buoy system which contains surface buoy, cable segments with components, anchor and so on is modeled by applying multi-body dynamics method. The motion equations are developed in discrete node description and fully Cartesian coordinates. Then numerical method is used to solve the ordinary differential equations and dynamics simulations are achieved while anchor is casting from board. The trajectories and velocities of different nodes without current and with current in buoy system are obtained. The transient tension force of each part of the cable is analyzed in the process of deployment. Numerical results indicate that the transient payload increases to a peak value when the anchor is touching the seabed and the maximum tension force will vary with different floating configuration. This work is helpful for design and deployment planning of buoy system.
基金supported by National Natural Science Foundation of China(Grant No.61271244)Key Grant Project of Ministry of Education of China(Grant No.311031 100)Young Innovative Research Team of Sichuan Province(Grant No.2011JTD0007)
文摘Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose maximum periodic Hamming correlation is 0 at the origin result in an LHZ FHS set based on the Cartesian product, and Proposition 4 presented an upper bound of the maximum periodic Hamming correlation of FHSs. However, their statements are imperfect or incorrect. In this paper, we give counterexamples and make corrections to them. Furthermore, based on the Cartesian product, we construct two classes of LHZ FHS sets with optimal maximum periodic partial Hamming correlation property. It is shown that new FHS sets are optimal by the maximum periodic partial Hamming correlation bound of LHZ FHS set.
文摘In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.
基金supported by the National Natural Science Foundation of China(Grant No.19672016)the National Key R&D Program of China(Grant No.2016YFC0402704)+1 种基金the State Key Program of the National Natural Science Foundation of China(Grant No.41330858)the UK Natural Environment Research Council(NERC)(Grant No.NE/K008781/1)
文摘A dynamic uniform Cartesian grid system was developed in order to reduce the computational time in inundation simulation using a Godunov-type finite volume scheme. The reduction is achieved by excluding redundant dry cells, which cannot be effectively avoided with a conventional Cartesian uniform grid system, as the wet area is unknown before computation. The new grid system expands dynamically with wetting, through addition of new cells according to moving wet-dry fronts. The new grid system is straightforward in implementation. Its application in a field-scale flood simulation shows that the new grid system is able to produce the same results as the conventional grid, but the computational efficiency is fairly improved.
基金co-supported by the National Natural Science Foundation of China(No.11672133)the Fundamental Research Funds for the Central UniversitiesThe support from the Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions
文摘To meet the requirements of fast and automatic computation of subsonic and transonic aerodynamics in aircraft conceptual design,a novel finite volume solver for full potential flows on adaptive Cartesian grids is developed in this paper.Cartesian grids with geometric adaptation are firstly generated automatically with boundary cells processed by cell-cutting and cell-merging algorithms.The nonlinear full potential equation is discretized by a finite volume scheme on these Cartesian grids and iteratively solved in an implicit fashion with a generalized minimum residual（GMRES） algorithm.During computation,solution-based mesh adaptation is also applied so as to capture flow features more accurately.An improved ghost-cell method is proposed to implement the non-penetration wall boundary condition where the velocity-potential of a ghost cell is modified by an analytic method instead.According to the characteristics of the Cartesian grids,the Kutta condition is applied by specially computing the gradients on Kutta-faces without directly assigning the potential jump to cells adjacent wake faces,which can significantly improve the solution converging speed.The feasibility and accuracy of the proposed method are validated by several typical cases of sub/transonic flows around an ONERA M6 wing,a DLR-F4 wing-body,and an unconventional figuration of a blended wing body（BWB）.The validation cases demonstrate a fast convergence with fully automatic grid treatment and computation,and the results suggest its capacity in application for aircraft conceptual design.
文摘In this article, the authors mainly study how to obtain new semicontinuous lattices from the given semicontinuous lattices and discuss the conditions under which the image of a semicontinuous projection operator is also semicontinuous. Moreover, the authors investigate the relation between semicontinuous lattices and completely distributive lattices. Finally, it is proved that the strongly semicontinuous lattice category is a Cartesian closed category.
基金the National Natural Science Foundation of China （No. 10771062） and New Century Excellent Talents in University （No. 07-0276）.
文摘Most results on crossing numbers of graphs focus on some special graphs, such as the Cartesian products of small graphs with path, star and cycle. In this paper, we obtain the crossing number formula of Cartesian products of wheel Wm with path Pn for arbitrary m ≥ 3 and n ≥ 1.
基金the National Natural Science Foundation of China （No. 10771062） and New Century Excellent Talents in University.
文摘By connecting the 5 vertices of K5 to other n vertices, we obtain a special family of graph denoted by Hn. This paper proves that the crossing number of Hn is Z（5, n） ＋2n＋ [n/2] ＋1, and the crossing number of Cartesian products of K5 with star Sn is Z（5, n） ＋ 5n ＋ [n/2] ＋ 1.
基金Supported by FRG/07-08/II-08 Hong Kong Baptist University
文摘Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.
文摘We present a Cartesian grid method for numerical simulation of strongly nonlinear phenomena of ship-wave interactions. The Constraint Interpolation Profile （CIP） method is applied to the flow solver, which can efficiently increase the discretization accuracy on the moving boundaries for the Cartesian grid method. Tangent of Hyperbola for Interface Capturing （THINC） is imple- mented as an interface capturing scheme for free surface calculation. An improved immersed boundary method is developed to treat moving bodies with complex-shaped geometries. In this paper, the main features and some recent improvements of the Cartesian grid method are described and several numerical simulation results are presented to discuss its performance.
基金This project is supported by National Natural Science Foundation of China (No. 60375020, No. 50305033)Provincial Natural Science Foundation of Zhejiang, China (No. Y105430).
文摘Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on relaxed AVL tree is investigated to construct topological structure for stereo lithography （STL） files, and a topology-based self-adaptive layered slicing algorithm with special features control strategy is brought forward. With the help of convex hull, a new points-in-polygon method is employed to improve the Cartesian cut cell method. By integrating the self-adaptive layered slicing algorithm and the improved Cartesian cut cell method, the adaptive layered Cartesian cut cell method gains the volume data of the complex CAD model in STL file and generates the unstructured hexahedral anisotropic Cartesian grids.
基金This work was supported by the National Natural Science Foundation of China (Grant Nos. 49873002, 10001005).
文摘The pebbling number of a graph G,f(G),is the least n such that,no matter how n pebbles are placed on the vertices of G,we can move a pebble to any vertex by a sequence of moves,each move taking two pebbles off one vertex and placing one on an adjacent vertex.Graham conjectured that for any connected graphs G and H,f(G×H)≤f(G)f(H).We show that Graham's conjecture holds true of a complete bipartite graph by a graph with the two-pebbling property.As a corollary,Graham's conjecture holds when G and H are complete bipartite graphs.
