18,452 research outputs found

    Fair trade in insurance industry: Premium determination of Taiwan automobile insurance

    Get PDF
    This paper examines premium determination of voluntary automobile insurance policy and risk classification under a heavily regulated rating system in Taiwan. We investigate the distribution of actual premium and pure premium, based on unique data to test if premium reflect appropriate gender-age factor. The reasonableness of loading and the difference in driving exposure between policyholder and driver are investigated for three different types of policy. An adjustment of gender-age premium coefficients is called for

    Online Multi-Object Tracking Using CNN-based Single Object Tracker with Spatial-Temporal Attention Mechanism

    Full text link
    In this paper, we propose a CNN-based framework for online MOT. This framework utilizes the merits of single object trackers in adapting appearance models and searching for target in the next frame. Simply applying single object tracker for MOT will encounter the problem in computational efficiency and drifted results caused by occlusion. Our framework achieves computational efficiency by sharing features and using ROI-Pooling to obtain individual features for each target. Some online learned target-specific CNN layers are used for adapting the appearance model for each target. In the framework, we introduce spatial-temporal attention mechanism (STAM) to handle the drift caused by occlusion and interaction among targets. The visibility map of the target is learned and used for inferring the spatial attention map. The spatial attention map is then applied to weight the features. Besides, the occlusion status can be estimated from the visibility map, which controls the online updating process via weighted loss on training samples with different occlusion statuses in different frames. It can be considered as temporal attention mechanism. The proposed algorithm achieves 34.3% and 46.0% in MOTA on challenging MOT15 and MOT16 benchmark dataset respectively.Comment: Accepted at International Conference on Computer Vision (ICCV) 201

    Optimal Bounds for Neuman-Sándor Mean in Terms of the Convex Combinations of Harmonic, Geometric, Quadratic, and Contraharmonic Means

    Get PDF
    We present the best possible lower and upper bounds for the Neuman-Sándor mean in terms of the convex combinations of either the harmonic and quadratic means or the geometric and quadratic means or the harmonic and contraharmonic means
    • …
    corecore