RESUMEN

The worldwide penetration of electric bicycles has caused numerous charging accidents; however, online diagnosing charging faults remains challenging because of non-standard chargers, non-uniform communication manners and inaccessible battery inner status. The development of Internet of Things enables to acquire the input current information of chargers in the cloud platform, thereby supplying an alternative perspective to excavate underlying charge abnormalities. Through analyzing 181,282 charge records collected from the power-grid side, we establish an update-to-date deep neural network algorithm, which can automatically capture these charge feature variables, determine their dependencies and identify abnormal charge behaviors. Based on the only input current sequences, the algorithm can effectively diagnose the charging fault with the average accuracy of 85%, efficiently ensuring the charging safety of more than 20 million E-bicycles after substantial validations. Besides, this diagnosis framework can be extended to the real-time charge safety detection of electric vehicles and other similar energy storage systems.

RESUMEN

Examining how travel distance is associated with travel mode choice is essential for understanding traveler travel patterns and the potential mechanisms of behavioral changes. Although existing studies have explored the effect of travel distance on travel mode choice, most overlook their non-linear relationship and the heterogeneity between groups. In this study, the correlation between travel distance and travel mode choice is explored by applying the random forest model based on resident travel survey data in Guiyang, China. The results show that travel distance is far more important than other determinants for understanding the mechanism of travel mode choice. Travel distance contributes to 42.28% of explanation power for predicting travel mode choice and even 63.24% for walking. Significant nonlinear associations and threshold effects are found between travel distance and travel mode choice, and such nonlinear associations vary significantly across different socioeconomic groups. Policymakers are recommended to understand the group heterogeneity of travel mode choice behavior and to make targeted interventions for different groups with different travel distances. These results can provide beneficial guidance for optimizing the spatial layout of transportation infrastructure and improving the operational efficiency of low-carbon transportation systems.

Asunto(s)

RESUMEN

The notable increase in the size and dimensions of data have presented challenges for data storage and retrieval. The Bloom filter and its generations, due to efficient space overheads and constant query delays, have been broadly applied to querying memberships of a big data set. However, the Bloom filter and most of the variants regard each element as a 1-dimensional string and adopt multiple different string hashes to project the data. The interesting problem is when the inputs are numerical vectors with high dimensions, it remains unknown whether they can be projected into the Bloom filter in their original format. Furthermore, we investigate whether the projection is random and uniform. To address these problems, this paper presents a new uniform Prime-HD-BKDERhash family and a new Bloom filter (P-HDBF) to retrieve the membership of a big data set with the numerical high dimensions. Since the randomness and uniformity of data mapping determines the performance of the Bloom filter, to verify these properties, we first introduce information entropy. Our theoretical and experimental results show that the P-HDBF can randomly and uniformly map the data in their native formats. Moreover, the P-HDBF provides an efficient solution alternative to implement membership search with space-time overheads. This advantage may be suitable for engineering applications that are resource-constrained or identification of the nuances of the graphics and images.

Asunto(s)

RESUMEN

In high-dimensional spaces, accuracy and similarity search by low computing and storage costs are always difficult research topics, and there is a balance between efficiency and accuracy. In this paper, we propose a new structure Similar-PBF-PHT to represent items of a set with high dimensions and retrieve accurate and similar items. The Similar-PBF-PHT contains three parts: parallel bloom filters (PBFs), parallel hash tables (PHTs), and a bitmatrix. Experiments show that the Similar-PBF-PHT is effective in membership query and K-nearest neighbors (K-NN) search. With accurate querying, the Similar-PBF-PHT owns low hit false positive probability (FPP) and acceptable memory costs. With K-NN querying, the average overall ratio and rank-i ratio of the Hamming distance are accurate and ratios of the Euclidean distance are acceptable. It takes CPU time not I/O times to retrieve accurate and similar items and can deal with different data formats not only numerical values.

Asunto(s)