<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[PiscesCrab的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/PiscesCrab</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; PiscesCrab]]></copyright><item><title><![CDATA[Codeforces 1027D 图论]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/81869184</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/81869184</guid><author>PiscesCrab</author><pubDate>Mon, 20 Aug 2018 12:33:23 +0800</pubDate><description><![CDATA[题目：

D. Mouse Hunt

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Medicine faculty of Berland State University has just finished...]]></description><category></category></item><item><title><![CDATA[mnist 多层感知机 及 模型保存和重新加载]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/81744056</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/81744056</guid><author>PiscesCrab</author><pubDate>Thu, 16 Aug 2018 16:24:09 +0800</pubDate><description><![CDATA[前一篇文章中写了mnist的两种训练方法，今天尝试自己搭建网络。这次，搭建了一个只含两层隐层和一层dropout层

本模型训练速度很快，且训练正确率达到了98%以上。

此外，本代码中还包含了保存模型和再次导入模型的内容。

具体代码如下：


# -*- coding: utf-8 -*-
&quot;&quot;&quot;
Created on Thu Aug 16 10:02:18 2018

@author: cz...]]></description><category></category></item><item><title><![CDATA[mnist 神经网络——tensorflow基础]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/81193062</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/81193062</guid><author>PiscesCrab</author><pubDate>Tue, 24 Jul 2018 21:45:08 +0800</pubDate><description><![CDATA[使用两层卷积层搭建的卷积神经网络，实现mnist的识别。

使用了两层卷积+池化层，一层全连接层(fully connected layer)，并在全连接层中使用dropout以防止过拟合。

代码：


# -*- coding: utf-8 -*-
&quot;&quot;&quot;
Created on Sat Jul 21 05:13:22 2018

@author: czx
&quot;&quot;&quot;

import tensorf...]]></description><category></category></item><item><title><![CDATA[MNIST softmax——tensorflow初学]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/81139716</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/81139716</guid><author>PiscesCrab</author><pubDate>Fri, 20 Jul 2018 22:55:15 +0800</pubDate><description><![CDATA[花了一上午终于搞定了anaconda，tensorflow，使用spyder IDE写机器学习代码

tensorflow入门 MNIST手写数字识别。模仿着教程的代码写，也算小有收获。

以下代码：


# -*- coding: utf-8 -*-
&quot;&quot;&quot;
Created on Fri Jul 20 14:12:45 2018

@author: czx
&quot;&quot;&quot;

# create a sof...]]></description><category></category></item><item><title><![CDATA[codeforcces 1000C 模拟+思维]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872536</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872536</guid><author>PiscesCrab</author><pubDate>Sun, 01 Jul 2018 10:50:13 +0800</pubDate><description><![CDATA[C. Covered Points Counttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given nn segments on a coordinate line; each endpoint of every segm...]]></description><category></category></item><item><title><![CDATA[Codeforces 1000B 贪心+模拟]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872494</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872494</guid><author>PiscesCrab</author><pubDate>Sun, 01 Jul 2018 10:41:30 +0800</pubDate><description><![CDATA[B. Light It Uptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, you bought a brand new smart lamp with programming features. At first, you ...]]></description><category></category></item><item><title><![CDATA[Codeforecs 991D 暴力模拟]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872429</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872429</guid><author>PiscesCrab</author><pubDate>Sun, 01 Jul 2018 10:33:10 +0800</pubDate><description><![CDATA[D. Bishwocktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBishwock is a chess figure that consists of three squares resembling an &quot;L-bar&quot;. This fi...]]></description><category></category></item><item><title><![CDATA[Codeforces 991C 二分]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872398</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872398</guid><author>PiscesCrab</author><pubDate>Sun, 01 Jul 2018 10:29:23 +0800</pubDate><description><![CDATA[C. Candiestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter passing a test, Vasya got himself a box of nn candies. He decided to eat an equal a...]]></description><category></category></item><item><title><![CDATA[Codeforces 991B 水题]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872351</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80872351</guid><author>PiscesCrab</author><pubDate>Sun, 01 Jul 2018 10:25:43 +0800</pubDate><description><![CDATA[B. Getting an Atime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTranslator's note: in Russia's most widespread grading system, there are four grades...]]></description><category></category></item><item><title><![CDATA[Codeforces 982C dfs]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80708516</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80708516</guid><author>PiscesCrab</author><pubDate>Fri, 15 Jun 2018 18:04:51 +0800</pubDate><description><![CDATA[C. Cut 'em all!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou're given a tree with nn vertices.Your task is to determine the maximum possible ...]]></description><category></category></item><item><title><![CDATA[Codeforces 989C 思维]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80698360</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80698360</guid><author>PiscesCrab</author><pubDate>Thu, 14 Jun 2018 21:24:40 +0800</pubDate><description><![CDATA[C. A Mist of Florescencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs the boat drifts down the river, a wood full of blossoms shows up on the ...]]></description><category></category></item><item><title><![CDATA[Codeforces 990D 图论+思维]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697700</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697700</guid><author>PiscesCrab</author><pubDate>Thu, 14 Jun 2018 20:14:28 +0800</pubDate><description><![CDATA[D. Graph And Its Complementtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven three numbers n,a,bn,a,b. You need to find an adjacency matrix of...]]></description><category></category></item><item><title><![CDATA[Codeforces 990C 水题]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697632</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697632</guid><author>PiscesCrab</author><pubDate>Thu, 14 Jun 2018 20:06:01 +0800</pubDate><description><![CDATA[C. Bracket Sequences Concatenation Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA bracket sequence is a string containing only character...]]></description><category></category></item><item><title><![CDATA[codeforces 990B 水题]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697595</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80697595</guid><author>PiscesCrab</author><pubDate>Thu, 14 Jun 2018 19:59:21 +0800</pubDate><description><![CDATA[B. Micro-Worldtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a Petri dish with bacteria and you are preparing to dive into the harsh mic...]]></description><category></category></item><item><title><![CDATA[Codeforces 975B 水题]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80472198</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80472198</guid><author>PiscesCrab</author><pubDate>Sun, 27 May 2018 20:30:53 +0800</pubDate><description><![CDATA[B. Mancalatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMancala is a game famous in the Middle East. It is played on a board that consists of 14 ...]]></description><category></category></item><item><title><![CDATA[Codeforces 985C 贪心]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471825</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471825</guid><author>PiscesCrab</author><pubDate>Sun, 27 May 2018 19:59:25 +0800</pubDate><description><![CDATA[C. Liebig's Barrelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have m = n·k wooden staves. The i-th stave has length ai. You have to assem...]]></description><category></category></item><item><title><![CDATA[Codeforces 985B 水题]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471745</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471745</guid><author>PiscesCrab</author><pubDate>Sun, 27 May 2018 19:38:30 +0800</pubDate><description><![CDATA[B. Switches and Lampstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n switches and m lamps. The i-th switch turns on some subset of...]]></description><category></category></item><item><title><![CDATA[Codeforces 975C 二分]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471567</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471567</guid><author>PiscesCrab</author><pubDate>Sun, 27 May 2018 19:15:20 +0800</pubDate><description><![CDATA[C. Valhalla Siegetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvar the Boneless is a great leader. He is trying to capture Kattegat from Lagert...]]></description><category></category></item><item><title><![CDATA[Codeforces  975D 计算几何]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471513</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/80471513</guid><author>PiscesCrab</author><pubDate>Sun, 27 May 2018 19:08:25 +0800</pubDate><description><![CDATA[Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way.There are nn ghosts in the universe, they move in the OXYOXY plane, each one of...]]></description><category></category></item><item><title><![CDATA[周志华 《机器学习》 习题3 （Matlab实现）]]></title><link>https://blog.youkuaiyun.com/PiscesCrab/article/details/79050144</link><guid>https://blog.youkuaiyun.com/PiscesCrab/article/details/79050144</guid><author>PiscesCrab</author><pubDate>Sat, 13 Jan 2018 11:18:18 +0800</pubDate><description><![CDATA[习题3.3 与 习题 3.5 编程实现对率回归、线性判别分析
原始数据：


其中‘+’表示好瓜，‘o'表示坏瓜


对率回归即线性判别分析原理见书。
以下为代码及结果，Matlab实现：
1、对率回归（逻辑斯蒂回归）
clear all; clc;

x = importdata('ex4x.txt');
y = importdata('ex4y.txt');

[m,n] ]]></description><category></category></item></channel></rss>