18 research outputs found

    Real-Time Vehicle Detection from Short-range Aerial Image with Compressed MobileNet

    Get PDF
    Vehicle detection from short-range aerial image faces challenges including vehicle blocking, irrelevant object interference, motion blurring, color variation etc., leading to the difficulty to achieve high detection accuracy and real-time detection speed. In this paper, benefiting from the recent development in MobileNet family network engineering, we propose a compressed MobileNet which is not only internally resistant to the above listed challenges but also gains the best detection accuracy/speed tradeoff when comparing with the original MobileNet. In a nutshell, we reduce the bottleneck architecture number during the feature map downsampling stage but add more bottlenecks during the feature map plateau stage, neither extra FLOPs nor parameters are thus involved but reduced inference time and better accuracy are expected. We conduct experiment on our collected 5-k short-range aerial images, containing six vehicle categories: truck, car, bus, bicycle, motorcycle, crowded bicycles and crowded motorcycles. Our proposed compressed MobileNet achieves 110 FPS (GPU), 31 FPS (CPU) and 15 FPS (mobile phone), 1.2 times faster and 2% more accurate (mAP) than the original MobileNet

    Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

    No full text
    This study focuses on the finite-time set reachability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, based on the state transfer graph (STG) reconstruction technique, the PBMCNs are extended to random logic dynamical systems. Then, a necessary and sufficient condition for the finite-time set reachability of PBMCNs is obtained. Finally, the obtained results are effectively illustrated by an example

    Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

    No full text
    This study focuses on the finite-time set reachability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, based on the state transfer graph (STG) reconstruction technique, the PBMCNs are extended to random logic dynamical systems. Then, a necessary and sufficient condition for the finite-time set reachability of PBMCNs is obtained. Finally, the obtained results are effectively illustrated by an example

    Encoding Praise and Criticism During Social Evaluation Alters Interactive Responses in the Mentalizing and Affective Learning Networks

    No full text
    Verbal communication with evaluative characters of different emotional valence has a considerable impact on the extent to which social relations are facilitated or undermined. Here using functional magnetic resonance imaging, we investigated how the brain acts in response to social praise and criticism, leading to differential affective judgments. We engaged thirty men and women in a task associating sex-balanced, neutral faces with praising or criticizing comments targeting others or objects. A whole-brain analysis revealed that criticism as compared to praise enhanced the activation in the medial prefrontal cortex (mPFC), particularly its dorsal portion, whereas the right amygdala displayed an opposite pattern of changes. Comments on others relative to objects increased the reactivity in the left posterior superior temporal sulcus and posterior cingulate cortex (PCC) such that both praise and criticism of others produced stronger activation in these two regions than their object-targeted counterparts. The interaction of valence and target was identified in the mPFC with greater reactivity in the contrasts of criticism vs. praise in the social context and others- vs. object-targeted criticism. Comments also modulated the functional connectivity of prior activated regions with the left temporoparietal junction, bilateral caudate and left PCC/precuneus showing reduced connectivity in response to social criticism but greatly strengthened connectivity for social praise as compared to non-social counterparts. These neural effects subsequently led to altered likeability ratings for the faces. Neither behavioral nor neural effects observed were influenced by the gender of participants. Taken together, our findings suggest a fundamental interactive role of the mentalizing and affective learning networks in differential encoding of individuals associated with praising or criticizing others, leading to learning of valenced traits and subsequent approach or avoidance responses in social interactions

    Dual-level clustering ensemble algorithm with three consensus strategies

    No full text
    Abstract Clustering ensemble (CE), renowned for its robust and potent consensus capability, has garnered significant attention from scholars in recent years and has achieved numerous noteworthy breakthroughs. Nevertheless, three key issues persist: (1) the majority of CE selection strategies rely on preset parameters or empirical knowledge as a premise, lacking adaptive selectivity; (2) the construction of co-association matrix is excessively one-sided; (3) the CE method lacks a more macro perspective to reconcile the conflicts among different consensus results. To address these aforementioned problems, a dual-level clustering ensemble algorithm with three consensus strategies is proposed. Firstly, a backward clustering ensemble selection framework is devised, and its built-in selection strategy can adaptively eliminate redundant members. Then, at the base clustering consensus level, taking into account the interplay between actual spatial location information and the co-occurrence frequency, two modified relation matrices are reconstructed, resulting in the development of two consensus methods with different modes. Additionally, at the CE consensus level with a broader perspective, an adjustable Dempster–Shafer evidence theory is developed as the third consensus method in present algorithm to dynamically fuse multiple ensemble results. Experimental results demonstrate that compared to seven other state-of-the-art and typical CE algorithms, the proposed algorithm exhibits exceptional consensus ability and robustness

    Superior Li storage anode based on novel Fe-Sn-P alloy prepared by electroplating

    Get PDF
    Novel ternary Fe-Sn-P alloys prepared by simple single-step electrodeposition are investigated as promising anodes for Li-ion batteries. The Fe 51 Sn 38 P 11 electrode, in particular, shows outstanding Li-storage properties, with initial specific discharge/charge capacities of 857.8 and 655 mA h g ¿1 , respectively. The reversible capacity remains stable at 427 mA h g ¿1 , even after 90 cycles, corresponding to a coulombic efficiency of 96% and a capacity retention of 65%. The cauliflower-like morphology of the above anode is well preserved after 90 cycles, suggesting that this alloy could significantly mitigate the electrode volume expansion by exerting a positive multiphase synergistic effect. The superior electrochemical performance of the ternary Fe-Sn-P alloys confirmed its potential as an alternative Li-ion storage anode; the large-scale suitability of the developed electroplating method provides an additional advantage

    A Reinforcement Learning-Based Adaptive Path Tracking Approach for Autonomous Driving

    No full text

    The effects of diverse microbial community structures, driven by arbuscular mycorrhizal fungi inoculation, on carbon release from a paddy field

    No full text
    Arbuscular mycorrhizal fungi (AMF) play a key role in regulating the carbon cycle in terrestrial ecosystems. However, there is little information on how AMF inoculation affects the carbon fluxes of paddy fields, which are major sources of global carbon emissions. We, therefore, designed an experiment to study the effects of AMF inoculation on methane and carbon dioxide emissions from a paddy field. Results showed that: (1) Among the tested factors, the C/N ratio was the main environmental determinant of microbial community structure in the investigated soil; (2) compared with traditional fertilisation (control), the soil C/N ratio increased by 2.1~15.2% and 1.4~10.5% as a result of AMF application alone (M) or in combination with mineral fertiliser (FM) throughout the growing season, respectively. This change shifted microbial community composition to higher G+/G- bacterial and fungal/bacterial ratios; (3) the microbial community change favoured soil carbon retention. Methane (CH4) emission peaks were reduced by 59.4% and 76.0% versus control in the M treatment and by 52.5% and 29.4% in the FM treatment in the midseason and end-of-season drainage periods, and CO2 emission peaks were reduced by 70.1% and 52.3% in the M plots and by 55.4% and 66.4% in the FM plots

    A density peaks clustering algorithm with sparse search and K-d tree

    Full text link
    Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a density peaks clustering algorithm with sparse search and K-d tree is developed to solve this problem. Firstly, a sparse distance matrix is calculated by using K-d tree to replace the original full rank distance matrix, so as to accelerate the calculation of local density. Secondly, a sparse search strategy is proposed to accelerate the computation of relative-separation with the intersection between the set of kk nearest neighbors and the set consisting of the data points with larger local density for any data point. Furthermore, a second-order difference method for decision values is adopted to determine the cluster centers adaptively. Finally, experiments are carried out on datasets with different distribution characteristics, by comparing with other six state-of-the-art clustering algorithms. It is proved that the algorithm can effectively reduce the computational complexity of the original DPC from O(n2K)O(n^2K) to O(n(n1−1/K+k))O(n(n^{1-1/K}+k)). Especially for larger datasets, the efficiency is elevated more remarkably. Moreover, the clustering accuracy is also improved to a certain extent. Therefore, it can be concluded that the overall performance of the newly proposed algorithm is excellent.Comment: IEEE ACCES
    corecore