<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MAGIC_YS的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MAGIC_YS</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MAGIC_YS]]></copyright><item><title><![CDATA[Python 文档风格]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/49847779</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/49847779</guid><author>MAGIC_YS</author><pubDate>Sun, 15 Nov 2015 11:27:08 +0800</pubDate><description><![CDATA[逐渐完善


命名风格：
变量命名：类别 + "_" + 属性，e.g: file_name，file_list
一般函数："__" (两个)+ 动词(小写)+描述(首字母大写)
排版风格：
缩进：tab缩进，一律采用4空格代替一个tab
注释：
文件头：作者，时间，文档功能，模块框架，更新时间。
类头：功能，设计思路
函数头：功能，输入，输出，简要说明实现原理]]></description><category></category></item><item><title><![CDATA[受限玻尔兹曼机]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/48765449</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/48765449</guid><author>MAGIC_YS</author><pubDate>Sun, 27 Sep 2015 11:22:45 +0800</pubDate><description><![CDATA[深度学习通过模拟人类大脑的细胞组织结构以及工作方式来实现机器感知外部世界的目的。本文所要介绍的RBM(受限玻尔兹曼机)，是DBN网络的基本结构。

说起RBM又不得不提BM，附上两幅图，来说明二者区别。从下图可以看出来，BM层内存在连接节点不独立，表达能力强，但复杂度高；RBM层内无连接节点相互独立，复杂度低。



RBM由可视层与隐含层组成。RBM通过优化网络参数，模拟输入样例的概]]></description><category></category></item><item><title><![CDATA[日常积累------awk脚本]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/46780513</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/46780513</guid><author>MAGIC_YS</author><pubDate>Mon, 06 Jul 2015 23:16:49 +0800</pubDate><description><![CDATA[有必要将最近的一些技术整理整理，今天的主要整理目标：awk脚本

awk 命令的名称来源于三位作者的首字母，awk命令主要用逐行扫描处理文本文件，并且能够一次读取多个文件。
1.举一个简单的例子：

awk -F '\t' '{print $1,$2,$NF}' a.txt

awk 脚本每次读取a.txt文件中的一行，每一行按照回车符'\t'分割，$1对应分割后字符串数组的第一个字]]></description><category></category></item><item><title><![CDATA[Python 垃圾回收机制]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/45114249</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/45114249</guid><author>MAGIC_YS</author><pubDate>Sat, 18 Apr 2015 16:40:02 +0800</pubDate><description><![CDATA[python 中垃圾回收有三种策略：
1.引用计数
2.标记-清除.
3.分代，收集


引用计数，相当于C++中的智能指针，python中是以对象为一个单位，每个单位中会维护一个计数器，当定义，创建或引用变量时，计数器会加1，当删除变量时计数器会减一。当计数值为0的时候，释放内存。由于存在循环引用的问题，因此引入了标记-清除策略，该策略首先确定一个节点（当前不会被回收的节点，一般为全]]></description><category></category></item><item><title><![CDATA[Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40681705</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40681705</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:21:19 +0800</pubDate><description><![CDATA[Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below.


Input:Digit st]]></description><category></category></item><item><title><![CDATA[Generate Parentheses]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40681259</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40681259</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:19:30 +0800</pubDate><description><![CDATA[Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

"((()))", "(()())", "(())()", "()(())", "()()]]></description><category></category></item><item><title><![CDATA[Combination Sum]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40680407</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40680407</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:18:52 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited numb]]></description><category></category></item><item><title><![CDATA[N-Queens]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40655099</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40655099</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:16:39 +0800</pubDate><description><![CDATA[The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.



Given an integer n, return all distinct solutions to the n-queens puzzle.]]></description><category></category></item><item><title><![CDATA[Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40744267</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40744267</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:15:10 +0800</pubDate><description><![CDATA[题目：


Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.
提议]]></description><category></category></item><item><title><![CDATA[Pow(x,n)]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40789221</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40789221</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:12:08 +0800</pubDate><description><![CDATA[Implement pow(x, n).]]></description><category></category></item><item><title><![CDATA[Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40835113</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40835113</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:10:52 +0800</pubDate><description><![CDATA[题目：
There are two sorted arrays A and B 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)).

题目大意：]]></description><category></category></item><item><title><![CDATA[Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40899877</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40899877</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 22:06:43 +0800</pubDate><description><![CDATA[题目：

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,]]></description><category></category></item><item><title><![CDATA[计算机视觉常用开源库]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40918303</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/40918303</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 21:58:07 +0800</pubDate><description><![CDATA[一、特征提取Feature Extraction：



SIFT [1] [Demo
 program][SIFT
 Library] [VLFeat]


PCA-SIFT [2] [Project]


Affine-SIFT [3] [Project]


SURF [4] [OpenSURF]
 [Matlab
 Wrapper]


Affine]]></description><category></category></item><item><title><![CDATA[二叉树的常见遍历方法]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/38395727</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/38395727</guid><author>MAGIC_YS</author><pubDate>Sat, 08 Nov 2014 21:55:38 +0800</pubDate><description><![CDATA[先序遍历
中序遍历
后序遍历
深度优先
宽度youxi]]></description><category></category></item><item><title><![CDATA[几种排序算法的简介]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/37514243</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/37514243</guid><author>MAGIC_YS</author><pubDate>Tue, 15 Jul 2014 15:35:20 +0800</pubDate><description><![CDATA[选择排序(insert sort)
插入排序(insert sort)
duipaixv]]></description><category></category></item><item><title><![CDATA[杂记]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/30120653</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/30120653</guid><author>MAGIC_YS</author><pubDate>Wed, 11 Jun 2014 22:59:01 +0800</pubDate><description><![CDATA[许久未曾动笔,想想在园子李]]></description><category></category></item><item><title><![CDATA[2014.06.07之前 读书摘要]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/29401099</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/29401099</guid><author>MAGIC_YS</author><pubDate>Sun, 08 Jun 2014 22:12:19 +0800</pubDate><description><![CDATA[计划越详细,越可行越好.
表皮有内到外分成五层,分别是]]></description><category></category></item><item><title><![CDATA[机器学习笔记一]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/29176911</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/29176911</guid><author>MAGIC_YS</author><pubDate>Sat, 07 Jun 2014 15:28:05 +0800</pubDate><description><![CDATA[机器学习的基本概念：]]></description><category></category></item><item><title><![CDATA[C++ Primer 第五版  学习摘要(一)]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/24906103</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/24906103</guid><author>MAGIC_YS</author><pubDate>Mon, 05 May 2014 10:57:41 +0800</pubDate><description><![CDATA[1. std::endl 操纵符,在输出流中写入]]></description><category></category></item><item><title><![CDATA[数据库学习之架构搭建 Win7+Vmware Ubuntu+MySQL]]></title><link>https://blog.youkuaiyun.com/MAGIC_YS/article/details/14142311</link><guid>https://blog.youkuaiyun.com/MAGIC_YS/article/details/14142311</guid><author>MAGIC_YS</author><pubDate>Mon, 04 Nov 2013 22:31:19 +0800</pubDate><description><![CDATA[目标：VS2010 通过 ODBC 访问 虚拟机上安装的MySQL数据库
实验材料：Win7 32位、VS2010、Vmware Ubuntu、MySQL
实验步骤：

第一步：在Ubuntu上安装MySQL
1、 实现虚拟机上网，网上教程很多，这里我是使用NET方式联网。
2、下载安装MySQL，具体详见：Ubuntu下安装MySQL
3、 Ubuntu下MySQL常见命令：MyS]]></description><category></category></item></channel></rss>