Mass and Isotope Dependence of Limiting Temperatures for Hot Nuclei

The mass and isotope dependence of limiting temperatures for hot nuclei are investigated. The predicted mass dependence of limiting temperatures is in good agreement with data derived from the caloric curve data. The predicted isotope distribution of limiting temperatures appears to be a parabolic shape and its centroid is not located at the isotope on the $\beta$-stability line(T=0) but at neutron-rich side. Our study shows that the mass and isotope dependence of limiting temperatures depend on the interaction and the form of surface tension and its isopin dependence sensitively.Comment: 14 pages,11 figure

Remarks on minimal rational curves on moduli spaces of stable bundles

Let M be the moduli space of stable bundles of rank 2 and with fixed determinant \mathcal{L} of degree d on a smooth projective curve C of genus g>= 2. When g=3 and d is even, we prove, for any point [W]\in M, there is a minimal rational curve passing through [W], which is not a Hecke curve. This complements a theorem of Xiaotao Sun

Block-Matching Optical Flow for Dynamic Vision Sensor- Algorithm and FPGA Implementation

Rapid and low power computation of optical flow (OF) is potentially useful in robotics. The dynamic vision sensor (DVS) event camera produces quick and sparse output, and has high dynamic range, but conventional OF algorithms are frame-based and cannot be directly used with event-based cameras. Previous DVS OF methods do not work well with dense textured input and are designed for implementation in logic circuits. This paper proposes a new block-matching based DVS OF algorithm which is inspired by motion estimation methods used for MPEG video compression. The algorithm was implemented both in software and on FPGA. For each event, it computes the motion direction as one of 9 directions. The speed of the motion is set by the sample interval. Results show that the Average Angular Error can be improved by 30\% compared with previous methods. The OF can be calculated on FPGA with 50\,MHz clock in 0.2\,us per event (11 clock cycles), 20 times faster than a Java software implementation running on a desktop PC. Sample data is shown that the method works on scenes dominated by edges, sparse features, and dense texture.Comment: Published in ISCAS 201