Error analysis and positioning A database cluster is used in the project. When using it, it is found that the project is running and the database has not been operated for a period of time. If the database is operated again after a period of time, the following error will appear on the console. Failed […]

# Tag: max

## Looking at Attention’s Scale operation from gradient maximization

?PaperWeekly original · Author | Su Jianlin Units | Dark Side of the Moon Research Directions | NLP, Neural Network We know that the Scale factor of Scaled-Dot Product Attention is, where is the dimension of . The general explanation of this Scale factor is: if it is not divided by , then the initial […]

## Bipartite graph determination and maximum matching of bipartite graphs

1. Definition of bipartite graph A bipartite graph is a special undirected graph whose nodes can be divided into two disjoint sets, so that there are no edges connecting any two nodes in the same set, but there are no edges between nodes in different sets. Connected by edges. In other words, if an undirected […]

## Application of C++ prefix sum algorithm: Maximizing the minimum number of power supply stations in the city

Basic knowledge points involved in this article C++ algorithm: principles, source code and test cases of prefix sum, prefix product, prefix XOR including course videos dichotomy Title Give you an integer array stations with subscripts starting from 0 and length n, where stations[i] represents the number of power supply stations in the i-th city. Each […]

## [Algorithm Challenge] The maximum number of blocks that can be sorted II (including analysis and source code)

768. Maximum number of blocks that can be sorted II https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii/ 768. Maximum number of blocks that can be sorted II Question description Method 1: Sliding window Ideas Complexity analysis Code (JS/C++) Method 2: Monotone Stack Ideas Illustration Complexity analysis Code (JS/C++) Title description This question is similar to “The maximum number of blocks that […]

## [AGC034D] Manhattan Max Matching

Problem Statement Snuke is playing with red and blue balls, placing them on a two-dimensional plane. First, he performed $N$ operations to place red balls. In the $i$-th of these operations, he placed $RC_i$ red balls at coordinates $(RX_i,RY_i)$. Then, he performed another $N$ operations to place blue balls. In the $i$-th of these operations, […]

## Android 13 – Media Framework (13) – OpenMax (1)

In this section we will learn about the Android OpenMax framework. After understanding the framework, we will go back to understand ACodec, connect MediaCodec – ACodec – OpenMax, and understand the creation control of components and the flow of buffers. This article is a personal study note. If there are any errors, please point them […]

## STM32 uses MAX7219 to control dot matrix screen and dot matrix screen cascade

This article only provides corresponding program instructions and simple chip instructions on how to use STM32 to control and cascade dot matrix screens using MAX7219. For specific chip instructions, please find the data manual (it is easiest to find a Taobao merchant)< /strong> Table of Contents 1. Brief introduction to the chip 1. Chip pin […]

## word2vec improved hierarchical softmax

Table of Contents summary overall process 1.Construct Huffman tree 2. Combine CBOW and Huffman trees 3. Build word2vec model (CBOW) summary Complete code Summary This blog mainly describes in detail the specific process and code implementation of word2vec using hierarchical softmax (hierarchical softmax). For the basic implementation of word2vec, you can read my previous blog: […]

## Application of C++ Depth First (DFS) Algorithm: Maximum Points Obtained by Collecting All Gold Coins

Involving knowledge points Deep optimization (DFS) memoization Title There is an undirected tree consisting of n nodes at node 0, with node numbers from 0 to n – 1. You are given a two-dimensional integer array edges of length n – 1, where edges[i] = [ai, bi] means that there is an edge between nodes […]