<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[芝兰生于深谷，不以无人而不芳]]></title><description><![CDATA[学习的点点滴滴]]></description><link>https://blog.youkuaiyun.com/wdkirchhoff</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wdkirchhoff]]></copyright><item><title><![CDATA[Latex llncs2e模板 通讯作者标注小信封方法]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/83040152</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/83040152</guid><author>wdkirchhoff</author><pubDate>Sat, 13 Oct 2018 16:59:48 +0800</pubDate><description><![CDATA[To mark the corresponding author in the first page of the paper, you should use a small envelope. You can use the bbding package of LaTex, and use the command \inst{ (}\Envelope\inst{)} right after th...]]></description><category></category></item><item><title><![CDATA[Add emacs key bindings to Microsoft Word on OSX platform]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/79054004</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/79054004</guid><author>wdkirchhoff</author><pubDate>Sat, 13 Jan 2018 22:00:09 +0800</pubDate><description><![CDATA[Emacs users get addicted to the standard key bindings (which are also available in Cocoa apps). Microsoft Word doesn’t support these by default, but you can add them through customization. Here are th]]></description><category></category></item><item><title><![CDATA[brew 更新]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/79035404</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/79035404</guid><author>wdkirchhoff</author><pubDate>Thu, 11 Jan 2018 16:09:19 +0800</pubDate><description><![CDATA[为什么要定期更新 
我发现不少人都不会经常更新，或者只在必须用某个工具的新版本的时候才更新。他们的看法是，更新有可能产生一些意外的问题，反正当前环境足够稳定可以用，干嘛自找麻烦呢？

这个看法对也不对。对是因为，更新产生的潜在问题不可避免。不对是因为总有一天你需要升级的，也许是为了某个工具的新特性，也许是为了修复软件的漏洞，也许你安装的包非要依赖另一个包的新版本，等等。如果隔了很长一段时间才升级，]]></description><category></category></item><item><title><![CDATA[Sublime和SumatraPDF双向选择的设置方案]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/78068608</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/78068608</guid><author>wdkirchhoff</author><pubDate>Sat, 23 Sep 2017 09:08:03 +0800</pubDate><description><![CDATA[怎么配置Sublime编辑latex的暂时不记录了，只记录个Inverse search的option："D:\Program Files\Sublime Text 3\sublime_text.exe" "%f:%l"前面是sublime_test.exe的路径，除此以外，要将sumatra加入PATH环境变量。]]></description><category></category></item><item><title><![CDATA[(转)max-min fairness 最大最小公平算法]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/77185434</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/77185434</guid><author>wdkirchhoff</author><pubDate>Tue, 15 Aug 2017 11:06:27 +0800</pubDate><description><![CDATA[我们经常面临给一组用户划分稀有资源的问题,他们都享有等价的权利来获取资源,但是其中一些用户实际上只需要比其他用户少的资源.那么我们如何来分配资源呢?一种在实际中广泛使用的分享技术称作“最大最小公平分享”.直观上,公平分享分配给每个用户想要的可以满足的最小需求,然后将没有使用的资源均匀的分配给需要‘大资源’的用户。最大最小公平分配算法的形式化定义如下：资源按照需求递增的顺序进行分配 
不存在用户得到的]]></description><category></category></item><item><title><![CDATA[Dominant Resource Fairness: Fair Allocation of Multiple Resource Types]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/76408638</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/76408638</guid><author>wdkirchhoff</author><pubDate>Mon, 14 Aug 2017 19:40:40 +0800</pubDate><description><![CDATA[论文的大致内容： 
在一个拥有多资源系统中往往需要面对资源平均分配的问题，每个用户对每个资源都有不同的需求。针对这个问题，伯克利几位大牛Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica发表了一篇文章，提出Dominant Resoruce Fairness(DRF)算法，一个多]]></description><category></category></item><item><title><![CDATA[New Surface pro +Vmware 12 +Ubuntu 16.04 分辨率问题]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/73694823</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/73694823</guid><author>wdkirchhoff</author><pubDate>Sat, 24 Jun 2017 20:55:25 +0800</pubDate><description><![CDATA[最近新入了今年的Surface pro，众所周知这个屏幕是个高清屏，3：2的比例，高达2736x1824的分辨率，但是安装完Vmware 12+Ubuntu 16.04后分辨率一直有点问题，1400x1050勉强能看，但是这个是4：3比例的，别的分辨率都不太合适。通过一晚上的摸索，总结如下的配置，粘贴到~/.xprofile即可xrandr --newmode "2048x1364_60.00"]]></description><category></category></item><item><title><![CDATA[Aurora的安装和中文配置]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/72903885</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/72903885</guid><author>wdkirchhoff</author><pubDate>Wed, 07 Jun 2017 20:58:42 +0800</pubDate><description><![CDATA[Aurora是office系列的支持latex公式的收费插件，可以方便地在word中插入公式。安装该软件需要两个东西：1.Aurora本身；2.latex编译程序。安装好Aurora后，需要设置latex编译程序位置，完成公式编译。 
安装的时候，如果你已经安装了Ctex则不需要再安装Miktex。如果你想要公式中支持中文，建议安装Ctex，避免安装Miktex后复杂的配置。 
安装好，破解结束后，]]></description><category></category></item><item><title><![CDATA[LeetCode Array Partition I]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/71709870</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/71709870</guid><author>wdkirchhoff</author><pubDate>Fri, 12 May 2017 10:30:30 +0800</pubDate><description><![CDATA[Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possibl]]></description><category></category></item><item><title><![CDATA[LeetCode Majority Element]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/71708093</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/71708093</guid><author>wdkirchhoff</author><pubDate>Fri, 12 May 2017 10:14:24 +0800</pubDate><description><![CDATA[Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element always]]></description><category></category></item><item><title><![CDATA[LeetCode Base 7]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/68492565</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/68492565</guid><author>wdkirchhoff</author><pubDate>Thu, 30 Mar 2017 19:41:10 +0800</pubDate><description><![CDATA[class Solution(object):
    def convertToBase7(self, num):
        """
        :type num: int
        :rtype: str
        """
        res= ""
        flag = 0
        if num == 0:
            return "0]]></description><category></category></item><item><title><![CDATA[LeetCode  Delete Node in a Linked List]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/68492013</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/68492013</guid><author>wdkirchhoff</author><pubDate>Thu, 30 Mar 2017 19:31:46 +0800</pubDate><description><![CDATA[# Definition for singly-linked list.
class ListNode(object):
    def __init__(self, x):
        self.val = x
        self.next = Noneclass Solution(object):
    def deleteNode(self, node):
        """]]></description><category></category></item><item><title><![CDATA[LeetCode Minimum Moves to Equal Array Elements]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67634424</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67634424</guid><author>wdkirchhoff</author><pubDate>Tue, 28 Mar 2017 12:24:04 +0800</pubDate><description><![CDATA[#coding=utf-8
class Solution(object):
    def minMoves(self, nums):
        """
        :type nums: list[int]
        :rtype: int
        """
        #该问题与每次自减一个元素，等价
        res = 0
        m = min(nu]]></description><category></category></item><item><title><![CDATA[LeetCode First Unique Character in a String]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67110287</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67110287</guid><author>wdkirchhoff</author><pubDate>Mon, 27 Mar 2017 23:56:25 +0800</pubDate><description><![CDATA[#coding=utf-8
import string
class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        k_v = {}
        t = [s.find(i) for i in str]]></description><category></category></item><item><title><![CDATA[LeetCode Ransom Note]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67094841</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/67094841</guid><author>wdkirchhoff</author><pubDate>Mon, 27 Mar 2017 23:34:18 +0800</pubDate><description><![CDATA[class Solution(object):
    def canConstruct(self, ransomNote, magazine):
        """
        :type ransomNote: str
        :type magazine: str
        :rtype: bool
        """
        magazine_k_v = {]]></description><category></category></item><item><title><![CDATA[LeetCode Assign Cookies]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66971229</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66971229</guid><author>wdkirchhoff</author><pubDate>Mon, 27 Mar 2017 14:20:24 +0800</pubDate><description><![CDATA[class Solution(object):
    def findContentChildren(self, g, s):
        """
        :type g: list[int]
        :type s: list[int]
        :rtype: int
        """
        res = 0
        g.sort()]]></description><category></category></item><item><title><![CDATA[LeetCode Relative Ranks]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66476044</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66476044</guid><author>wdkirchhoff</author><pubDate>Sun, 26 Mar 2017 15:43:25 +0800</pubDate><description><![CDATA[class Solution(object):
    def findRelativeRanks(self, nums):
        """
        :type nums: list[int]
        :rtype: list[str]
            """
        origin_nums = nums[:]
        nums.sort()]]></description><category></category></item><item><title><![CDATA[LeetCode Move Zeroes]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66175308</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66175308</guid><author>wdkirchhoff</author><pubDate>Sun, 26 Mar 2017 00:50:15 +0800</pubDate><description><![CDATA[class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: list[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        i,j= 0,]]></description><category></category></item><item><title><![CDATA[LeetCode Construct the Rectangle]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66147744</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66147744</guid><author>wdkirchhoff</author><pubDate>Sun, 26 Mar 2017 00:31:31 +0800</pubDate><description><![CDATA[import math
class Solution(object):
    def constructRectangle(self, area):
        """
        :type area: int
        :rtype: list[int]
        """
        #x^2=area
        x = math.sqrt(area)]]></description><category></category></item><item><title><![CDATA[LeetCode Add Digits]]></title><link>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66100433</link><guid>https://blog.youkuaiyun.com/wdkirchhoff/article/details/66100433</guid><author>wdkirchhoff</author><pubDate>Sat, 25 Mar 2017 23:54:33 +0800</pubDate><description><![CDATA[class Solution(object):
    def addDigits(self, num):
        """
        :type num: int
        :rtype: int
        """
        while num % 10 != num:
            s = str(num)
            num = sum([i]]></description><category></category></item></channel></rss>