- 博客(52)
- 收藏
- 关注
RSS订阅原创 Linux中创建守护进程
守护进程的特性守护进程完全脱离于终端守护进程必须与它运行前的环境完全脱离开来，这些环境包括未关闭的文件描述符、控制终端、会话和进程组、工作目录和文件创建淹没等。这些环境通常是从执行它的父进程(特别是shell)中继承下来的创建守护进程知道了守护进程的特性，我们只需要使创建的进程满足守护进程的特性即可。注意进程组组长无法调用setsid(),只有非进程组长才能调用setsid()。创...
2019-09-24 19:54:24
190
原创 PointCNN: Convolution On X-Transformed Points 解读
1 摘要点云具有不规则和无序性，直接在点云上使用卷积核提取特征，会导致形状信息的丢失和对点云输入顺序的敏感。本文提出了x-transform，解决两个问题：（1）给学习到的特征赋予权重（2）将特征按某种潜在的顺序排列。2 引言如果数据是按特定顺序表达的，如i所示，比如图片，CNNs就可以很好的完成任务。但是如果是点云数据，如ii、iii、iv所示，由于点云的不规则和无序性，CNNs就不能...
2019-07-07 22:02:08
1882
原创 PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space
前言本人是刚入门小白，把最近看的论文记录一下，记录的内容都是感觉比较重要的，望大家可以指点一下。引言PointNet是直接处理点云的结构，大体思想是学习到每个点的空间编码然后聚合所有独立的点特征到全局特征。PointNet的缺点是没有捕获点云的局部结构特征。论文作者提出了一种级联神经网络，pointnet++，用级联方式处理空间中采样得到的点。pointnet++的思想很简单：首先把点集分...
2019-06-21 21:33:04
588
原创 remove-duplicates-from-sorted-list-ii
题目描述Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given1->2->3->3->4->4->5, return1-&g...
2019-05-16 21:50:45
237
原创 remove-nth-node-from-end-of-li
题目描述Given a linked list, remove the n th node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node f...
2019-05-04 23:37:20
158
原创 merge-k-sorted-lists
题目描述Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路两两进行比较代码/** * Definition for singly-linked list. * struct ListNode { * int val; * ...
2019-05-04 00:18:14
255
原创 swap-nodes-in-pairs
题目描述Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algorithm should use only con...
2019-05-03 23:55:00
216
转载 A Gentle Introduction to Mini-Batch Gradient Descent and How to Configure Batch Size
https://machinelearningmastery.com/gentle-introduction-mini-batch-gradient-descent-configure-batch-size/
2019-04-24 21:32:28
219
转载 Batch、Epoch、Iteration的联系与区别
转自知乎一 名词解释二 换算关系NumOfBatches=TrainSetSizeBatchSizeNum Of Batches = \frac{TrainSetSize}{BatchSize}NumOfBatches=BatchSizeTrainSetSize
2019-04-24 21:23:28
305
原创 np.concatenate
numpy.concatenatenumpy.concatenate((a1, a2, ...), axis=0, out=None)Join a sequence of arrays along an existing axis.Parameters: a1, a2, … : sequence of array_likeThe arrays must have the same sh...
2019-04-22 22:55:55
300
原创 merge-two-sorted-lists
题目描述Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists思路直接链起来就好代码/** * Definition for singly-linked list...
2019-04-06 21:19:26
133
原创 remove-duplicates-from-sorted-list.md
题目描述Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given1->1->2, return1->2.Given1->1->2->3->3, return1->2->3.思路：...
2019-04-06 21:15:18
229
原创 partition-list
题目描述Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each ...
2019-04-04 18:53:31
142
原创 reverse-linked-list-ii
题目描述：Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL, m = 2 and n = 4,return1->4->3->2->5->NULL.注意事项...
2019-04-04 18:32:51
179
原创 convert-sorted-list-to-binary-search-tree
题目描述Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.思想找出中间节点，然后断开，构造出二分查找树代码一对于中间节点的处理：直接令成nullptr/** * Definition for singly-linked...
2019-03-31 22:53:59
151
转载 卷积后图片大小计算
转载链接图片大小 W*WFilter大小 F×F步长 Spadding的像素数 P计算公式N = (W − F + 2P )/S+1
2019-02-27 22:17:53
1453
转载 C++空类大小不为零的原因及解释
看这个链接c++空类实例大小不是0原因总结起来一句话：因为空类也是可以实例化的，为了让实例化的对象能够在内存中有独一无二的地址，所以空类要占一个最小的空间。内存中最小的空间是一字节，所以空类大小一个字节。...
2019-02-20 23:03:53
389
原创 关于cout int*和cout char *
cout<<int就是输出int变量所在的地址。char 是char类型变量所在的地址。为了与C语言中printf表示的意思一致。cout输出的char*是指针所指内存中的内容。...
2019-02-17 22:38:34
526
原创 C++查看大端序小端序的一些思考
首先明确一个概念，无论是大段序还是小端序。类型指针指向的地址都是该类型所占内存的低地址。明确了这个，就好判断大端序和小端序了。这是大端序小端序的介绍链接下边的是验证系统是大端序还是小端序的程序#include <iostream>using namespace std;int main(){ uint32_t num = 0x12345678; cha...
2019-02-16 18:45:41
391
原创 levelDB（一）:源码编译安装
1.源码下载使用git，下载源码git clone https://github.com/google/leveldb.git2.编译安装cd leveldb/mkdir -p build && cd buildcmake -DCMAKE_BUILD_TYPE=Release .. && cmake --build .这样，在leveldb/bui...
2019-01-06 15:26:02
3820
1
原创 same-tree
描述：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.方法：就是简单的递归，...
2018-12-19 21:54:55
132
原创 symmetric-tree
描述：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the followin...
2018-12-18 21:52:08
102
原创 binary-tree-level-order-traversal
描述：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,#,#,15,7}, 3 / \ 9 20 / \...
2018-12-17 21:48:27
183
原创 binary-tree-zigzag-level-order-traversal
描述：Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary ...
2018-12-17 21:29:46
113
原创 construct-binary-tree-from-inorder-and-postorder-traversal
描述：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思想：就按照中序遍历和后序遍历建立二叉树C++代码：/** * Definition for binary...
2018-12-16 22:42:07
99
原创 binary-tree-level-order-traversal-ii
描述：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,#,#,15,7}, ...
2018-12-15 15:45:26
121
原创 balanced-binary-tree
描述：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 never diff...
2018-12-15 14:59:42
207
原创 path-sum-ii
描述：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 andsum = 22, 5 / \ ...
2018-12-15 00:42:14
250
原创 path sum
描述：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree andsum...
2018-12-13 12:14:23
101
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人