ylqi007

modprobe: ERROR: could not insert '8192du': Unknown symbol in module, or unknown parameter (see dmesg)

1

```bash yq0033:rtl8192du$ make make ARCH=x86_64 CROSS_COMPILE= -C /lib/modules/5.4.0-53-generic/build M=/home/yq0033/rtl8192du modules make[1]: Entering directory '/usr/src/linux-headers-5.4.0-53-generic' CC [M] /home/yq0033/rtl8192du/core/rtw_cmd.o CC [M] /home/yq0033/rtl8192du/core/rtw_security.o CC [M] /home/yq0033/rtl8192du/core/rtw_debug.o CC [M] /home/yq0033/rtl8192du/core/rtw_io.o CC [M] /home/yq0033/rtl8192du/core/rtw_ioctl_query.o CC...

After image_preprocessing, what is the data type of input data? Is tf.float32, tf.float64 in the range of [0, 1] of tf.uint8 in the range of [0, 255]? Sincerely

evaluation and accuracy

7

I have two questions about the evaluation, could anyone give me some hint and help, please? 1. AP_VOC07 v.s. AP_VOC12 When I ran the `eval_ssh_network.py`, I got two results, `AP_VOC07/mAP`...

why feat_scores > -0.5?

16

According to the code: ``` jaccard = jaccard_with_anchors(bbox) # Mask: check threshold + scores + no annotations + num_classes. mask = tf.greater(jaccard, feat_scores) # mask = tf.logical_and(mask, tf.greater(jaccard, matching_threshold)) mask...

Algorithm (算法)

3

## Quick Select * https://leetcode.com/problems/top-k-frequent-elements/editorial/ ## Quickselect (Hoare's selection algorithm) 1. [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) [讲解不错，算法实现简单易明白] 2. [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)

Facebook

3

Top Frequency: Top 10 1. [314. Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) [BFS] 2. [1249. Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) [Stack] 1. [1963. Minimum Number of Swaps to Make the...

Data Structure (数据结构)

5

# Queue (队列) Queue是**线性表**的一种，在操作数据元素时，按照先进先出(First In First Out, FIFO)的规则。 **Queue的实现方式:** 队列的实现同样有两种方式：顺序存储和链式存储。两者的区别在于数据元素在物理存储结构上的不同。 1. 顺序存储 2. 链式存储 #### 1. 顺序存储 **顺序存储存在的问题:** 由于数组申请的空间有限，到某一时间点，就会出现`rear`队尾指针到了数组的最后一个存储位置，如果继续存储，由于`rear`指针无法后移，则会出错。 > 在数组中做删除数据元素的操作，只是移动了队头指针而没有释放所占空间。 顺序存储的升级版：使用数组存取数据元素时，可以将数组申请的空间想象成首尾连接的环状空间使用。 如何区分空队列和满队列的情况？办法是：牺牲掉一个存储空间 * 当队列为空时，尾指针`rear`等于头指针`front` * 当队列为满时，为指针`rear`的下一个位置等于头指针`front` #### 2. 链式存储...

杂记

4

如何取数组的中间值？ **Method 1** ``` middle = (left + right) / 2; ``` * 局限：(left + right) 可能会出现溢出，从而造成错误 **Method 2** ``` middle = left + (right - left)/2; ``` * 避免了溢出的情况...

排序算法

6

1. 冒泡排序 2. 插入排序 3. 选择排序 4. 希尔 Shell 排序 5. 快速排序 (Quick Sort) 6. 归并排序 (Merge Sort) 7. 堆排序 8. 线性排序算法 9. 自省排序 10. 间接排序 11. 计数排序 12. 基数排序...