<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Yolanda2016的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Yolanda2016</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Yolanda2016]]></copyright><item><title><![CDATA[个性化语音——总结]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/51967638</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/51967638</guid><author>Yolanda2016</author><pubDate>Wed, 20 Jul 2016 13:57:00 +0800</pubDate><description><![CDATA[时间 2016.5.4~2016.7.20
成果： 
基于Voice Conversion的demo：VCdemo百度网盘分享
基于TTS adaption的demo：
TTS demo：
github：
方案： 
基于Voice Conversion 的语音序列转换 
总体思路 
 
基于TTS的adaption
可行性分析Voice Conversion 方法可以尝试，但效果达不到在工业界上应用]]></description><category></category></item><item><title><![CDATA[机器学习文章]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/51620021</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/51620021</guid><author>Yolanda2016</author><pubDate>Thu, 09 Jun 2016 10:50:29 +0800</pubDate><description><![CDATA[预训练1]]></description><category></category></item><item><title><![CDATA[机器学习资源]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/51619839</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/51619839</guid><author>Yolanda2016</author><pubDate>Thu, 09 Jun 2016 09:45:37 +0800</pubDate><description><![CDATA[Softmax回归
个人博客：Tonadomeet的个人博客]]></description><category></category></item><item><title><![CDATA[Leet Code add two number]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362522</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362522</guid><author>Yolanda2016</author><pubDate>Mon, 09 Feb 2015 13:45:00 +0800</pubDate><description><![CDATA[add two number
题目要求：
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe...]]></description><category></category></item><item><title><![CDATA[Leet Code3 查找字符串中最长不重复的字符]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362525</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362525</guid><author>Yolanda2016</author><pubDate>Sun, 25 Jan 2015 10:25:00 +0800</pubDate><description><![CDATA[Leet code3
Longest Substring Without Repeating Characters
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. ...]]></description><category></category></item><item><title><![CDATA[二分法查找（递归和循环）]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362523</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362523</guid><author>Yolanda2016</author><pubDate>Mon, 19 Jan 2015 21:03:00 +0800</pubDate><description><![CDATA[二分法查找
二分法使用了折半查找的思想，不断的变化，数组下标的起始位置（begin）和终止位置(end)来进行搜索。
前提：二分法查找的前提是数组必须是有序的（如果包含重复值，将输出第一个值得下标）

我们使用两种算法，解决二分查找：
public class Solution {
//给定一个数组，数组里面下标加起来等于 给定的目标数字，求下标
public static void m...]]></description><category></category></item><item><title><![CDATA[Leet Code 1:计算数组中两个任意数加起来等于目标数]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362521</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362521</guid><author>Yolanda2016</author><pubDate>Sat, 17 Jan 2015 14:04:00 +0800</pubDate><description><![CDATA[Two sum (leetcode)
refer:https://oj.leetcode.com/problems/two-sum/

Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum sho...]]></description><category></category></item><item><title><![CDATA[小球落地距离计算（递归）]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362520</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362520</guid><author>Yolanda2016</author><pubDate>Fri, 16 Jan 2015 21:58:00 +0800</pubDate><description><![CDATA[计算小球轨迹：
题目：有一个小球，从100米的高度落地，每次弹起来是原来下落高度的一半，求落地十次小球走的轨迹距离。

采用递归的思想，除了第一次小球落地需要不同外，剩下的的九次小球落地的距离为，n-1次小球的距离+2*小球弹起的高度。
java 递归算法如下：
public class Snippet {
public static void main(String[] args)...]]></description><category></category></item><item><title><![CDATA[Ecplise 小技巧]]></title><link>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362519</link><guid>https://blog.youkuaiyun.com/Yolanda2016/article/details/102362519</guid><author>Yolanda2016</author><pubDate>Fri, 16 Jan 2015 11:23:00 +0800</pubDate><description><![CDATA[Ecplise 小技巧

Ecplise 快速提示提示
Ecplise 代码字体调大
Ecplise 编辑框背景颜色调节

1 ecplise 快速提示
没有经过任何配置的Ecplise 每次只有输入 "." 的时候才有提示，经过配置后任何输入都能提示包括输入“@” 会有注解提示。
下面是配置步骤：
点击 Window-&gt;References-&gt;Java-&gt;Editor...]]></description><category></category></item></channel></rss>