<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Falcont的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Falcont</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Falcont]]></copyright><item><title><![CDATA[Conformal Prediction]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/140079604</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/140079604</guid><author>Falcont</author><pubDate>Sun, 30 Jun 2024 13:13:01 +0800</pubDate><description><![CDATA[Conformal Prediction]]></description><category></category></item><item><title><![CDATA[Conformal Prediction]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/136914496</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/136914496</guid><author>Falcont</author><pubDate>Thu, 21 Mar 2024 17:15:59 +0800</pubDate><description><![CDATA[Given the calibration data set {(Xi,Yi∗)}i=1n{\left \{\left ( X_i, {Y}_{i}^{*}\right ) \right \}}_{i=1}^{n}{(Xi​,Yi∗​)}i=1n​ and pretrained model f^(⋅)\hat{f}\left ( \cdot\right )f^​(⋅) (f^(Xi)∈[0,1](K)\hat{f}\left ( X_i\right ) \in {\left [ 0, 1\right ]}^]]></description><category></category></item><item><title><![CDATA[SPPNet(Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition)]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/128413246</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/128413246</guid><author>Falcont</author><pubDate>Thu, 22 Dec 2022 20:39:43 +0800</pubDate><description><![CDATA[SPPNet核心]]></description><category></category></item><item><title><![CDATA[R-CNN（Rich feature hierarchies for accurate object detection and semantic segmentation）]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/127395147</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/127395147</guid><author>Falcont</author><pubDate>Tue, 18 Oct 2022 20:09:36 +0800</pubDate><description><![CDATA[R-CNN核心]]></description><category></category></item><item><title><![CDATA[Pytorch实现深度可分类卷积]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125061097</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125061097</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 11:13:41 +0800</pubDate><description><![CDATA[import torch
import torch.nn as nn
from torchsummary import summary
import time

device = torch.device('cuda')

class Common_Convolution(nn.Module):
    def __init__(self, in_chs, out_chs):
        super(Common_Convolution, self).__init__()
        self.co]]></description><category></category></item><item><title><![CDATA[Pytorch实现分组卷积]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125060525</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125060525</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 10:47:48 +0800</pubDate><description><![CDATA[import torch
import torch.nn as nn
from torchsummary import summary
import time

device = torch.device('cuda')

class Group_Conv(nn.Module):
    def __init__(self, in_chs, out_chs, num_groups):
        super(Group_Conv, self).__init__()
        self.conv =]]></description><category></category></item><item><title><![CDATA[PyTorch实现SENet（注意力机制）]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125060490</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125060490</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 10:46:33 +0800</pubDate><description><![CDATA[import torch.nn as nn

class SENet(nn.Module):
    '''
    input:(batch_size, chs, h, w)
    output:(batch_size, chs, h, w)
    '''
    def __init__(self, chs, reduction=4):
        super(SENet, self).__init__()
        self.average_pooling = nn.AdaptiveAv]]></description><category></category></item><item><title><![CDATA[Pytorch实现ChannelPooling（通道池化）]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125060448</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125060448</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 10:44:42 +0800</pubDate><description><![CDATA[import torch
import torch.nn as nn

class Channel_Max_Pooling(nn.Module):
    def __init__(self, kernel_size, stride):
        super(Channel_Max_Pooling, self).__init__()
        self.max_pooling = nn.MaxPool2d(
            kernel_size=kernel_size,
       ]]></description><category></category></item><item><title><![CDATA[Pytorch实现ChannelShuffle(通道混洗)]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125060407</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125060407</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 10:43:29 +0800</pubDate><description><![CDATA[import torch
import torch.nn as nn

class Channel_Shuffle(nn.Module):
    def __init__(self, num_groups):
        super(Channel_Shuffle, self).__init__()
        self.num_groups = num_groups
    def forward(self, x: torch.FloatTensor):
        batch_size, ]]></description><category></category></item><item><title><![CDATA[PyTorch实现GhostNet]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/125060226</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/125060226</guid><author>Falcont</author><pubDate>Tue, 31 May 2022 10:41:42 +0800</pubDate><description><![CDATA[注释等在代码中直接给出，模块结构都已给出，可分块进行搭建。
import包
import torch
import torch.nn as nn
import math
import torch.nn.functional as F
from torchsummary import summary

使用GPU
device = torch.device('cuda')

输出通道满足倍数关系
def Make_Divisible(v, divisor, min_value=None):
    '''
 ]]></description><category></category></item><item><title><![CDATA[Huffuman树]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/123392524</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/123392524</guid><author>Falcont</author><pubDate>Thu, 10 Mar 2022 09:09:23 +0800</pubDate><description><![CDATA[问题描述
Huffman树在编码中有着广泛的应用。在这里，我们只关心Huffman树的构造过程。
给出一列数{pi}={p0, p1, …, pn-1}，用这列数构造Huffman树的过程如下：
找到{pi}中最小的两个数，设为pa和pb，将pa和pb从{pi}中删除掉，然后将它们的和加入到{pi}中。这个过程的费用记为pa + pb。
重复步骤1，直到{pi}中只剩下一个数。
在上面的操作过程中，把所有的费用相加，就得到了构造Huffman树的总费用。
本题任务：对于给定的一个数列，现在请你求出用该数列构]]></description><category></category></item><item><title><![CDATA[Python杨辉三角形]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/123370762</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/123370762</guid><author>Falcont</author><pubDate>Wed, 09 Mar 2022 10:27:22 +0800</pubDate><description><![CDATA[问题一描述
杨辉三角形又称Pascal三角形，它的第i+1行是(a+b)i的展开式的系数。
它的一个重要性质是：三角形中的每个数字等于它两肩上的数字相加。　　
下面给出了杨辉三角形的前4行：
　　
1　　
1 1　　
1 2 1
1 3 3 1　　
给出n，输出它的前n行。
输入格式
输入包含一个数n。
输出格式
输出杨辉三角形的前n行。每一行从这一行的第一个数开始依次输出，中间使用一个空格分隔。请不要在前面输出多余的空格。
样例输入
4
样例输出
1
1 1
1 2 1
1 3 3 1
方法一
n = i]]></description><category></category></item><item><title><![CDATA[斐波那契（Fibonacci）数列]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/123187100</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/123187100</guid><author>Falcont</author><pubDate>Mon, 28 Feb 2022 17:23:27 +0800</pubDate><description><![CDATA[基本定义
斐波那契数列，又称黄金分割数列，指的是这样一个数列：0、1、1、2、3、5、8、13、21、34、……在数学上，斐波纳契数列以递归的方法定义：F(0)=0，F(1)=1，F(n)=F(n-1)+F(n-2)(n≥2，n∈N*)
Python代码实现
蓝桥杯某届某题目：
资源限制:
要求时间限制在1.0s内，内存限制在256.0MB内。
问题描述:
Fibonacci数列的递推公式为：Fn=Fn-1+Fn-2，其中F1=F2=1。
当n比较大时，Fn也非常大，现在我们想知道，Fn除以10007的余数]]></description><category></category></item><item><title><![CDATA[MINIST数据集读取]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/122618279</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/122618279</guid><author>Falcont</author><pubDate>Fri, 21 Jan 2022 11:51:11 +0800</pubDate><description><![CDATA[本文将直接以代码形式展示，句释已给出：
import os
import struct
import numpy as np
import matplotlib.pyplot as plt

data_path = r'D:\Data\minist/'

def Minst_Load(path, kind='train'):
    """Load MNIST data from `path`"""

    images_path = os.path.join(path, '{}-images.idx3-]]></description><category></category></item><item><title><![CDATA[pyplot基础]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/120379213</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/120379213</guid><author>Falcont</author><pubDate>Sun, 19 Sep 2021 12:31:51 +0800</pubDate><description><![CDATA[import matplotlib.pyplot as plt
import numpy as np

plt.plot([1, 2, 3, 4])
plt.ylabel('some numbers')
plt.show()

得到的图像Y轴为范围为1~4
X轴范围为0~3
只为plot命令提供一个array或者list时，matplotlib就会假设这个序列是Y轴上取值，并会自动生成X轴上的值。
由于python中范围是从0开始的，因此X轴从0开始，且长度与Y轴相同，也就是[0, 1, 2, 3]
plt]]></description><category></category></item><item><title><![CDATA[TensorFlow入门]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/119593968</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/119593968</guid><author>Falcont</author><pubDate>Wed, 11 Aug 2021 09:21:41 +0800</pubDate><description><![CDATA[TensorFlow入门（二）
一、预备知识
1、tf.where(condition=seq, x=A, y=B, name=None)函数实现了选择的功能。该函数有3个参数，第一个为选择条件根据，是一个bool型的张量。当张量某一位置为True时，函数会返回第二个参数中相同位置的处的值，否则会返回第三个参数中相同位置处的值，最终返回与seq维度相同的张量。
2、tf.greater(a, b)函数的输入是两个维度相同的张量，此函数会比较第一个输入张量和第二个输入张量中相同位置处每一个元素的大小，如果在该]]></description><category></category></item><item><title><![CDATA[TensorFlow入门]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/119593501</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/119593501</guid><author>Falcont</author><pubDate>Wed, 11 Aug 2021 09:07:42 +0800</pubDate><description><![CDATA[TensorFlow入门
一、步骤：
①准备数据：采集大量“特征/标签”数据
②搭建网络：搭建神经网络结构
③优化参数：训练网络获取最佳参数（反传）
④应用网络：将网络保存为模型，输入新数据，输出分类或预测结果（前传）
二、鸢尾花分类
1、采集大量数据对（花萼长、花萼宽、花瓣长、花瓣宽，对应的类别）构成数据集。                        输入特征                标签
把数据集喂入搭建好的神经网络结构，网络优化参数得到模型，模型读入新输入特征，输出识别结果。
2、输入层四个]]></description><category></category></item><item><title><![CDATA[Python构造函数的继承]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/115718738</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/115718738</guid><author>Falcont</author><pubDate>Thu, 15 Apr 2021 11:17:10 +0800</pubDate><description><![CDATA[在继承中，子类会自动获得一份父类的所有属性和方法，同时还可以定义自己的属性和方法。
对于构造函数的定义会有以下几种情况：
1、父类有构造函数，子类没有
class Base:
    def __init__(self, name, age):
        self.m_Name = name
        self.m_Age = 10
        self.m_Address = 'China'
        pass
    def PrintName(self):
        pri]]></description><category></category></item><item><title><![CDATA[51单片机实例]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/115697534</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/115697534</guid><author>Falcont</author><pubDate>Wed, 14 Apr 2021 14:32:47 +0800</pubDate><description><![CDATA[1、流水灯

#include &lt;reg51.h&gt;
void main()
{
  int i,j;
  while(1)
  {
    for(i=0;i&lt;8;i++)
    {
      P2=~(0x01&lt;&lt;i);
      for(j=1;j&lt;10000;j++);
    }
  }
}

2、晶振

静态显示X
#include&lt;reg51.h&gt;
unsigned char array1[]={0x81,0x42,0x24,0x18,0x1]]></description><category></category></item><item><title><![CDATA[Python类中属性和方法区分]]></title><link>https://blog.youkuaiyun.com/Falcont/article/details/115696093</link><guid>https://blog.youkuaiyun.com/Falcont/article/details/115696093</guid><author>Falcont</author><pubDate>Wed, 14 Apr 2021 13:18:22 +0800</pubDate><description><![CDATA[属性

类属性：类对象所送有的属性，定义在类内，方法外，他被所有类对象的实例对象所共有，类对象和实例对象都可以访问
实例属性：构造函数内定义，实例对象多拥有的属性，不能直接通过类名来访问，只能通过实例化对象来访问

class Student:
    m_Name = '张韶涵'  # 类属性，所有对象所共有
    def __init__(self, age):
        self.m_Age = age  #实例属性
        pass
    def __str__(self):
  ]]></description><category></category></item></channel></rss>