Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann surface by Riemann surface with elementary branch points and prescribed ramification type over a special point.
Defect prediction on projects with limited historical data has attracted great interest from both researchers and practitioners. Cross-project defect prediction has been the main area of progress by reusing classifiers from other projects. However, existing approaches require some degree of homogeneity (<i>e.g.</i>, a similar distribution of metric values)… (More)
This paper proposes an adaptive photon tracing approach based on a novel importance function, which combines visual importance and photon path visibility. The generation of photon path is guided by sampling this function to trace more photons to visible and more contributive regions. As a first step, a hierarchy of visual importance maps is constructed.… (More)
Interpreting the number of ramified covering of the sphere by Riemann surface as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of the sphere by Riemann surface with any genus, with elementary branch points and prescribed ramification type over infinity.
The position of a magnetic target can be obtained through magnetic anomaly which is measured by a magnetic sensor. Comparing with vector magnetic sensor, the measurement value of the scalar magnetic sensor is almost not influenced by its orientation in measurement coordinate axes. Therefore, scalar magnetic sensors can be easily assembled into an array.… (More)
Social networks consist of a set of participants and the pairwise relationships between them. There are several different types of networks, such as directed networks, networks with typed edges, dynamic networks and signed networks, as well as any composition of different types of networks. We develop a novel way to analyze such networks by considering the… (More)