<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[liulingbo918]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/liulingb</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; liulingb]]></copyright><item><title><![CDATA[论文摘要： Multi-view Face Detection Using Deep Convolutional Neural Networks]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/47702645</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/47702645</guid><author>liulingb</author><pubDate>Sun, 16 Aug 2015 16:16:27 +0800</pubDate><description><![CDATA[2015 ICMR的一篇文章， 用CNN来做Fece Detection。
   亮点不多或者说没有，简单地记录。


    一、网络架构
 采用（finetuning）AlexNet， 把fc6，fc7， fc8改成convolution layers， 最后接个soft-max layer。
 最后soft-max layer是表示图片为bg， 正脸，侧脸(左右)等的可能性。]]></description><category></category></item><item><title><![CDATA[C/C++ 任意大小的二维数组作为函数参数]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/26523925</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/26523925</guid><author>liulingb</author><pubDate>Thu, 22 May 2014 00:41:23 +0800</pubDate><description><![CDATA[已知 int a[3][3]={{1,1,1},{1,1,1},{1,1,1}}; 

求 啊

方法1：
  int lcs(int *a,int n, int m) 
{     
    int sum=0;
    int i, j;
 
    for(i = 0; i 
    {
        for(j = 0; j 
            sum +]]></description><category></category></item><item><title><![CDATA[实战：MySQL Sending data导致查询很慢的问题详细分析]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/25010119</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/25010119</guid><author>liulingb</author><pubDate>Mon, 05 May 2014 00:10:33 +0800</pubDate><description><![CDATA[这两天帮忙定位一个mysql查询很慢的问题，定位过程综合各种方法、理论、工具，很有代表性，分享给大家作为新年礼物：）


【问题现象】
使用sphinx支持倒排索引，但sphinx从mysql查询源数据的时候，查询的记录数才几万条，但查询的速度非常慢，大概要4~5分钟左右


【处理过程】
1）explain
首先怀疑索引没有建好，于是使用explain查看查询计划，结果如下：]]></description><category></category></item><item><title><![CDATA[ACdream Triangles]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/24906423</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/24906423</guid><author>liulingb</author><pubDate>Sat, 03 May 2014 10:44:24 +0800</pubDate><description><![CDATA[Problem Description
已知一个圆的圆周被N个点分成了N段等长圆弧，求任意取三个点，组成锐角三角形的个数。
Input
多组数据，每组数据一个N(N <= 1000000)
Output
对于每组数据，输出不同锐角三角形的个数。]]></description><category></category></item><item><title><![CDATA[ACdream 同心树]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/24844039</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/24844039</guid><author>liulingb</author><pubDate>Thu, 01 May 2014 16:40:34 +0800</pubDate><description><![CDATA[ACdream 同心树： 给定两个变更长]]></description><category></category></item><item><title><![CDATA[KMP算法]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/24117351</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/24117351</guid><author>liulingb</author><pubDate>Sat, 19 Apr 2014 16:16:34 +0800</pubDate><description><![CDATA[Problem Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair ]]></description><category></category></item><item><title><![CDATA[烦人的幻灯片（类拓扑排序）]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/23748329</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/23748329</guid><author>liulingb</author><pubDate>Tue, 15 Apr 2014 11:48:38 +0800</pubDate><description><![CDATA[【题目描述】
李教授将于今天下午作一次非常重要的演讲。不幸的是他不是一个非常爱整洁的人，他把自己演讲要用的幻灯片随便堆在了一起。因此，演讲之前他不得不去整理这些幻灯片。作为一个讲求效率的学者，他希望尽可能简单地完成它。教授这次演讲一共要用n张幻灯片（n
现在我们用大写字母A，B，C……再次把幻灯片依次编号。你的任务是编写一个程序，把幻灯片的数字编号和字母编号对应起来，显然这种对应应该是唯一的；]]></description><category></category></item><item><title><![CDATA[Poj 2239 Selecting Courses 二分图最大匹配]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/23738615</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/23738615</guid><author>liulingb</author><pubDate>Tue, 15 Apr 2014 09:51:17 +0800</pubDate><description><![CDATA[Selecting Courses 题意]]></description><category></category></item><item><title><![CDATA[K-th string  （微软2014实习生及秋令营技术类职位在线测试题）]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/23558437</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/23558437</guid><author>liulingb</author><pubDate>Sat, 12 Apr 2014 23:27:16 +0800</pubDate><description><![CDATA[时间限制:10000ms
单点时限:1000ms
内存限制:256MB

Description

Consider a string set that each of them consists of {0, 1} only. All strings in the set have the same number of 0s and 1s. Write a program to find and]]></description><category></category></item><item><title><![CDATA[Poj 1459 Power Network 最大流]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/23391991</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/23391991</guid><author>liulingb</author><pubDate>Thu, 10 Apr 2014 23:05:04 +0800</pubDate><description><![CDATA[Poj的1459题Power Network，很敏]]></description><category></category></item><item><title><![CDATA[康托展开及其应用]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/22110963</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/22110963</guid><author>liulingb</author><pubDate>Wed, 26 Mar 2014 01:20:42 +0800</pubDate><description><![CDATA[康托展开是一种特殊的哈西函数，用阶乘的线性组合来表示一个数x，即x = a[n] * n! + a[n-1] * (n-1)! + .... + a[1] * 1! , 其中0 
 3 * 3! + 0 * 2! + 
1 * 1! , 所以可以用 [3, 0, 1] 来表示19。（网上有很多博客把康托展开定义为 X=an*(n-1)!+an-1*(n-2)!+...+ai*(i-1)!+..]]></description><category></category></item><item><title><![CDATA[关于Zxing二维码开发的问题]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/9961119</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/9961119</guid><author>liulingb</author><pubDate>Wed, 14 Aug 2013 11:43:47 +0800</pubDate><description><![CDATA[最近要做一个android平台下的软件，其中一个功能就涉及到二维码的扫描与解码。谷歌有一个关于二维码的开源项目zxing（https://code.google.com/p/zxing/），目前国内很多软件都会用这个项目的API。但我一个C/C++ 程序猿，在android方面完全是一个菜鸟，所以要弄懂zxing的源代码的确有很大的困难，于是在晚上找了一个精简版的ZXingDemo。在编译个过程中]]></description><category></category></item><item><title><![CDATA[数据库大作业总结]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/9052769</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/9052769</guid><author>liulingb</author><pubDate>Sat, 08 Jun 2013 01:53:11 +0800</pubDate><description><![CDATA[今晚，我们的数据库大作业就基本完工了。不过自己离真正熟练运用数据库还有一段好遥远的距离。
我们这次大作业是选择用网站的形式做一个宠物店管理系统。其实这不是我的最初的设想，我觉得如果只是做一个web的运用，没有什么意义，只是很辛苦地写很多代码，后来也证明了这一点。所以，我一开始的就想自己实现一个数据库，这样我们就能够深入的理解数据库的底层实现。但考虑到我们组员的实力与观点，最终还是选择了做一个we]]></description><category></category></item><item><title><![CDATA[ABC: Always Be Coding——程序员面试必读]]></title><link>https://blog.youkuaiyun.com/liulingb/article/details/8972147</link><guid>https://blog.youkuaiyun.com/liulingb/article/details/8972147</guid><author>liulingb</author><pubDate>Fri, 24 May 2013 22:49:15 +0800</pubDate><description><![CDATA[--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------]]></description><category></category></item></channel></rss>