NON-WANDERING SET OF A CONTINUOUS GRAPH MAP

The non-wandering set Ω(f) for a graph map f is investigated. It is showed that Ω(f) is contained in the closure of the set ER(f) of eventually recurrent points of f and ω-limit set ω(Ω(f)) of Ω(f) is contained in the closure of the set R(f) of recurrent points of f.

Weak Graph Map Homotopy and Its Applications

The authors introduce a notion of a weak graph map homotopy(they call it M-homotopy),discuss its properties and applications.They prove that the weak graph map homotopy equivalence between graphs coincides with the graph homotopy equivalence defined by Yau et al in 2001.The difference between them is that the weak graph map homotopy transformation is defined in terms of maps,while the graph homotopy transformation is defined by means of combinatorial operations.They discuss its advantages over the graph homotopy transformation.As its applications,they investigate the mapping class group of a graph and the 1-order M P-homotopy group of a pointed simple graph.Moreover,they show that the 1-order M P-homotopy group of a pointed simple graph is invariant up to the weak graph map homotopy equivalence.

Robinson-Ursescu Theorem in p-normed Spaces

For a convex set-valued map between p-normed (0 < p < 1) spaces, we give a criterion for its inverse to be locally Lipschitz of order p. From this we obtain the Robinson-Ursescu Theorem in p-normed spaces and the open mapping and closed graph theorems for closed convex set-valued maps.

Delaunay graph-based moving mesh method with damping functions

The fluid–structure interaction and aerodynamic shape optimization usually involve the moving or deforming boundaries, thus the dynamic mesh techniques are the key techniques to cope with such deformation. A novel dynamic mesh method was developed based on the Delaunay graph in this paper. According to the Delaunay graph, the mesh points were divided into groups. In each group, a factor ranging from 0 to 1 was calculated based on the area/volume ratio. By introducing a proper function for this factor, this method can control the mesh quality with high efficiency. Several test cases were compared with other dynamic mesh methods regarding mesh quality and CPU time, such as radial basis function method and Delaunay graph mapping method.

The nonexistence of sensitive commutative group actions on graphs

In this paper,we observe a special kind of continuous functions on graphs.By estimating the integrals of these functions,we prove that there are no sensitive commutative group actions on graphs.Furthermore,we consider a 1-dimensional continuum composed of a spiral curve and a circle and show that there exist sensitive homeomorphisms on it,which answers negatively a question proposed by Kato in 1993.

Special α-limit points and unilateral γ-limit points for graph maps

Let G be a graph and f ： G → G be a continuous map. Denote by P（f）, R（f）, SA（f） and UF（f） the sets of periodic points, recurrent points, special α-limit points and unilateral γ-limit points of f, respectively. In this paper, we show that R（f） SA（f） = UP（f） ∪ P（f） R（f）.

Topological Structure of Non-wandering Set of a Graph Map

Let G be a graph （i.e., a finite one-dimensional polyhedron） and f ： G → G be a continuous map. In this paper, we show that every isolated recurrent point of f is an isolated non-wandering point; every accumulation point of the set of non-wandering points of f with infinite orbit is a two-order accumulation point of the set of recurrent points of f; the derived set of an ω-limit set of f is equal to the derived set of an the set of recurrent points of f; and the two-order derived set of non-wandering set of f is equal to the two-order derived set of the set of recurrent points of f.

Aerodynamic design optimization of nacelle/pylon position on an aircraft

The arbitrary space-shape free form deformation （FFD） method developed in this paper is based on non-uniform rational B-splines （NURBS） basis function and used for the integral parameterization of nacelle-pylon geometry. The multi-block structured grid deformation technique is established by Delaunay graph mapping method. The optimization objects of aerodynamic characteristics are evaluated by solving NavierStokes equations on the basis of multi-block structured grid. The advanced particle swarm optimization （PSO） is utilized as search algorithm, which com-bines the Kriging model as surrogate model during optimization. The optimization system is used for optimizing the nacelle location of DLR-F6 wing-body-pylon-nacelle. The results indicate that the aerodynamic interference between the parts is significantly reduced. The optimization design system established in this paper has extensive applications and engineering value.