<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[macidoo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/macidoo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; macidoo]]></copyright><item><title><![CDATA[【信息流推荐论文大赏】Predicting Clicks: Estimating the Click-Through Rate for New Ads]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/112389281</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/112389281</guid><author>macidoo</author><pubDate>Sun, 10 Jan 2021 16:12:54 +0800</pubDate><description><![CDATA[【信息流推荐论文大赏】Predicting Clicks: Estimating the Click-Through Rate for New Ads太长不看版Motivation为什么要预测广告CTR?为什么要预测新广告的CTR？广告搜索框架作者提出来的新特征1. Estimating Term CTR2. Estimating AD Quality3. Measuring Order Specificity4. External Sources Of Data数据集模型自己的一点思考
太长不看版
论文链]]></description><category></category></item><item><title><![CDATA[Enter passphrase for key ‘/home/work/.ssh/xxx_rsa‘ 报错及解决方案]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/108856584</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/108856584</guid><author>macidoo</author><pubDate>Mon, 28 Sep 2020 20:12:43 +0800</pubDate><description><![CDATA[在集群上设置访问git，但是使用git clone命令的时候，出现了Enter passphrase for key '/home/work/.ssh/xxx_rsa'的报错，其中xxx是我的用户名。

google之后发现，好像是需要在ssh-agent里面添加自己的rsa，但是我原来明明加过，不管，再加一次：

执行命令：


eval 'ssh-agent -s'

终端显示：

SSH_AUTH_SOCK = ****

SSH_AGENT_PID = ****

然后将之前生成好的rsa添加进去，]]></description><category></category></item><item><title><![CDATA[【Nvidia Jetson Xavier】与电脑网线连接，网络共享，然后ssh登陆教程]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/103306651</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/103306651</guid><author>macidoo</author><pubDate>Fri, 29 Nov 2019 11:21:02 +0800</pubDate><description><![CDATA[本文解决的核心问题是：在没有显示屏且xavier的ip不固定的情况下，怎么用一台笔记本，通过网线和Jetson Xavier连接，然后ssh登陆Xavier。

前提：

笔记本连接无线网络，xavier开机



方法：

1.打开笔记本cmd窗口，输入 arp -a，记下目前的端口信息

2.笔记本连接无线网络，然后网线一头连接笔记本，一头连接xavier

3.设置网络共享：网络连接-&g...]]></description><category></category></item><item><title><![CDATA[【Nvidia Jetson  Xavier】aarch64架构使用conda，jupyter远程访问跑pytorch]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/103288452</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/103288452</guid><author>macidoo</author><pubDate>Thu, 28 Nov 2019 11:16:21 +0800</pubDate><description><![CDATA[本文解决的核心问题：conda的linux-aarch64版本里没有jupyter安装包，从而导致"no module named torch"的问题

重点在后文

前提：

1.Nvidia Jetson Xavier上已经安装python3，jupyter，conda，并且在conda里面已经安装pytorch

2.我习惯在conda中配置环境并使用，故按照原来在原来x86架构的linu...]]></description><category></category></item><item><title><![CDATA[vim 按了ctrl s之后没任何反应了。。]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/89329213</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/89329213</guid><author>macidoo</author><pubDate>Tue, 16 Apr 2019 10:58:02 +0800</pubDate><description><![CDATA[因为在vim中按了ctrl s表示停止向终端输出，其实vim本身并没有真正死掉

解决办法：ctrl q 即可恢复
]]></description><category></category></item><item><title><![CDATA[Pytorch : too many values to unpack (expected 2)]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/89279447</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/89279447</guid><author>macidoo</author><pubDate>Sat, 13 Apr 2019 11:09:35 +0800</pubDate><description><![CDATA[想要读取model的state_dict全部参数，并且修改state_dict，想将其中key等于某特定值的那一层参数进行替换操作。


state_dict = {k:v for k,v in model.state_dict().items()}
for k,v in state_dict:
    if k == "target":
        #执行操作

错误原因：字典只支持对k的遍...]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】116. Populating Next Right Pointers in Each Node]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70186049</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70186049</guid><author>macidoo</author><pubDate>Sat, 15 Apr 2017 18:28:18 +0800</pubDate><description><![CDATA[题目：


Given a binary tree
    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }




Populate each next pointer to point to its next rig]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】114.Flatten Binary Tree to Linked List（有疑惑）]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70185889</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70185889</guid><author>macidoo</author><pubDate>Sat, 15 Apr 2017 17:56:49 +0800</pubDate><description><![CDATA[题目：



Total Accepted: 119447Total Submissions: 348844Difficulty: MediumContributor: LeetCode



Given a binary tree, flatten it to a linked list in-place.
For example,
Given
         1
   ]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】113. Path Sum II DFS搜索+记录节点]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70185205</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70185205</guid><author>macidoo</author><pubDate>Sat, 15 Apr 2017 16:26:27 +0800</pubDate><description><![CDATA[题目：


Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
For example:
Given the below binary tree and sum
 = 22,
              5
            ]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Balanced Binary Tree 高度平衡二叉树]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70183841</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70183841</guid><author>macidoo</author><pubDate>Sat, 15 Apr 2017 12:47:07 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Convert Sorted Array to Binary Search Tree 通过有序数列建立二叉搜索树]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70136166</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70136166</guid><author>macidoo</author><pubDate>Tue, 11 Apr 2017 23:23:07 +0800</pubDate><description><![CDATA[题目：
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

思路：每一次从有序数列的中间开始提一个出来作为当前的根节点。然后其左边就是左子树，右边就是右子树。然后对左右子树分别递归~
/**
 * Definition for a binary ]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Binary Tree Level Order Traversal II 二叉树按层遍历，反向输出]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70136106</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70136106</guid><author>macidoo</author><pubDate>Tue, 11 Apr 2017 22:33:58 +0800</pubDate><description><![CDATA[题目：


Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,nu]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Construct Binary Tree from Inorder and Postorder Traversal 中序、后序遍历求二叉树]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70136097</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70136097</guid><author>macidoo</author><pubDate>Tue, 11 Apr 2017 22:26:56 +0800</pubDate><description><![CDATA[思路：
1.和上一题很像啦~~~后序遍历的最后一个点可以把中序遍历分割成前后两部分，前面的部分就是分割点的左子树，后面的部分就是分割点的右子树。以及类推可递归。
具体细节和分析在上一题中都有，就不展开说了~
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNod]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Construct Binary Tree from Preorder and Inorder Traversal 前序、中序还原二叉树]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/70136008</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/70136008</guid><author>macidoo</author><pubDate>Tue, 11 Apr 2017 21:49:56 +0800</pubDate><description><![CDATA[思路：
1.这道题还是借鉴了其他大佬的思路，仔细分析一下，前序遍历的第一个值是根节点值（假设为val），那么在中序遍历中val之前的都是根节点的左子树，val值之后的都是右子树。同理递归可还原二叉树。
2.容易出错的地方：
a.递归的子函数最好传入前序和中序的引用，然后每次更新前序和中序遍历的起始点和终止点，这样比较不容易出错。
b.起始点和终止点的计算需要细心~尤其是得到middle之后]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Maximum Depth of Binary Tree 二叉树最大深度 递归&非递归]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/69830211</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/69830211</guid><author>macidoo</author><pubDate>Sun, 09 Apr 2017 16:04:45 +0800</pubDate><description><![CDATA[轻而易举的敲下了经典的递归程序：
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL)]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Binary Tree Zigzag Level Order Traversal 二叉树Z字形遍历]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/69821118</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/69821118</guid><author>macidoo</author><pubDate>Sun, 09 Apr 2017 15:37:59 +0800</pubDate><description><![CDATA[思路：
其实和上一题（二叉树的按层遍历）很像，开始想的是用队列存入一层的节点，这时计算队列的size，然后想要从第size个开始反过来取。咦，这不是先进后出嘛，用stack呀！不对，每取出来一个节点，都要继续存入这个节点的左右子节点，那不是这一层还没取完下一层就压栈进来了。既然想要根据位置存取方便，那当然是用vector！第二个问题在于从左往右存和从右往左存是每层交叉的，所以还需要多一个判断（这]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】Binary Tree Level Order Traversal 二叉树分层存储]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/69789171</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/69789171</guid><author>macidoo</author><pubDate>Sat, 08 Apr 2017 23:40:20 +0800</pubDate><description><![CDATA[1.Binary Tree Level Order Traversal 二叉树分层存储
2.错误信息：Line 68: expected '}' at end of input]]></description><category></category></item><item><title><![CDATA[【LeetCode笔记】判断一棵树是否为镜像]]></title><link>https://blog.youkuaiyun.com/macidoo/article/details/69668985</link><guid>https://blog.youkuaiyun.com/macidoo/article/details/69668985</guid><author>macidoo</author><pubDate>Sat, 08 Apr 2017 15:15:47 +0800</pubDate><description><![CDATA[最初思路：
1.求树的中序遍历，存入vector；
2.判断vector是否为为镜像；
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : va]]></description><category></category></item></channel></rss>