Signature inversion for monotone paths

The aim of this article is to provide a simple sampling procedure to reconstruct any monotone path from its signature. For every N, we sample a lattice path of N steps with weights given by the coefficient of the corresponding word in the signature. We show that these weights on lattice paths satisfy the large deviations principle. In particular, this implies that the probability of picking up a "wrong" path is exponentially small in N. The argument relies on a probabilistic interpretation of the signature for monotone paths

Fault diagnosis method for energy storage mechanism of high voltage circuit breaker based on CNN characteristic matrix constructed by sound-vibration signal

Aiming at the problem that some traditional high voltage circuit breaker fault diagnosis methods were over-dependent on subjective experience, the accuracy was not very high and the generalization ability was poor, a fault diagnosis method for energy storage mechanism of high voltage circuit breaker, which based on Convolutional Neural Network (CNN) characteristic matrix constructed by sound-vibration signal ,was proposed. In this paper, firstly, the morphological filtering was used for background noise cancellation of sound signal, and the time scale alignment method based on kurtosis and envelope similarity were proposed to ensure the synchronism of the sound-vibration signal. Secondly, the Pearson correlation coefficient was used to construct two-dimensional image characteristic matrix for the expanded sound-vibration signal. Finally, the characteristic matrix was trained by utilizing CNN. Local Response Normalization (LRN) and core function decorrelation were utilized to improve the structure of CNN model, which reduced the bad impact of large data fluctuation of energy storage process on the diagnostic accuracy of circuit breaker energy storage mechanism. Compared with the traditional method, the proposed method has obvious advantages, whose total accurate rate up to 98.2 % and generalization performance is excellent

Refining Short-Term Power Load Forecasting: An Optimized Model with Long Short-Term Memory Network

Short-term power load forecasting involves the stable operation and optimal scheduling of the power system. Accurate load forecasting can improve the safety and economy of the power grid. Therefore, how to predict power load quickly and accurately has become one of the urgent problems to be solved. Based on the optimization parameter selection and data preprocessing of the improved Long Short-Term Memory Network, the study first integrated particle swarm optimization algorithm to achieve parameter optimization. Then, combined with convolutional neural network, the power load data were processed to optimize the data and reduce noise, thereby enhancing model performance. Finally, simulation experiments were conducted. The PSO-CNN-LSTM model was tested on the GEFC dataset and demonstrated stability of up to 90%. This was 22% higher than the competing CNN-LSTM model and at least 30% higher than the LSTM model. The PSO-CNN-LSTM model was trained with a step size of 1.9×10^4, the relative mean square error was 0.2345×10^-4. However, when the CNN-LSTM and LSTM models were trained for more than 2.0×10^4 steps, they still did not achieve the target effect. In addition, the fitting error of the PSOCNN-LSTM model in the GEFC dataset was less than 1.0×10^-7. In power load forecasting, the PSOCNN- LSTM model\u27s predicted results had an average absolute error of less than 1.0% when compared to actual data. This was an improvement of at least 0.8% compared to the average absolute error of the CNNLSTM prediction model. These experiments confirmed that the prediction model that combined two methods had further improved the speed and accuracy of power load prediction compared to traditional prediction models, providing more guarantees for safe and stable operation of the power system

Pedestrian Accessible Infrastructure Inventory: Assessing Zero-Shot Segmentation on Multi-Mode Geospatial Data for All Pedestrian Types

In this paper, a Segment Anything Model (SAM)-based pedestrian infrastructure segmentation workflow is designed and optimized, which is capable of efficiently processing multi-sourced geospatial data including LiDAR data and satellite imagery data. We used an expanded definition of pedestrian infrastructure inventory which goes beyond the traditional transportation elements to include street furniture objects that are important for accessibility but are often omitted from the traditional definition. Our contributions lie in producing the necessary knowledge to answer the following two questions. First, which data representation can facilitate zero-shot segmentation of infrastructure objects with SAM? Second, how well does the SAM-based method perform on segmenting pedestrian infrastructure objects? Our findings indicate that street view images generated from mobile LiDAR point cloud data, when paired along with satellite imagery data, can work efficiently with SAM to create a scalable pedestrian infrastructure inventory approach with immediate benefits to GIS professionals, city managers, transportation owners, and walkers, especially those with travel-limiting disabilities, such as individuals who are blind, have low vision, or experience mobility disabilities

Gate controlled valley polarizer in bilayer graphene

Sign reversal of Berry curvature across two oppositely gated regions in bilayer graphene can give rise to counter-propagating 1D channels with opposite valley indices. Considering spin and sub-lattice degeneracy, there are four quantized conduction channels in each direction. Previous experimental work on gate-controlled valley polarizer achieved good contrast only in the presence of an external magnetic field. Yet, with increasing magnetic field the ungated regions of bilayer graphene will transit into the quantum Hall regime, limiting the applications of valley-polarized electrons. Here we present improved performance of a gate-controlled valley polarizer through optimized device geometry and stacking method. Electrical measurements show up to two orders of magnitude difference in conductance between the valley-polarized state and gapped states. The valley-polarized state displays conductance of nearly 4e2/h and produces contrast in a subsequent valley analyzer configuration. These results pave the way to further experiments on valley-polarized electrons in zero magnetic field

HumanMAC: Masked Motion Completion for Human Motion Prediction

Human motion prediction is a classical problem in computer vision and computer graphics, which has a wide range of practical applications. Previous effects achieve great empirical performance based on an encoding-decoding style. The methods of this style work by first encoding previous motions to latent representations and then decoding the latent representations into predicted motions. However, in practice, they are still unsatisfactory due to several issues, including complicated loss constraints, cumbersome training processes, and scarce switch of different categories of motions in prediction. In this paper, to address the above issues, we jump out of the foregoing style and propose a novel framework from a new perspective. Specifically, our framework works in a masked completion fashion. In the training stage, we learn a motion diffusion model that generates motions from random noise. In the inference stage, with a denoising procedure, we make motion prediction conditioning on observed motions to output more continuous and controllable predictions. The proposed framework enjoys promising algorithmic properties, which only needs one loss in optimization and is trained in an end-to-end manner. Additionally, it accomplishes the switch of different categories of motions effectively, which is significant in realistic tasks, e.g., the animation task. Comprehensive experiments on benchmarks confirm the superiority of the proposed framework. The project page is available at https://lhchen.top/Human-MAC

Graph Collaborative Signals Denoising and Augmentation for Recommendation

Graph collaborative filtering (GCF) is a popular technique for capturing high-order collaborative signals in recommendation systems. However, GCF's bipartite adjacency matrix, which defines the neighbors being aggregated based on user-item interactions, can be noisy for users/items with abundant interactions and insufficient for users/items with scarce interactions. Additionally, the adjacency matrix ignores user-user and item-item correlations, which can limit the scope of beneficial neighbors being aggregated. In this work, we propose a new graph adjacency matrix that incorporates user-user and item-item correlations, as well as a properly designed user-item interaction matrix that balances the number of interactions across all users. To achieve this, we pre-train a graph-based recommendation method to obtain users/items embeddings, and then enhance the user-item interaction matrix via top-K sampling. We also augment the symmetric user-user and item-item correlation components to the adjacency matrix. Our experiments demonstrate that the enhanced user-item interaction matrix with improved neighbors and lower density leads to significant benefits in graph-based recommendation. Moreover, we show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions. The code is in \url{https://github.com/zfan20/GraphDA}.Comment: Short Paper Accepted by SIGIR 2023, 6 page