EQUIVARIANT PATH FIELDS ON TOPOLOGICAL MANIFOLDS

A classical theorem of H. Hopf asserts that a closed connected smooth manifold admits a nowhere vanishing vector field if and only if its Euler characteristic is zero. R. Brown generalized Hopf`s result to topological manifolds, replacing vector fields with path fields. In this note, we give an equivariant analog of Brown`s theorem for locally smooth G-manifolds where G is a finite group.

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields - namely, in the simultaneous presence of symmetries and reversing symmetries - by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincare series and their associated Molien formulae are introduced,and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants. (C) 2008 Elsevier B.V, All rights reserved.

Reversible equivariant Hopf bifurcation

In this paper we study codimension-one Hopf bifurcation from symmetric equilibrium points in reversible equivariant vector fields. Such bifurcations are characterized by a doubly degenerate pair of purely imaginary eigenvalues of the linearization of the vector field at the equilibrium point. The eigenvalue movements near such a degeneracy typically follow one of three scenarios: splitting (from two pairs of imaginary eigenvalues to a quadruplet on the complex plane), passing (on the imaginary axis), or crossing (a quadruplet crossing the imaginary axis). We give a complete description of the behaviour of reversible periodic orbits in the vicinity of such a bifurcation point. For non-reversible periodic solutions. in the case of Hopf bifurcation with crossing eigenvalues. we obtain a generalization of the equivariant Hopf Theorem.

Path formulation for Z(2) circle plus Z(2)-equivariant bifurcation problems

M. Manoel and I. Stewart 0101) classify Z(2) circle plus Z(2)-equivariant bifurcation problems up to codimension 3 and 1 modal parameter, using the classical techniques of singularity theory of Golubistky and Schaeffer [8]. In this paper we classify these same problems using an alternative form: the path formulation (Theorem 6.1). One of the advantages of this method is that the calculates to obtain the normal forms are easier. Furthermore, in our classification we observe the presence of only one modal parameter in the generic core. It differs from the classical classification where the core has 2 modal parameters. We finish this work comparing our classification to the one obtained in [10].

Path formulation for multiparameter D3-equivariant bifurcation problems

We implement a singularity theory approach, the path formulation, to classify D3-equivariant bifurcation problems of corank 2, with one or two distinguished parameters, and their perturbations. The bifurcation diagrams are identified with sections over paths in the parameter space of a Ba-miniversal unfolding f0 of their cores. Equivalence between paths is given by diffeomorphisms liftable over the projection from the zero-set of F0 onto its unfolding parameter space. We apply our results to degenerate bifurcation of period-3 subharmonics in reversible systems, in particular in the 1:1-resonance.

OPF-MRF: Optimum-path forest and Markov random fields for contextual-based image classification

Some machine learning methods do not exploit contextual information in the process of discovering, describing and recognizing patterns. However, spatial/temporal neighboring samples are likely to have same behavior. Here, we propose an approach which unifies a supervised learning algorithm - namely Optimum-Path Forest - together with a Markov Random Field in order to build a prior model holding a spatial smoothness assumption, which takes into account the contextual information for classification purposes. We show its robustness for brain tissue classification over some images of the well-known dataset IBSR. © 2013 Springer-Verlag.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

Wind-energy based path planning for electric unmanned aerial vehicles using Markov Decision Processes

Exploiting wind-energy is one possible way to ex- tend flight duration for Unmanned Arial Vehicles. Wind-energy can also be used to minimise energy consumption for a planned path. In this paper, we consider uncertain time-varying wind fields and plan a path through them. A Gaussian distribution is used to determine uncertainty in the Time-varying wind fields. We use Markov Decision Process to plan a path based upon the uncertainty of Gaussian distribution. Simulation results that compare the direct line of flight between start and target point and our planned path for energy consumption and time of travel are presented. The result is a robust path using the most visited cell while sampling the Gaussian distribution of the wind field in each cell.

Wind-energy based path planning for unmanned aerial vehicles using Markov decision processes

Exploiting wind-energy is one possible way to extend flight duration for Unmanned Arial Vehicles. Wind-energy can also be used to minimise energy consumption for a planned path. In this paper, we consider uncertain time-varying wind fields and plan a path through them. A Gaussian distribution is used to determine uncertainty in the Time-varying wind fields. We use Markov Decision Process to plan a path based upon the uncertainty of Gaussian distribution. Simulation results that compare the direct line of flight between start and target point and our planned path for energy consumption and time of travel are presented. The result is a robust path using the most visited cell while sampling the Gaussian distribution of the wind field in each cell.

Maintaining a cognitive map in darkness : the need to fuse boundary knowledge with path integration

Spatial navigation requires the processing of complex, disparate and often ambiguous sensory data. The neurocomputations underpinning this vital ability remain poorly understood. Controversy remains as to whether multimodal sensory information must be combined into a unified representation, consistent with Tolman's "cognitive map", or whether differential activation of independent navigation modules suffice to explain observed navigation behaviour. Here we demonstrate that key neural correlates of spatial navigation in darkness cannot be explained if the path integration system acted independently of boundary (landmark) information. In vivo recordings demonstrate that the rodent head direction (HD) system becomes unstable within three minutes without vision. In contrast, rodents maintain stable place fields and grid fields for over half an hour without vision. Using a simple HD error model, we show analytically that idiothetic path integration (iPI) alone cannot be used to maintain any stable place representation beyond two to three minutes. We then use a measure of place stability based on information theoretic principles to prove that featureless boundaries alone cannot be used to improve localization above chance level. Having shown that neither iPI nor boundaries alone are sufficient, we then address the question of whether their combination is sufficient and - we conjecture - necessary to maintain place stability for prolonged periods without vision. We addressed this question in simulations and robot experiments using a navigation model comprising of a particle filter and boundary map. The model replicates published experimental results on place field and grid field stability without vision, and makes testable predictions including place field splitting and grid field rescaling if the true arena geometry differs from the acquired boundary map. We discuss our findings in light of current theories of animal navigation and neuronal computation, and elaborate on their implications and significance for the design, analysis and interpretation of experiments.

Path-integral derivation of the superconformal anomaly for the N=1 supersymmetric Yang-Mills theory

Fujikawa's method of evaluating the supercurrent and the superconformal current anomalies, using the heat-kernel regularization scheme, is extended to theories with gauge invariance, in particular, to the off-shell N=1 supersymmetric Yang-Mills (SSYM) theory. The Jacobians of supersymmetry and superconformal transformations are finite. Although the gauge-fixing term is not supersymmetric and the regularization scheme is not manifestly supersymmetric, we find that the regularized Jacobians are gauge invariant and finite and they can be expressed in such a way that there is no one-loop supercurrent anomaly for the N=1 SSYM theory. The superconformal anomaly is nonzero and the anomaly agrees with a similar result obtained using other methods.

Path-integral derivation of the superconformal anomaly for the Wess-Zumino model

Fujikawa's method of evaluating the anomalies is extended to the on-shell supersymmetric (SUSY) theories. The supercurrent and the superconformal current anomalies are evaluated for the Wess-Zumino model using the background-field formulation and heat-kernel regularization. We find that the regularized Jacobians for SUSY and superconformal transformations are finite. The results can be expressed in a form such that there is no supercurrent anomaly but a finite nonzero superconformal anomaly, in agreement with similar results obtained using other methods.

Finite element simulations of notch tip fields in magnesium single crystals

Recent experiments using three point bend specimens of Mg single crystals have revealed that tensile twins of {10 (1) over bar2}-type form profusely near a notch tip and enhance the fracture toughness through large plastic dissipation. In this work, 3D finite element simulations of these experiments are carried out using a crystal plasticity framework which includes slip and twinning to gain insights on the mechanics of fracture. The predicted load-displacement curves, slip and tensile twinning activities from finite element analysis corroborate well with the experimental observations. The numerical results are used to explore the 3D nature of the crack tip stress, plastic slip and twin volume fraction distributions near the notch root. The occurrence of tensile twinning is rationalized from the variation of normal stress ahead of the notch tip. Further, deflection of the crack path at twin-twin intersections observed in the experiments is examined from an energy standpoint by modeling discrete twins close to the notch root.

Electron quantum path tuning and isolated attosecond pulse emission driven by a waveform-controlled multi-cycle laser field

We investigate high-order harmonic emission and isolated attosecond pulse (IAP) generation in atoms driven by a two-colour multi-cycle laser field consisting of an 800 nm pulse and an infrared laser pulse at an arbitrary wavelength. With moderate laser intensity, an IAP of similar to 220 as can be generated in helium atoms by using two-colour laser pulses of 35 fs/800 nm and 46 fs/1150 nm. The discussion based on the three-step semiclassical model, and time-frequency analysis shows a clear picture of the high-order harmonic generation in the waveform-controlled laser field which is of benefit to the generation of XUV IAP and attosecond electron pulses. When the propagation effect is included, the duration of the IAP can be shorter than 200 as, when the driving laser pulses are focused 1 mm before the gas medium with a length between 1.5 mm and 2 mm.