心之所向

背景是想多线程并行处理数据。但是出现了core。代码简化如下：struct Result { Ads& a; Ads& b; std::string s;}; static TaskManager task_manager(3); //线程池 std::vector<std::function<int()>> task_list; task_list.reserve(3); std::vector<

《100个gdb小技巧》运行gdb：gdb7.12 bin文件 core文件列出调用栈： bt选择函数堆栈帧： f n打印当前函数局部变量的值： i locals打印变量值：p var_向上或向下切换函数堆栈帧： up n / down n

{ "C_Cpp.errorSquiggles": "Enabled", // C_CPP错误波浪提示开启 "python.terminal.activateEnvironment": false, // 禁止自动激活anaconda "go.toolsEnvVars": { "GO111MODULE": "off" // 禁止go插件强行使用go module环境 },}...

Sklearn之聚类分析数据科学家需要了解的5种聚类算法

tensorflow是可以直接读写hdfs的，主要有：tf.io.gfile.GFile( name, mode='r') //读写文件flush() //写完最好用以下，不然有些还在buff中close() //关闭数据流readline //读取一行readlines //读取所有行返回list，这个有个坑，在文件很大时超慢优先使用readline，需要判断啥时候结束fsamp = tf.io.gfile.GFile('hdfs://query', mo

他人教程基础变量：基本变量知识定义变量：var=123 //等号两边不能有空格，即使对变量二次赋值，也不能加$号使用变量：$var${var} //加不加{}无所谓，但有时可以区分变量名的边界，如："I am ${var}Script."只读变量：readonly var删除变量：unset 命令不能删除只读变量。unset var字符串：单引号字符串的限制： 单引号里的任何字符都会原样输出，单引号字符串中的变量是无效的； 单引号字串中不能出现单独一个的单引号

def Dataset(file_pattern, batch_size, num_epochs=1): logging.info('Creating Dataset from %s', file_pattern) return tf.data.experimental.make_csv_dataset( file_pattern=file_pattern, batch_size=batch_size, label_name=LABEL_NAM

包：package main //程序启动于main包import ( "fmt" "math/rand" //包的名字与引入路径的最后一个元素相同)import "math"func main() { fmt.Println("My favorite number is", rand.Intn(10)) //包的导出名字是以大写开头的}函数：package ma...

插件列表：Package Control 包管理Pretty JSON json格式美化sublimerge 文档并排比较启用vim模式：用户设置文件中注释掉："ignored_packages": [ // "Vintage" ]复杂的C++ Build：{ "cmd": ["g++", "${file}", ...

基础知识准备强化学习入门简单实例 DQN强化学习入门 第一讲 MDP随笔分类 - 0084. 强化学习中文翻译强化学习RL应用在youtube推荐系统 2019谷歌论文解读强化学习应用k推荐的问题slate在文中的意思大概就是一次性推荐k个item给用户。由于是k个item的组合，动作空间是非常大的。Choice Model在本文的强化学习中使用到了choice model模型...

evaluate内部插入方法： def evaluate(self): ''' Run per image evaluation on given images and store results (a list of dict) in self.evalImgs :return: None ''' ~~~~...

Value-BasedQ-learning：1、在迭代模型时Q-learning算法目标值的计算是选取下一状态最大的动作价值2、下一状态的动作选取使用的是e-greedy算法，因此产生数据的策略（e-greedy）和迭代模型的策略（贪心：选取最大动作价值）不同，属于off-policySARSA：1、在迭代模型时Q-learning算法目标值的计算是选取e-greedy算法产生的下...

基础知识准备强化学习入门简单实例 DQN强化学习入门 第一讲 MDP目标函数首先需要定义目标函数来优化模型参数，此处使用的REINFORCE算法解决RL问题：求导证明参考...

IO类型：流读取写入：iostream文件读取写入：fstreamstring读取写入：sstreamio类型不可拷贝和赋值，因此无法用于形参或返回类型，而通常以引用方式传递。读写一个io对象会改变其状态，因此不能用const。文件io：ifstream in(infile);ofstream out;out.open(outfile, ofstream::app); //默...

endl：调试时加上能够刷新缓冲区；测试时可以使用excu <infile >outfile来文件重定向char：char类型的有无符号是由编译器决定的，如果要存储不大整数，最好明确指定类型。类型选择：1、明确数值不为负时选择无符号；2、一般选择int，超过int选择long long；3、浮点运算选择double，其与float速度近似，一般不用long double...

留档PC或者手机（内网用户，例如：192.168.2.23/24）把数据包发给网关（LAN口IP，192.168.2.1/24）；路由器根据路由表，把数据继续发送给下一跳，光猫；（WAN口的网关，比如光猫的LAN口IP：192.168.1.1/24。）；光猫也根据路由表，把数据发送给下一跳，运营商设备（光猫的ONU网关，例如100.100.100.100。）。这样，你的数据就顺利的从内网往...

1、无符号字符型赋给整型变量时，将其放置低位字节，高位字节补0；2、有符号字符型赋给整型变量时，将其放置低位字节，高位字节补符号位。一、#include <iostream>int main(){ unsigned char a1 = -1; signed char a2 = -1; std::cout<<(int)a1<<" "<&l...

留档有位学弟想让我说说编译和链接的简单过程，我觉得几句话简单说的话也没什么意思，索性写篇博文稍微详细的解释一下吧。其实详细的流程在经典的《Linkers and Loaders》和《深入理解计算机系统》中均有描述，也有国产的诸如《程序员的自我修养——链接、装载与库》等大牛著作。不过，我想大家恐怕很难有足够的时间去研读这些厚如词典的书籍。正巧我大致翻阅过其中的部分章节，干脆也融入这篇文章作为补充...

内容讲解mmdetection实现

来源1.数据导入tf.dataAPI可以让你以简单可复用的方式构建复杂的Input Pipeline。例如：一个图片模型的Pipeline可能会聚合在一个分布式文件系统中的多个文件，对每个图片进行随机扰动（random perturbations），接着将随机选中的图片合并到一个training batch中。一个文本模型的Pipeline可能涉及到：从原始文本数据中抽取特征，将它们通过...

来源前言对python的修饰器的理解一直停留在"使用修饰器把函数注册为事件的处理程序"的层次，也是一知半解；这样拖着不是办法，索性今天好好整理一下关于python修饰器的概念及用法。介绍装饰器是一个很著名的设计模式，经常被用于有切面需求的场景，较为经典的有插入日志、性能测试、事务处理等。装饰器是解决这类问题的绝佳设计，有了装饰器，我们就可以抽离出大量函数中与函数功能本身无关的雷同代...

试题There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and ...

试题We have a list of points on the plane. Find the K closest points to the origin (0, 0).(Here, the distance between two points on a plane is the Euclidean distance.)You may return the answer in an...

试题For some fixed N, an array A is beautiful if it is a permutation of the integers 1, 2, …, N, such that:For every i < j, there is no k with i < k < j such that A[k] * 2 = A[i] + A[j].Give...

试题Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.Example 1:Input:[[ 1, 2, 3 ],[ 4, 5, 6 ],[ 7, 8, 9 ]]Output: [1,2,3,6,9,8,7,4,5]代码顺...

试题判断两个字符串能否完全匹配的上？匹配任意字符一次 如 a?c abc# 匹配任意字符0次或一次 如 a#c ac abc* 匹配任意字符0次或无限次 如 a*c ac abc abbbbc代码过了96%，可能还有些边界。这一题显然每次遇到匹配符的时候都有几种可能的组合形式，所以我们使用递归把每种情况的搜一下。import java.util.Scanner;public ...

一个无限长数组，前面是0，后面是1。统计0的个数。O(n)方法：从头往后遍历，因为最多只需要遍历n次，所以时间复杂度为O(n)O(n/a + logn)方法：a为index的step，也就是index每次跳a步，最后在index-a，index区间进行二分查找。O(logn)方法：按照2的指数进行跳跃，比如当前index=0，下次跳到1；当前为9，下次跳到 2 * (9+1) -1, ...

试题There are a total of n courses you have to take, labeled from 0 to n-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pa...

试题代码考虑从上一状态转换到下一状态有三种方法：1、往某个桶加水2、倒掉某桶的水3、将一个桶的水往另一个桶里倒使用宽度优先搜索：1、一旦找到结果必然是最优结果，求解最少次数。2、有助剪枝，当log中保存的状态一旦已经尝试过肯定无需继续尝试。import java.util.*;class Main{ public static void main(String[] ...

试题Given a 2d grid map of '1’s (land) and '0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may ass...

试题Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.get(key) - Get the value (will always be positive) of the key if ...

试题Given a string containing only digits, restore it by returning all possible valid IP address combinations.Example:Input: “25525511135”Output: [“255.255.11.135”, “255.255.111.35”]代码DFS不难，但是边界较多...

试题Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.The same repe...

未完全测试，整体思路如下：import java.util.*;public class Main{ public static void main(String[] args){ Matrix a = new Matrix(2,2, new ArrayList<Triple>(), new ArrayList<Integer>()); ...

试题Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and a list (List[Node]) of its neighbors.Example:...

试题Implement the following operations of a stack using queues.push(x) – Push element x onto stack.pop() – Removes the element on top of the stack.top() – Get the top element.empty() – Return wheth...

试题Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue.pop() – Removes the element from in front of queue.peek() – Get the front element.empty(...

试题Given an array of integers nums, sort the array in ascending order.Example 1:Input: [5,2,3,1]Output: [1,2,3,5]Example 2:Input: [5,1,1,2,0,0]Output: [0,0,1,1,2,5]代码堆排：class Solution { p...

试题There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to it...

试题：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,...

试题：Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary...

试题：对于A，可以使用shift+A方式2次敲击实现输入；也可以使用caps lock先锁定大小写，然后再敲击A，2次敲击实现。注意大写锁定情况下，按shift + A可以实现小写a的输入。求解，给定字符串情况下，至少需要多少次敲击才能实现正确输入。代码：dp思想，不过需要维持在当前情况下，输入状态为大写和输入状态为小写的两个最小敲击次数。import java.util.*;publ...

image: 3-D Tensor of image. If dtype is tf.float32 then the range should be[0, 1], otherwise it would converted to tf.float32 assuming that the rangeis [0, MAX], where MAX is largest positive repres...

环境变量TF_GPU_THREAD_MODElantency收益：当 TF_GPU_THREAD_MODE 设置为 gpu_shared 、gpu_private 时，warm-up 无变化，avg 延时有明显收益。TF_GPU_THREAD_COUNT 增加到 4、8 时，表现没有提高，甚至有所下降。cpu收益：当 TF_GPU_THREAD_MODE 设置为 gpu_shared 、gpu...

由于自己编译，版本很重要。package下载出错时，多运行几遍。bazel安装：bazel 0.16.1bash bazel-0.16.1-installer-linux-x86_64.shexport PATH="$PATH:$HOME/bin"tf serving安装：tf serving 1.12.0.zip在WORKSPACE中 http_archive( 行前添加：...

KddCupRank ListThe top-10 teams of the competition (and the github URL to their solutions) are:RankTeam Namegithub URL1DeepBlueAI (DeepSmart)https://github.com/DeepBlueAI/AutoSmart2NUS-Xtra-...

Here is my way to find out the correct placeholder op name in the Graphdef part of the .meta file:saver = tf.train.import_meta_graph('some_path/model.ckpt.meta')imported_graph = tf.get_default_graph...

# 引入try: import horovod.tensorflow as hvd hvd.init()except Exception as e: hvd = None print('no horovod')# 打印信息if hvd: tf.logging.info('Total workers: {}, local workers: {}'.f...

来源1. 问题描述子串应该比较好理解，至于什么是子序列，这里给出一个例子：有两个母串cnblogs belong比如序列bo, bg, lg在母串cnblogs与belong中都出现过并且出现顺序与母串保持一致，我们将其称为公共子序列。最长公共子序列（Longest Common Subsequence, LCS），顾名思义，是指在所有的子序列中最长的那一个。子串是要求更严格的一种...

from __future__ import print_functionfrom __future__ import absolute_importfrom __future__ import divisionimport multiprocessingimport globimport jsonimport sysimport osimport timefrom urlli...

luigi docimport os,sysimport luigiimport luigi.contrib.hdfsfrom datetime import datetime, timedeltaclass DummyTarget(luigi.Target): def __init__(self, exist): self.exist = exist ...

其他luigi 任务调度框架教程Hadoop、Hive、Spark 之间关系【Hadoop】三句话告诉你 mapreduce 中MAP进程的数量怎么控制？hive修改 表/分区语句五分钟零基础搞懂Hadoop「大数据」，想必大家经常听到这个被炒得很热的话题。随之而来的是各种看似高大上的专业术语，比如「扩展性」、「可靠性」、「容错性」，好像真的很高深，要积累多年经验才能...

run.sh#!/bin/bashshell_name=$1bash $shell_name # 不要使用引号run_all.sh #!/bin/bash真实代码...调用：bash run.sh "/bertrel/run_all.sh -train=true"

make share用法#include <cpputil/program/conf.h>extern std::shared_ptr<cpputil::program::Conf> conf;conf = std::make_shared<cpputil::program::Conf>(filename);数据格式转换：#include <...

来源试题：问题描述Mr_he 因讨厌？？？（手动和谐）而彻底放弃网购，他的日常用品都要到商场去购买，而且必须付现金。但是现 金购买，经常会遇到找零的问题，那么现在请你帮助他解决这样一个问题： 现在 Mr_he 手上有 n 种不同面值的硬币，每种硬币有无限多个。为了方便购物，他希望带尽量 少的硬币，但是要能组合出 1 到 m 之间的任意值。输入格式第一行为两个整数：m 和 n，他们的意义如...

来源使用tf fine-tune resnet模型前言使用tensorflow踩了很多的坑，尤其是使用tf的slim模块的时候，其中batchnorm的问题困挠了我很久，问题表现如下：训练结果很好，测试的时候is−trainingis−training设置成false测试结果很差，设置成true测试结果恢复正常训练结果很好，但是测试的结果要差上不少但是tensorflow官方...

estimator有个问题就是验证时是从文件中载入模型的，这样存在问题是无法保证从保存到载入期间的完全正确性。对于这种问题，我们一般采用少量数据，然后在训练集上进行验证。确认预测数据是否一致。主要是使用cond的控制最后几轮不进行训练，并且把数据打印出来。 def train_func(): # 构建训练节点 ...

import tensorflow as tffrom tensorflow.python.tools.inspect_checkpoint import print_tensors_in_checkpoint_filelatest_ckp = tf.train.latest_checkpoint('./')print_tensors_in_checkpoint_file(latest_ck...

试题A message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1‘B’ -> 2…‘Z’ -> 26Given a non-empty string containing only digits, determine the ...

试题A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the ...

for key in tf.app.flags.FLAGS.flag_values_dict(): print(key, FLAGS[key].value)

试题Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.In one move, we may choose two adjacent nodes and move one coin from one node to...

# 构建训练节点 train_op = create_optimizer( total_loss, lr, optimizer_params, 1., variables_to_train, use_fp16=FLAGS.use_fp16) # 将优化器ops添加进依赖 update_...

试题You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the total number of full staircase rows that can be formed.n i...

试题You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite nu...

站在BERT肩膀上的NLP新秀们（PART I）站在BERT肩膀上的NLP新秀们（PART II）站在BERT肩膀上的NLP新秀们（PART III）吹一波师兄的MASS！！！

import subprocessdef excuteCommand(com): ex = subprocess.Popen(com, stdout=subprocess.PIPE, shell=True) out, err = ex.communicate() status = ex.wait() print("cmd in:", com) prin...

Training Neural Networks with Mixed Precision

# 载入预训练参数 tvars = tf.trainable_variables() initialized_variable_names = {} scaffold_fn = None if init_checkpoint: #init_checkpoint为模型参数文件 for in...

来源目录前言tf.train.BytesList等tf.train.Featuretf.train.Featurestf.train.Example前言最近在看到一个代码时，里面用到了tf.train.Example，于是学习了其用法，这里记录一下，也希望能对其他朋友有用。另外，本文涉及的代码基于python 3.6.5 tensorflow 1.8.0tf.train.Ex...

来源ABtest不平衡解决办法【转】AB实验设计思路及实验落地这篇文章会讨论：在什么情况下需要做 AB 实验 从产品/交互角度，如何设计一个实验 前端工程师如何打点 如何统计数据，并保证数据准确可信 如何分析实验数据，有哪些数据需要重点关注 附：如何搭建前端实验项目，以 mip-experiment 为例一. AB 实验的使用场景和正确用法通常，在页面有样式变...

试题Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consis...

熟悉篇总体流程命令1、从网上下载到本地库：# 找到下载地址git clone [url]2、修改本地代码后，将文件添加到暂存区：你在修改本地代码文件时，修改只会影响到工作区。当使用add添加新文件后也就意味着git开始追踪新文件。add方法分析# 添加指定文件到暂存区git add [file1] [file2] ...# 添加指定目录到暂存区，包括子目录git add [...

试题：Given a singly linked list, determine if it is a palindrome.Example 1:Input: 1->2Output: falseExample 2:Input: 1->2->2->1Output: true代码：显然由于链表的特性，我们需要找到中点，可以使用快慢指针来寻找，然后需要将前半段进...

试题Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.Example 1:Input: n = 12Output: 3Explanation: 12 = 4 + 4 + 4.Example 2:...

试题Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input: [1,2,3,4]Output: ...

试题You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the input 2D matrix d...

试题Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in eac...

试题Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1:Input:nums = [1,1,1], k = 2Output: 2Note:The length of th...

试题Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task cou...

试题Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for wh...

试题Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed either iteratively or recursivel...

试题Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?Example:Input: 3Output: 5Explanation:Given n = 3, there are a total of 5 unique BST’s: 1 3 ...

试题Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).Example:Input: S = “ADOBECODEBANC”, T = “ABC”Output: “BANC”Note:If t...

试题Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You need to fin...

试题Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u...

试题Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 ...

试题Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tr...

试题Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[[3],[1],[2...

试题A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the ...

试题Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.Note:The...

试题Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically...

试题Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.Exam...

试题You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of mon...

试题Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example 1:Input: 2Out...

试题Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B...

试题Given a collection of intervals, merge all overlapping intervals.Example 1:Input: [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps...

试题Given an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is g...

试题Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.Strings consists of lowercase English letters only and the length of both strings s and p will not be lar...

试题Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Cou...