<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[UI_Shero的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/UI_Shero</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; UI_Shero]]></copyright><item><title><![CDATA[tensorboard fetching sprite image]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/102995508</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/102995508</guid><author>UI_Shero</author><pubDate>Sun, 10 Nov 2019 11:07:21 +0800</pubDate><description><![CDATA[检查自己的image_path设置的是否正确，图片是否存在。

因为自己图片路径设置问题，一直加载不出来，花了一上午时间才搞定




]]></description><category></category></item><item><title><![CDATA[problems about my git learning]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/79309531</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/79309531</guid><author>UI_Shero</author><pubDate>Sun, 11 Feb 2018 11:42:18 +0800</pubDate><description><![CDATA[ Failed to connect to github.com port 443没设代理#vim ~/.gitconfig
[user]
	name = yuqingqing
	mail = qqyu@travelsky.com
	email = yuqingqing1991@163.com
[http]
	proxy = http://xxx.xx.xx.xx:xxxx
[https]
	pr...]]></description><category></category></item><item><title><![CDATA[np.linspace() np.logspace() np.arange() 区别]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/78881067</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/78881067</guid><author>UI_Shero</author><pubDate>Sat, 23 Dec 2017 17:18:33 +0800</pubDate><description><![CDATA[np.linspace() np.logspace() np.arange() 区别
1.       np.linspace() 生成(start,stop)区间指定元素个数num的list，均匀分布




Signature: np.linspace(start, stop, num=50, endpoint=True, retstep=False, dtype=None)
D]]></description><category></category></item><item><title><![CDATA[My route on python and MachineLearning]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/78818064</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/78818064</guid><author>UI_Shero</author><pubDate>Sat, 16 Dec 2017 09:06:07 +0800</pubDate><description><![CDATA[1. python IDE 搭建 anaconda | pyCharm，python 3.6
2. tensorflow 中文手册w3cSchool、tensorflow中文论坛

3. matplotlib 哔哩哔哩 python数据分析-matplotlib:https://www.bilibili.com/video/av6989413/?from=search&seid=178945]]></description><category></category></item><item><title><![CDATA[终于运行成功tensorflow-mnist-tutorial的第一个程序mnist_1.0_softmax.py!]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/78808560</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/78808560</guid><author>UI_Shero</author><pubDate>Thu, 14 Dec 2017 23:27:44 +0800</pubDate><description><![CDATA[遇到的问题：

AttributeError: module 'pandas' has no attribute 'computation'
原因：pandas 版本(0.20.3)，退回旧版本pandas(0.19.2)(下载地址：https://pypi.python.org/pypi/pandas/0.19.2/#downloads)]]></description><category></category></item><item><title><![CDATA[windows7下基于Anaconda安装TensorFlow]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/78750567</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/78750567</guid><author>UI_Shero</author><pubDate>Fri, 08 Dec 2017 13:27:20 +0800</pubDate><description><![CDATA[$ anaconda search -t conda tensorflow
Packages:
     Name                      |  Version | Package Types   | Platforms       | Builds
     ------------------------- |   ------ | --------------- |]]></description><category></category></item><item><title><![CDATA[杭电2044--一只小蜜蜂...--（递推求解）斐波那契数列应用]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8693701</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8693701</guid><author>UI_Shero</author><pubDate>Tue, 19 Mar 2013 21:25:52 +0800</pubDate><description><![CDATA[题目：http://acm.hdu.edu.cn/showproblem.php?pid=2044
蜜蜂在1格里，它可以往2、3两格里爬。蜜蜂在6格里，它可以往7、8格里爬。
如果默认是从第一个开始走，所以n格的走法就是n-1格加上n-2格的走法，即f(n)=f(n-1)+f(n-2)，即斐波那契数列。
此题中所求为f(b-a)。
代码如下：
#include
int main()
{]]></description><category></category></item><item><title><![CDATA[Eclipse 配 tomcat 遇到的问题：tomcat启动不了原因端口被占用]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8437344</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8437344</guid><author>UI_Shero</author><pubDate>Wed, 26 Dec 2012 09:26:46 +0800</pubDate><description><![CDATA[eclipse、tomcat都装上了，配置完毕。就差启动了， 好不容易走到这一步了，结果出问题了，问题如下：
十二月 26, 2012 9:21:21 上午 org.apache.catalina.core.AprLifecycleListener init
INFO: The APR based Apache Tomcat Native library which allows optima]]></description><category></category></item><item><title><![CDATA[杭电acm- 2401 Baskets of Gold Coins]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8049531</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8049531</guid><author>UI_Shero</author><pubDate>Mon, 08 Oct 2012 18:22:56 +0800</pubDate><description><![CDATA[Problem Description
You are given N baskets of gold coins. The baskets are numbered from 1 to N. In all except one of the baskets, each gold coin weighs w grams. In the one exceptional basket, each g]]></description><category></category></item><item><title><![CDATA[杭电acm-2201熊猫阿波的故事]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8036506</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8036506</guid><author>UI_Shero</author><pubDate>Tue, 02 Oct 2012 12:57:42 +0800</pubDate><description><![CDATA[Problem Description
凡看过功夫熊猫这部电影的人都会对影片中那只憨憨的熊猫阿波留下相当深的印象，胖胖的熊猫阿波自从打败了凶狠强悍的雪豹泰龙以后，在和平谷的地位是越来越高，成为谷中第一的功夫大师。并因此他父亲经营的面馆的生意也越来越好，店里每天都会有许多慕名而来吃面和想拜阿波为师的人。
一日，阿波收到了一张请柬，请柬里说在遥远的美国将召开全球比武大会，特邀请阿波过去做嘉宾。阿波]]></description><category></category></item><item><title><![CDATA[杭电acm-2178 猜数字]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8035122</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8035122</guid><author>UI_Shero</author><pubDate>Mon, 01 Oct 2012 12:57:22 +0800</pubDate><description><![CDATA[杭电acm-2178 猜数字

猜数字
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 19 Accepted Submission(s) : 16Font:
Times New Roman| Verdana| GeorgiaFont Si]]></description><category></category></item><item><title><![CDATA[杭电acm-2164 Rock, Paper, or Scissors?]]></title><link>https://blog.youkuaiyun.com/UI_Shero/article/details/8035119</link><guid>https://blog.youkuaiyun.com/UI_Shero/article/details/8035119</guid><author>UI_Shero</author><pubDate>Mon, 01 Oct 2012 12:53:54 +0800</pubDate><description><![CDATA[杭电acm-2164 Rock, Paper, or Scissors?

Problem Description
Rock, Paper, Scissors is a two player game, where each player simultaneously chooses one of the three items after counting to three. The ga]]></description><category></category></item></channel></rss>