<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[SYSU_LBY的博客]]></title><description><![CDATA[先想后干，想明白再干，不明白不干]]></description><link>https://blog.youkuaiyun.com/lby0910</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lby0910]]></copyright><item><title><![CDATA[Linux下Mysql添加用户操作踩到的坑]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/87973057</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/87973057</guid><author>lby0910</author><pubDate>Wed, 27 Feb 2019 14:53:41 +0800</pubDate><description><![CDATA[最近，笔者正在做的project想要对数据库做比较多的调试，同时也为了方便开发与版本部署以及之后数据库的整体迁移，于是想在数据库添加用户操作以及开放数据库的远程访问，折腾了一个多小时，学到了以下一些内容。
环境与目标
操作系统： centos7.2
数据库： MariaDB，MariaDB与mysql给用户的体验差别不大，基本都是兼容的，常用命令也基本相同。
目标： 原有登录数据库用root账户，...]]></description><category></category></item><item><title><![CDATA[Windows Server2008配置Django与数据库环境]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/84870890</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/84870890</guid><author>lby0910</author><pubDate>Fri, 07 Dec 2018 10:42:38 +0800</pubDate><description><![CDATA[前两天突然之间被指派了一个任务，需要几天之内在数据中心的实验室一台Windows Server2008服务器上面做一个网站来可视化显示传感器采集的数据。而传感器数据具有特定格式，并且从数据中心的动环系统中采集得到，由于动环系统的配置、数据的冗余存储等各方面问题，服务器的OS与数据库不能变化，因此只能在此基础上想办法适应开发。为了不影响服务器正常工作，笔者决定用虚拟机搭建起与服务器一模一样的环境开发...]]></description><category></category></item><item><title><![CDATA[点云配准算法的综述]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/80612842</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/80612842</guid><author>lby0910</author><pubDate>Thu, 07 Jun 2018 23:52:01 +0800</pubDate><description><![CDATA[点云配准实际上可以理解为：通过计算得到完美的坐标变换，将处于不同视角下的点云数据经过**旋转平移等刚性变换**统一整合到指定坐标系之下的过程。再通俗一点讲：进行配准的两个点云，它们彼此之间可以通过旋转平移等这种位置变换完全重合，因此这两个点云属于刚性变换即形状大小是完全一样的，只是坐标位置不一样而已。点云配准就是求出两个点云之间的坐标位置变换关系。]]></description><category></category></item><item><title><![CDATA[树莓派设备端口号绑定]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/77586728</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/77586728</guid><author>lby0910</author><pubDate>Fri, 25 Aug 2017 20:41:28 +0800</pubDate><description><![CDATA[project做到最近，遇到了一个尴尬的问题：一台树莓派接了多个设备，例如多个arduino、串口转USB和无线键鼠等等。物理上USB不够，直接将一个USB hub就可以了。]]></description><category></category></item><item><title><![CDATA[一个利用CAN实现车辆控制的简单模板]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/75410244</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/75410244</guid><author>lby0910</author><pubDate>Wed, 19 Jul 2017 16:32:32 +0800</pubDate><description><![CDATA[CAN的全称是controller area network是一种车内常用的通信协议，网络的设备直接互联通信。基本上，现在很多车都是使用CAN协议作为车内ECU与各个模块之间的通信手段。]]></description><category></category></item><item><title><![CDATA[LeetCode542. 01 Matrix题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/73735192</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/73735192</guid><author>lby0910</author><pubDate>Mon, 26 Jun 2017 13:04:50 +0800</pubDate><description><![CDATA[Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1.]]></description><category></category></item><item><title><![CDATA[《算法概论》8.3]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/73603359</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/73603359</guid><author>lby0910</author><pubDate>Thu, 22 Jun 2017 13:36:12 +0800</pubDate><description><![CDATA[STINGY SET is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables are true]]></description><category></category></item><item><title><![CDATA[Sicily1005. 最大和题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/73431004</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/73431004</guid><author>lby0910</author><pubDate>Sun, 18 Jun 2017 13:50:49 +0800</pubDate><description><![CDATA[从数列A[0], A[1], A[2], …, A[N-1]中选若干个数，要求相邻的数不能都选，也就是说如果选了A[i], 就不能选A[i-1]和A[i+1]. 求能选出的最大和. 1 <= N <= 100000, 1 <= A[i] <= 10002.]]></description><category></category></item><item><title><![CDATA[Sicily1209. Sequence Sum Possibi题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72934466</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72934466</guid><author>lby0910</author><pubDate>Thu, 08 Jun 2017 20:10:39 +0800</pubDate><description><![CDATA[题目描述Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers.]]></description><category></category></item><item><title><![CDATA[Sicily1210.二叉树题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72903125</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72903125</guid><author>lby0910</author><pubDate>Wed, 07 Jun 2017 19:28:16 +0800</pubDate><description><![CDATA[题目描述在众多的数据结构中，二叉树是一种特殊而重要的结构，有着广泛的应用。二叉树或者是一个结点，或者有且仅有一个结点为二叉树的根，其余结点被分成两个互不相交的子集，一个作为左子集，另一个作为右子集，每个子集又是一个二叉树。]]></description><category></category></item><item><title><![CDATA[利用树莓派搭建简易服务器]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72892437</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72892437</guid><author>lby0910</author><pubDate>Wed, 07 Jun 2017 00:04:24 +0800</pubDate><description><![CDATA[读研以来笔者一直负责实验室的网络维护，可以说是实验室名副其实的首席大网管。有一天笔者突发奇想，拿了手头的树莓派3结合主路由器搭建了一个稳定的服务器，效果还不错，把搭建方法和过程和大家分享一下。 主要包括了git服务器，远程视频监控服务器和网页游戏服务器。]]></description><category></category></item><item><title><![CDATA[LeetCode494. Target Sum题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72859713</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72859713</guid><author>lby0910</author><pubDate>Sun, 04 Jun 2017 16:30:00 +0800</pubDate><description><![CDATA[You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.]]></description><category></category></item><item><title><![CDATA[密码学与网络安全笔记整理-伽罗华环]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72840070</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72840070</guid><author>lby0910</author><pubDate>Fri, 02 Jun 2017 00:52:28 +0800</pubDate><description><![CDATA[有限域具体来说是近世代数的内容，我们组要做presentation的内容是在此基础上，有关伽罗华环的定义和一些性质。]]></description><category></category></item><item><title><![CDATA[LeetCode48. Rotate Image题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72832544</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72832544</guid><author>lby0910</author><pubDate>Thu, 01 Jun 2017 16:26:41 +0800</pubDate><description><![CDATA[You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). 题目很简单，给了一个n*n的2D方阵，我们需要将其顺时针旋转90°。]]></description><category></category></item><item><title><![CDATA[LeetCode486. Predict the Winner题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72680981</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72680981</guid><author>lby0910</author><pubDate>Wed, 24 May 2017 17:16:27 +0800</pubDate><description><![CDATA[Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on.]]></description><category></category></item><item><title><![CDATA[LeetCode357. Count Numbers with Unique Digits题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/72380442</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/72380442</guid><author>lby0910</author><pubDate>Wed, 17 May 2017 14:18:57 +0800</pubDate><description><![CDATA[题目描述Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10^(n).]]></description><category></category></item><item><title><![CDATA[LeetCode338. Counting Bits题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/71598193</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/71598193</guid><author>lby0910</author><pubDate>Wed, 10 May 2017 22:19:05 +0800</pubDate><description><![CDATA[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.]]></description><category></category></item><item><title><![CDATA[LeetCode70. Climbing Stairs题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/71194906</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/71194906</guid><author>lby0910</author><pubDate>Fri, 05 May 2017 12:41:41 +0800</pubDate><description><![CDATA[You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?]]></description><category></category></item><item><title><![CDATA[LeetCode121. Best Time to Buy and Sell Stock题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/71156834</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/71156834</guid><author>lby0910</author><pubDate>Thu, 04 May 2017 00:07:51 +0800</pubDate><description><![CDATA[Say you have an array for which the i element is the price of a given stock on day i.If you were only permitted to complete at most one transaction.]]></description><category></category></item><item><title><![CDATA[LeetCode413. Arithmetic Slices题解]]></title><link>https://blog.youkuaiyun.com/lby0910/article/details/70941275</link><guid>https://blog.youkuaiyun.com/lby0910/article/details/70941275</guid><author>lby0910</author><pubDate>Fri, 28 Apr 2017 21:35:55 +0800</pubDate><description><![CDATA[A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.]]></description><category></category></item></channel></rss>