Wenjing Dai 3:41 PM Hi everyone, I'm a little confused about 6.1_exercise_4, the relationship between network selection (FFNN, CNN, RNN) and input typ ...
分类:
其他好文 时间:
2019-10-18 15:58:48
阅读次数:
105
1.简单说下什么是最左匹配原则顾名思义:最左优先,以最左边的为起点任何连续的索引都能匹配上。同时遇到范围查询(>、<、between、like)就会停止匹配。例如:b = 2 如果建立(a,b)顺序的索引,是匹配不到(a,b)索引的;但是如果查询条件是a = 1 and b = 2或者a=1(又或者 ...
分类:
其他好文 时间:
2019-10-17 21:39:12
阅读次数:
921
Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7 ...
分类:
其他好文 时间:
2019-10-17 17:53:08
阅读次数:
86
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: You may assume that the array doe ...
分类:
其他好文 时间:
2019-10-17 12:01:59
阅读次数:
83
explain的作用 1. id 1.)id相同 (按顺序执行) 2.)id不同(递增,序号越大越先执行) 3.)id有相同和不同(序号越大越先执行,出现相同的则按顺序执行) 2. select_type 3. type 2) index 3)range where后字段使用了索引,且是个范围,in ...
分类:
数据库 时间:
2019-10-17 01:11:03
阅读次数:
124
问题描述 The "BFS" algorithm is defined as follows. 1. Consider an undirected graph with vertices numbered from 11 to n. Initialize q as a new "queue" con ...
分类:
其他好文 时间:
2019-10-15 00:18:26
阅读次数:
98
Dice Similarity Coefficent vs. IoU Several readers emailed regarding the segmentation performance of the FCN-8s model I trained in Chapter Four. Speci ...
分类:
其他好文 时间:
2019-10-14 23:48:34
阅读次数:
339
Basic navigation by using 'Navigator.push' & 'Navigator.pop()', for example, we have two screen, screen1 and screen2, we want to navigate between two ...
分类:
其他好文 时间:
2019-10-13 21:05:55
阅读次数:
142
通过硬件的IOMMU,内核提供的共享内存、VFIO可以实现。 REF: 1. offical DPDK API Doc, 简书有翻译版 DPDK编程指南(翻译)(一) ( 二十七) 2. dpdk vhost研究(一)/(二) 3. vhost-user 与其他的对比 virtio,vhost 和v ...
分类:
其他好文 时间:
2019-10-13 15:19:11
阅读次数:
111
一 线程queue queue is especially useful in threaded programming when information must be exchanged safely between multiple threads. 有三种不同的用法 class queue. ...
分类:
编程语言 时间:
2019-10-13 10:44:30
阅读次数:
99