<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JasonRaySHD的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JasonRaySHD</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JasonRaySHD]]></copyright><item><title><![CDATA[使用python 中的socket包实现本地电脑与阿里云ECS服务器的通信]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/106784967</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/106784967</guid><author>JasonRaySHD</author><pubDate>Tue, 16 Jun 2020 12:55:08 +0800</pubDate><description><![CDATA[这里有三个坑点：
1、服务器使用bind((HOST,PORT))命令时，HOST是该主机的私有IP（可以通过ifconfig查看，也可以打开阿里云网页上面的控制台查看），而客户端，也就是我们的电脑上面运行connect((HOST,PORT))时，HOST是我们要连接的服务器的公网IP（可以打开阿里云网页上面的控制台查看）
2、在阿里云的安全组设置里面要开启你相连接/开放的端口
3、在服务器内部（可以用xshell连接，也可以直接在阿里云网站上打开云命令行）也要开放端口：
输入命令，打开iptables的]]></description><category></category></item><item><title><![CDATA[利用深度可分离卷积(depth-wise seperable convolution)和DCGAN生成二次元头像]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105631842</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105631842</guid><author>JasonRaySHD</author><pubDate>Tue, 28 Apr 2020 22:33:13 +0800</pubDate><description><![CDATA[代码放在了github上：Mobilenet+GAN
因为国内对discriminator的叫法很多，所以笔者这里就直接用英文了。
二次元头像只需要利用最简单的DCGAN网络结构就可以稳定，快速地训练出来。因为本篇重点不是DCGAN，这里对DCGAN就不做介绍了。
笔者这次利用Mobilenet-v1中的depth-wise seperable 结构来做GAN的鉴定器，并与DCGAN进行对比。也对...]]></description><category></category></item><item><title><![CDATA[已经安装pytorch cpu版本时 再安装GPU版本教程，解决下载pytorch速度慢问题]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105569402</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105569402</guid><author>JasonRaySHD</author><pubDate>Thu, 16 Apr 2020 23:22:23 +0800</pubDate><description><![CDATA[我的环境：
CPU： i5-6300HQ  OS：window10 GPU：GTX960
pytorch-cpu :1.4
torchvision: 0.5

首先win+R打开cmd窗口，输入命令
nvcc --version


我的cuda版本是10.0。好，现在我们打开pytorch官网，选择对应cuda版本的pytorch生成下载命令。

重点来了！
我们安装过pytorch的朋友应该知...]]></description><category></category></item><item><title><![CDATA[深度学习入门:pytorch实战CIFAR10图片分类]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105314133</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/105314133</guid><author>JasonRaySHD</author><pubDate>Sat, 04 Apr 2020 21:50:06 +0800</pubDate><description><![CDATA[本篇博客站在复现的角度，讲解每一步可能遇到的问题
你可以狠狠的戳这里，直接查看pytorch官网原项目:

环境：

pytorch 1.4+cpu
python 3.7‘


CIFAR10数据样式

我们跳过一些展示图片的过程，直入主题。
首先，要下载CIFAR10数据库：
1、torchvision数据集输出的是PIL类，且值取值范围是[0,1]。因此首先要将PIL转换为Tensor类。py...]]></description><category></category></item><item><title><![CDATA[1007 Maximum Subsequence Sum (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104716227</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104716227</guid><author>JasonRaySHD</author><pubDate>Sat, 07 Mar 2020 16:03:49 +0800</pubDate><description><![CDATA[1007 Maximum Subsequence Sum (25分)
Given a sequence of K integers { N​1, N2, …, N​K}. A continuous subsequence is defined to be { N​i, N​i+1, …, N​j} where 1≤i≤j≤K. The Maximum Subsequence is the cont...]]></description><category></category></item><item><title><![CDATA[1105 Spiral Matrix (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104653515</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104653515</guid><author>JasonRaySHD</author><pubDate>Wed, 04 Mar 2020 15:08:40 +0800</pubDate><description><![CDATA[1105 Spiral Matrix (25分)
This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the upper-...]]></description><category></category></item><item><title><![CDATA[1125 Chain the Ropes (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104517881</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104517881</guid><author>JasonRaySHD</author><pubDate>Wed, 26 Feb 2020 15:27:25 +0800</pubDate><description><![CDATA[1125 Chain the Ropes (25分)
Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the...]]></description><category></category></item><item><title><![CDATA[PAT（Advancedlevel） 1033 To Fill or Not to Fill (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104277756</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104277756</guid><author>JasonRaySHD</author><pubDate>Wed, 12 Feb 2020 15:37:37 +0800</pubDate><description><![CDATA[1033 To Fill or Not to Fill (25分)
With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the w...]]></description><category></category></item><item><title><![CDATA[二叉树：已知前序序列与后序序列建树]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104223642</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104223642</guid><author>JasonRaySHD</author><pubDate>Sat, 08 Feb 2020 19:35:53 +0800</pubDate><description><![CDATA[二叉树：已知前序与后序建树
已知前序与中序、后序与中序建树是常遇到的算法问题。若已知前序序列与后序序列，要求输出满足条件的树的个数或者输出所有可能的树的中序序列，该怎么解决？下面我们一步步讨论这个问题。
首先，已知一个树的结点数n，共有多少种树形？（或者，已知一颗树的先序/中序/后序序列，共有多少种树形？）
答案是Cmn/(n+1)C_{m}^{n}/(n+1)Cmn​/(n+1)种。点这里了解一...]]></description><category></category></item><item><title><![CDATA[PAT (Advanced Level)1110 Complete Binary Tree (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104200527</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104200527</guid><author>JasonRaySHD</author><pubDate>Thu, 06 Feb 2020 18:57:04 +0800</pubDate><description><![CDATA[1110 Complete Binary Tree (25分)
Given a tree, you are supposed to tell if it is a complete binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives...]]></description><category></category></item><item><title><![CDATA[PAT (Advanced Level)1104 Sum of Number Segments (20分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104185722</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104185722</guid><author>JasonRaySHD</author><pubDate>Wed, 05 Feb 2020 17:48:20 +0800</pubDate><description><![CDATA[1104 Sum of Number Segments (20分)
Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segment...]]></description><category></category></item><item><title><![CDATA[PAT (Advanced Level)1105 Spiral Matrix (25分)]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104185399</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/104185399</guid><author>JasonRaySHD</author><pubDate>Wed, 05 Feb 2020 17:33:04 +0800</pubDate><description><![CDATA[1105 Spiral Matrix (25分)

This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the...]]></description><category></category></item><item><title><![CDATA[SVM学习笔记]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/103928343</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/103928343</guid><author>JasonRaySHD</author><pubDate>Fri, 10 Jan 2020 17:33:17 +0800</pubDate><description><![CDATA[最近在学习如何利用支持向量机进行分类，这里列举一下面试中常见的有关支持向量机的问题：
例如：SVM的原理是什么？SVM为什么采用间隔最大化？为什么SVM对缺失数据敏感？SVM如何处理多分类问题？具体参见以下链接。
参考：
【1】常见有关SVM的面试问题：https://blog.youkuaiyun.com/szlcw1/article/details/52259668
【2】关于C以及gamma在SVM中的...]]></description><category></category></item><item><title><![CDATA[PAT (Advanced Level)  1010 Radix （25 分）]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/103020408</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/103020408</guid><author>JasonRaySHD</author><pubDate>Mon, 11 Nov 2019 23:09:03 +0800</pubDate><description><![CDATA[这道题的坑主要有下面几点：
1、进制上界根据所给数的十进制大小确定，下界由最大数位决定。
2、使用二分防止超时。
3、二分时注意判断查找结果是否溢出（从某一进制转换为10进制时可能发生溢出）
#include&lt;bits/stdc++.h&gt;
using namespace std;

typedef long long ll;
string n1,n2;
int tag;
ll radi...]]></description><category></category></item><item><title><![CDATA[一些移动端设备的devicePixelRatio]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89648213</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89648213</guid><author>JasonRaySHD</author><pubDate>Sun, 28 Apr 2019 23:21:37 +0800</pubDate><description><![CDATA[设备像素为:1.0    (-webkit-min-device-pixel-ratio)
所有non-Retina mac电脑
苹果iPhone(第一代)
苹果iPhone 3 g
苹果iPhone 3 gs
苹果iPad(第一代)
苹果iPad 2
苹果iPad迷你(第一代)
宏碁Iconia A500
三星Galaxy Tab 10.1
三星Galaxy S
设备像素为:1.3    (-w...]]></description><category></category></item><item><title><![CDATA[Vue建站：FileReader的异步问题]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89643215</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89643215</guid><author>JasonRaySHD</author><pubDate>Sun, 28 Apr 2019 18:07:41 +0800</pubDate><description><![CDATA[因为想统一通过base64传输gif文件，所以在不能通过canvas重绘修正并得到base64编码的情况下，我选择使用FileReader()来获取gif文件的base64编码，但是有个问题困扰了我很久:
    readasbase64(file){
    //     return new Promise(function(resolve, reject) {    
    //     ...]]></description><category></category></item><item><title><![CDATA[JS在WEB手机端可以实现的操作（发送短信，拨打电话）]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89631234</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89631234</guid><author>JasonRaySHD</author><pubDate>Sun, 28 Apr 2019 09:11:40 +0800</pubDate><description><![CDATA[本文章转载自学新通博客，文章地址：
https://blog.iinu.com.cn/Article/detail/aid/322.html

1.最常用WEB页面JS实现一键拨号的电话拨打功能：
&lt;a href="tel:13764567708"&gt;移动WEB页面JS一键拨打号码咨询功能&lt;/a&gt;

在拨号界面，显示号码，并提示拨打。
支持大部分的浏览器，但是在QQ浏览器上支...]]></description><category></category></item><item><title><![CDATA[Vue建站：前端常用色彩汇总（转载）]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89608522</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89608522</guid><author>JasonRaySHD</author><pubDate>Sat, 27 Apr 2019 22:08:46 +0800</pubDate><description><![CDATA[总表图如下：FFFFFF#DDDDDD#AAAAAA#888888#666666#444444#000000#FFB7DD#FF88C2#FF44AA#FF0088#C10066#A20055#8C0044#FFCCCC#FF8888#FF3333#FF0000#CC0000#AA0000#...]]></description><category></category></item><item><title><![CDATA[Vue建站  php错误:Call to a member function execute() on a non-object]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89576573</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89576573</guid><author>JasonRaySHD</author><pubDate>Fri, 26 Apr 2019 20:54:34 +0800</pubDate><description><![CDATA[1、查看sql语句是否由差错。
2、查看php编码是否为utf-8,在程序开头加上:
header(“Content-Type: text/html;charset=utf-8”);
3、查看数据库中要查询的字段排序方式选择，系统默认是lantin编码，改为utf8-unicode-ci。
我是因为原因3 debug了2个小时，写在小本本上，记仇

...]]></description><category></category></item><item><title><![CDATA[vue.js框架+mintUI 网站自建之阿里云邮箱服务使用，完成网站发送验证码模块]]></title><link>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89426440</link><guid>https://blog.youkuaiyun.com/JasonRaySHD/article/details/89426440</guid><author>JasonRaySHD</author><pubDate>Sun, 21 Apr 2019 00:49:12 +0800</pubDate><description><![CDATA[挖个坑 again

]]></description><category></category></item></channel></rss>