7,823 research outputs found

    Renormalization analysis of intermittency in two coupled maps

    Full text link
    The critical behavior for intermittency is studied in two coupled one-dimensional (1D) maps. We find two fixed maps of an approximate renormalization operator in the space of coupled maps. Each fixed map has a common relavant eigenvaule associated with the scaling of the control parameter of the uncoupled one-dimensional map. However, the relevant ``coupling eigenvalue'' associated with coupling perturbation varies depending on the fixed maps. These renormalization results are also confirmed for a linearly-coupled case.Comment: 11 pages, RevTeX, 2 eps figure

    K*{\Lambda}(1116) photoproduction and nucleon resonances

    Full text link
    In this presentation, we report our recent studies on the KΛ(1116)K^*\Lambda(1116) photoproduction off the proton target, using the tree-level Born approximation, via the effective Lagrangian approach. In addition, we include the nine (three- or four-star confirmed) nucleon resonances below the threshold sth2008\sqrt{s}_\mathrm{th}\approx2008 MeV, to interpret the discrepancy between the experiment and previous theoretical studies, in the vicinity of the threshold region. From the numerical studies, we observe that the S11(1535)S_{11}(1535) and S11(1650)S_{11}(1650) play an important role for the cross-section enhancement near the sth\sqrt{s}_\mathrm{th}. It also turns out that, in order to reproduce the data, we have the vector coupling constants gKS11(1535)Λ=(7.09.0)g_{K^*S_{11}(1535)\Lambda}=(7.0\sim9.0) and gKS11(1650)Λ=(5.06.0)g_{K^*S_{11}(1650)\Lambda}=(5.0\sim6.0).Comment: 2 pages, 2 figures, talk given at International Conference on the structure of baryons, BARYONS'10, Dec. 7-11, 2010, Osaka, Japa

    Development of Navigation Control Algorithm for AGV Using D* Search Algorithm

    Full text link
    In this paper, we present a navigation control algorithm for Automatic Guided Vehicles (AGV) that move in industrial environments including static and moving obstacles using D* algorithm. This algorithm has ability to get paths planning in unknown, partially known and changing environments efficiently. To apply the D* search algorithm, the grid map represent the known environment is generated. By using the laser scanner LMS-151 and laser navigation sensor NAV-200, the grid map is updated according to the changing of environment and obstacles. When the AGV finds some new map information such as new unknown obstacles, it adds the information to its map and re-plans a new shortest path from its current coordinates to the given goal coordinates. It repeats the process until it reaches the goal coordinates. This algorithm is verified through simulation and experiment. The simulation and experimental results show that the algorithm can be used to move the AGV successfully to reach the goal position while it avoids unknown moving and static obstacles. [Keywords— navigation control algorithm; Automatic Guided Vehicles (AGV); D* search algorithm

    Internal localized eigenmodes on spin discrete breathers in antiferromagnetic chains with on-site easy axis anisotropy

    Full text link
    We investigate internal localized eigenmodes of the linearized equation around spin discrete breathers in 1D antiferromagnets with on-site easy axis anisotropy. The threshold of occurrence of the internal localized eigenmodes has a typical structure in parameter space depending on the frequency of the spin discrete breather. We also performed molecular dynamics simulation in order to show the validity of our linear analysis.Comment: 4 pages including 5 figure
    corecore