<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Shiqing'blog]]></title><description><![CDATA[留住转瞬即逝的思绪与火花]]></description><link>https://blog.youkuaiyun.com/ch209209</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ch209209]]></copyright><item><title><![CDATA[天津小汽车竞价分析]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/52036077</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/52036077</guid><author>ch209209</author><pubDate>Tue, 26 Jul 2016 15:20:52 +0800</pubDate><description><![CDATA[数据取自2014年2月到2016年6月


价格趋势
季度均价一年中价格最低的出现在第三季度，最高出现在第二季度。
月度均价

一年中最高的竞拍价出现在6月，最低的月份是2月，2月是中国农历的新年。]]></description><category></category></item><item><title><![CDATA[Ubuntu 14.04 google pinyin输入法的安装]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/39716963</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/39716963</guid><author>ch209209</author><pubDate>Wed, 01 Oct 2014 10:20:13 +0800</pubDate><description><![CDATA[Ubuntu默认自带的中文输入法是IBUS框架的ibus-pinyin,IBUS-Bopomofo等。对于习惯于搜狗，紫光华宇，谷歌拼音的我们可能有点使用不习惯。下面就是安装常用的IBUS中文输入法。

1,安装IBUS-googlepinyin,ibus-sunpinyin. 直接在Ubuntu软件中心搜索IBUS，然后选择显示不常用项，即如下找到相应的输入法。



如果除了系统自]]></description><category></category></item><item><title><![CDATA[安装gollum提示Failed to build gem native extension的解决]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/25210761</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/25210761</guid><author>ch209209</author><pubDate>Wed, 07 May 2014 14:24:12 +0800</pubDate><description><![CDATA[安装gollum提示Failed to build gem native extension的解决

发表于2013
 年 5 月 29 日


gollum是GitHub的一个开源Wiki引擎，老蔡准备用来写代码文档，结果安装就出错了。

直接sudo gem install gollum来安装gollum会提示错误


12345678910ERROR:  Error i]]></description><category></category></item><item><title><![CDATA[git 删除 remote branch索引]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/24975849</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/24975849</guid><author>ch209209</author><pubDate>Sun, 04 May 2014 13:43:49 +0800</pubDate><description><![CDATA[git删除local不存在的remote branch索引
git remote prune -n origin
git remote prune  origin]]></description><category></category></item><item><title><![CDATA[Histogram of Oriented gradient for human detection]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/12422549</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/12422549</guid><author>ch209209</author><pubDate>Tue, 08 Oct 2013 10:59:58 +0800</pubDate><description><![CDATA[转载http://blog.sciencenet.cn/blog-942948-704104.html

2005年由Navneet Dalal和Bill Triggs的发表的>是pedestrian detection的最著名的经典算法，必须仔细拜读：

摘要

该文主要研究用于visual object recognition的feature set，并采用基于linear SVM]]></description><category></category></item><item><title><![CDATA[gentoo 网卡命名]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/12058145</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/12058145</guid><author>ch209209</author><pubDate>Thu, 26 Sep 2013 16:42:39 +0800</pubDate><description><![CDATA[转自http://www.dongwm.com/archives/udevsheng-ji-de-wang-qia-zhong-ming-ming-wen-ti-he-jie-jue/

故障描述

最近终于更新了下gentoo，重启发现我的eth0网卡启动失败：

 * Bringing up interface eth0
 *   ERROR: interface eth0 doe]]></description><category></category></item><item><title><![CDATA[grub使用说明]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/12003695</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/12003695</guid><author>ch209209</author><pubDate>Wed, 25 Sep 2013 14:08:35 +0800</pubDate><description><![CDATA[grub 入门教程参考
http://wiki.ubuntu.org.cn/GRUB%E5%85%A5%E9%97%A8%E6%95%99%E7%A8%8B]]></description><category></category></item><item><title><![CDATA[判断一个点是否在给定的凸四边形内]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9707537</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9707537</guid><author>ch209209</author><pubDate>Thu, 01 Aug 2013 20:35:04 +0800</pubDate><description><![CDATA[转http://hi.baidu.com/quchenyuan/item/1c50a70306152f3ef3eafc8f

方法一：


如果一个点在这个凸四边形内，那么按照顺时针方向，该点一定在每条边的右侧。可使用矢量叉积来看：该方法只适用于凸多边形。

矢量叉积：

　　计算矢量叉积是与直线和线段相关算法的核心部分。设矢量P = ( x1, y1 )，Q = ( x2, y]]></description><category></category></item><item><title><![CDATA[Pascal's Triangle II]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9424715</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9424715</guid><author>ch209209</author><pubDate>Tue, 23 Jul 2013 17:04:49 +0800</pubDate><description><![CDATA[http://leetcode.com/onlinejudge#question_118


Given an index k, return the kth row
 of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

Note:
Could you optimize your alg]]></description><category></category></item><item><title><![CDATA[Git查看、删除远程分支和tag]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9421045</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9421045</guid><author>ch209209</author><pubDate>Tue, 23 Jul 2013 13:26:08 +0800</pubDate><description><![CDATA[转自http://zengrong.net/post/1746.htm


查看远程分支


加上-a参数可以查看远程分支，远程分支会用红色表示出来（如果你开了颜色支持的话）：

?View
 Code BASH








1
2
3
4
5
6
7
8
9
10



# git branch -a
  master
  remote
  tung]]></description><category></category></item><item><title><![CDATA[Pascal's Triangle --Leetcode]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9413925</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9413925</guid><author>ch209209</author><pubDate>Mon, 22 Jul 2013 21:18:18 +0800</pubDate><description><![CDATA[http://leetcode.com/onlinejudge#question_118


Given numRows, generate the first numRows of
 Pascal's triangle.

For example, given numRows = 5,
Return
[
     [1],
    [1,1],
   [1,2,1],
  [1,]]></description><category></category></item><item><title><![CDATA[ubuntu下硬盘安装win7]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9294835</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9294835</guid><author>ch209209</author><pubDate>Wed, 10 Jul 2013 21:23:08 +0800</pubDate><description><![CDATA[转自http://the5fire.com/install-archlinux-or-win-on-ubuntu-via-harddisk.html

    上周末在家两天的时间只做了一件事，那就是装系统。不同于在很早之前没事就拿张ghost盘给人装系统（win的），这次的折腾是比较有技术含量的。整个过程中弄坏了一个sdcard的卡托，sdcard也被我格了无数遍。到最后发现其实全硬盘安装就]]></description><category></category></item><item><title><![CDATA[哈尔小波变换]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9135097</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9135097</guid><author>ch209209</author><pubDate>Thu, 20 Jun 2013 10:51:43 +0800</pubDate><description><![CDATA[转自http://www.meng.edu.cn/gcss/course/gongxiangkejian/qinghua/dmtjs/course/ch08/tcp080301.html?ttype=1&tcode=menu6_06a
8.3 哈尔小波变换
    小波变换的基本思想是用一组小波函数或者基函数表示一个函数或者信号，例如图像信号。为了理解什么是小波变换，下面用一个具体的例子来说明]]></description><category></category></item><item><title><![CDATA[积分图]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/9134859</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/9134859</guid><author>ch209209</author><pubDate>Thu, 20 Jun 2013 10:35:29 +0800</pubDate><description><![CDATA[在学习opencv的surf的时候，又一次看到了积分图这个概念，便努力回忆上次是怎么用到它的。记起来了，是在学习人脸检测时，Viola-Jones的文章中提到的。积分图概念的创始人不记得了，但第一次让积分图推广使用的应该就是Viola&Jones了。




在网上看到有人对从SIFT转而想到SURF而感到惊叹的时候，我却觉得根本没什么大不了。俺第一次看到SIFT的时候，就一下子想到可以]]></description><category></category></item><item><title><![CDATA[[转载]自适应网页设计]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8880504</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8880504</guid><author>ch209209</author><pubDate>Fri, 03 May 2013 15:39:53 +0800</pubDate><description><![CDATA[随着3G的普及，越来越多的人使用手机上网。

移动设备正超过桌面设备，成为访问互联网的最常见终端。于是，网页设计师不得不面对一个难题：如何才能在不同大小的设备上呈现同样的网页？



手机的屏幕比较小，宽度通常在600像素以下；PC的屏幕宽度，一般都在1000像素以上（目前主流宽度是1366×768），有的还达到了2000像素。同样的内容，要在大小迥异的屏幕上，都呈现出满意的效果，并不]]></description><category></category></item><item><title><![CDATA[PAT-1032]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8211400</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8211400</guid><author>ch209209</author><pubDate>Thu, 22 Nov 2012 11:56:48 +0800</pubDate><description><![CDATA[1032. Sharing (25)
题目地址：http://pat.zju.edu.cn/contests/pat-practise/1032
 
To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may le]]></description><category></category></item><item><title><![CDATA[PAT-1040]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8195973</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8195973</guid><author>ch209209</author><pubDate>Sun, 18 Nov 2012 12:16:33 +0800</pubDate><description><![CDATA[1040. Longest Symmetric String
题目地址：http://pat.zju.edu.cn/contests/pat-practise/1040
Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given "Is]]></description><category></category></item><item><title><![CDATA[PAT-1015]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8194368</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8194368</guid><author>ch209209</author><pubDate>Sat, 17 Nov 2012 18:31:05 +0800</pubDate><description><![CDATA[1015. Reversible Primes (20)

题目地址：http://pat.zju.edu.cn/contests/pat-practise/1015
A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For exa]]></description><category></category></item><item><title><![CDATA[PAT -1007]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8193645</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8193645</guid><author>ch209209</author><pubDate>Sat, 17 Nov 2012 13:34:55 +0800</pubDate><description><![CDATA[1007. Maximum Subsequence Sum 
题目地址：http://pat.zju.edu.cn/contests/pat-practise/1007

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ...,]]></description><category></category></item><item><title><![CDATA[PAT-1038]]></title><link>https://blog.youkuaiyun.com/ch209209/article/details/8193475</link><guid>https://blog.youkuaiyun.com/ch209209/article/details/8193475</guid><author>ch209209</author><pubDate>Sat, 17 Nov 2012 12:17:14 +0800</pubDate><description><![CDATA[1038. Recover the Smallest Number 
题目地址：http://pat.zju.edu.cn/contests/pat-practise/1038
Given a collection of number segments, you are supposed to recover the smallest number from them. For example]]></description><category></category></item></channel></rss>