<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[RiKler的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/RiKler</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; RiKler]]></copyright><item><title><![CDATA[CS231n 03 Introduction to Neural Networks]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/109591643</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/109591643</guid><author>RiKler</author><pubDate>Tue, 10 Nov 2020 09:03:19 +0800</pubDate><description><![CDATA[Introduction to Neural Networks

Computational graphs

BackPropagation - A method to compute the gradients of abitrarily complex function

A recursive application of Chain rule



We get the gradient backprop from the front and comupte with the local gradi]]></description><category></category></item><item><title><![CDATA[CS231n 02 Loss Functions and Optimization]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/109591630</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/109591630</guid><author>RiKler</author><pubDate>Tue, 10 Nov 2020 09:02:46 +0800</pubDate><description><![CDATA[Loss Functions and Optimization

Preview the Goal in this lecture

Define a loss function
Come up with a way of finding the paras that minimize the (1)
(optimization)

The Remain Problem from last lecture

How to choose the W para ?

[外链图片转存失败,源站可能有防盗链机制,建]]></description><category></category></item><item><title><![CDATA[CS231 Image Classification 01]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/109591589</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/109591589</guid><author>RiKler</author><pubDate>Tue, 10 Nov 2020 09:01:57 +0800</pubDate><description><![CDATA[Image Classification
This is my note to the course CS231n Stanford Convolutional Neural Network

Computer’ Work
Input an image, and assign one of the label amoung the given labels.

The Problem:


Semantic Gap
Viewpoint variation
illumination
Deformation
O]]></description><category></category></item><item><title><![CDATA[【ICS计算机系统】位运算Lab1]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/108957926</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/108957926</guid><author>RiKler</author><pubDate>Sat, 17 Oct 2020 12:18:19 +0800</pubDate><description><![CDATA[ICS-LAB1-Report

Bits.c
1. bitAnd–与
题目：
只用~和|实现&amp;

样例：
bitAnd(6, 5) = 4

可使用操作： ~ |
最大操作数限制： 8
使用操作数： 4
int bitAnd(int x, int y) {
  return ~(~x | ~y); //De Morgan's laws
}


应用摩根律 ~(x | y) = ~x &amp; ~y, 可得 x &amp; y = (x | ~y)


2. getByte–获取字节
题目：
从x]]></description><category></category></item><item><title><![CDATA[Data Structure Note WEEK 4]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/108982028</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/108982028</guid><author>RiKler</author><pubDate>Fri, 09 Oct 2020 16:58:04 +0800</pubDate><description><![CDATA[WEEK3-2020/10/8
Problem A - Working routine CodeForces-706E
Difficulty: 4 | Tag: Cross LinkList (十字链表)


Vasiliy finally got to work, where there is a huge amount of tasks waiting for him. Vasiliy is given a matrix consisting of n rows and m columns and q ]]></description><category></category></item><item><title><![CDATA[Data Structure Note WEEK 3]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/108981997</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/108981997</guid><author>RiKler</author><pubDate>Fri, 09 Oct 2020 16:57:16 +0800</pubDate><description><![CDATA[WEEK3-2020/9/29
Problem A - Broken Keyboard-UVa 11988
Difficuty: 2 | tag: deque/list


You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with
the keyboard is that sometimes the “home” key or the “end” key get]]></description><category></category></item><item><title><![CDATA[My Data Structure Study Note WEEK 2]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/108859762</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/108859762</guid><author>RiKler</author><pubDate>Mon, 28 Sep 2020 23:27:40 +0800</pubDate><description><![CDATA[WEEK2-2020/9/27
Problem A - ZOJ 1362 Game Prediction
Difficlty: 1 | Tag: Unknown


  Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at]]></description><category></category></item><item><title><![CDATA[【树莓派日记】简单的树莓派电子墨水信息屏]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/108366850</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/108366850</guid><author>RiKler</author><pubDate>Wed, 02 Sep 2020 18:05:15 +0800</pubDate><description><![CDATA[【树莓派日记】简单的树莓派电子墨水信息屏

目录

【树莓派日记】简单的树莓派电子墨水信息屏

一、前述

二、安装

三、测试

四、设计功能

五、代码

六、效果展示



一、前述

最近在淘宝上买了个电子墨水屏，装到树莓派上玩一玩，这篇博客是一个记录。

二、安装

买的是这款微雪的1.54寸的小电子墨水屏，SPI接口



对应接线



   

三、测试

开启SPI接口


sudo raspi-config
选择Interfacing Options -&gt; SPI -&g...]]></description><category></category></item><item><title><![CDATA[Python学习日记1---简单的Minecraft末地要塞坐标计算器]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/104063951</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/104063951</guid><author>RiKler</author><pubDate>Tue, 21 Jan 2020 20:05:07 +0800</pubDate><description><![CDATA[一、简述

   对于Minecraft玩家而言，寻找末地要塞无疑是一个较为痛苦的过程，末地要塞生成通常距离玩家出生点有一定的距离，因而一般来说需要消耗大量稀有的末影珍珠来用于指明方向，大大拖慢了玩家的通关速度，降低了游戏体验。其实通过末影珍珠指向末地的特性，加以简单的数学运算，可以利用1~3颗末影珍珠就相对准确的定位出末地坐标，从而降低成本。

二、原理概述

   本计算...]]></description><category></category></item><item><title><![CDATA[用带辅助表元的链表表示有序整数集合,求集合和、集合差、集合交]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/103601474</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/103601474</guid><author>RiKler</author><pubDate>Wed, 18 Dec 2019 17:25:20 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;malloc/_malloc.h&gt;
#define Elementype int

typedef struct Node{
    Elementype data;
    struct Node* next;
}Node,*Linklist;

void init_Linklist(Linklist *head...]]></description><category></category></item><item><title><![CDATA[C语言解法--压缩字符串]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/103408058</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/103408058</guid><author>RiKler</author><pubDate>Thu, 05 Dec 2019 16:49:18 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;

//#include &lt;string.h&gt;

int length(int n){

  int k=0;

  while(n){

    n/=10;

    k++;

  }

  return k;

}

void strpress(char * str){

  cha...]]></description><category></category></item><item><title><![CDATA[CentOS下测试tensorflow出错]]></title><link>https://blog.youkuaiyun.com/RiKler/article/details/81020687</link><guid>https://blog.youkuaiyun.com/RiKler/article/details/81020687</guid><author>RiKler</author><pubDate>Thu, 12 Jul 2018 18:44:46 +0800</pubDate><description><![CDATA[﻿﻿Traceback (most recent call last):  File &quot;/root/anaconda3/lib/python3.6/site-packages/tensorflow/python/pywrap_tensorflow.py&quot;, line 58, in &amp;lt;module&amp;gt;    from tensorflow.python.pywrap_tensorflow_...]]></description><category></category></item></channel></rss>