<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[bcy1252的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/bcy1252</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; bcy1252]]></copyright><item><title><![CDATA[2021-03-01  通过ssh协议在服务器运行jupyter notebook]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/114265896</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/114265896</guid><author>bcy1252</author><pubDate>Mon, 01 Mar 2021 16:40:55 +0800</pubDate><description><![CDATA[8888为jupyter notebook的默认端口，通过ssh，将服务器8888内容转发到本地8000端口，再登录就能用了
ssh -L 8000:localhost:8888 sammy@your_server_ip
source ~/environments/my_env/bin/activate
http://localhost:8000
会输入token，直接复制命令行的即可

...]]></description><category></category></item><item><title><![CDATA[mmdetection focalloss使用]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/113866861</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/113866861</guid><author>bcy1252</author><pubDate>Fri, 19 Feb 2021 16:26:37 +0800</pubDate><description><![CDATA[重点：label： B H W C (C是类别) B*H*W C

input 要改为 B H W C,然后B*H*W,C两维

sigmoid focalloss 不包含背景类，cls_num通道数减一

softmax focalloss 包含背景类


    def loss(self,
             label_cls,
             cls_prob):
        num_imgs = cls_prob.size(0)
        num_pos = torch]]></description><category></category></item><item><title><![CDATA[ubuntu18.04企业微信乱码]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/113760632</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/113760632</guid><author>bcy1252</author><pubDate>Mon, 08 Feb 2021 18:03:02 +0800</pubDate><description><![CDATA[安装这三个字体，每次装完系统，解决qq，企业微信等中文乱码
sudo apt-get install ttf-wqy-microhei
sudo apt-get install ttf-wqy-zenhei
sudo apt-get install xfonts-wqy

]]></description><category></category></item><item><title><![CDATA[非root权限服务器安装cuda]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/112478923</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/112478923</guid><author>bcy1252</author><pubDate>Mon, 11 Jan 2021 17:21:50 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/li-minghao/p/13089405.html
]]></description><category></category></item><item><title><![CDATA[判断点在三角形（多边形）内部 python]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/111975777</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/111975777</guid><author>bcy1252</author><pubDate>Wed, 30 Dec 2020 13:26:44 +0800</pubDate><description><![CDATA[from shapely import geometry
import matplotlib.pyplot as plt

pts = [(0, 0), (1, 1), (0, 1), (0, 0)]
polygon = geometry.Polygon(pts)

pt = 0.1, 0.2
point = geometry.Point(*pt)

plt.figure(0)
plt.plot([i[0] for i in pts], [i[1] for i in pts])
plt.scatter(*p]]></description><category></category></item><item><title><![CDATA[python 文件夹复制]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/108956785</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/108956785</guid><author>bcy1252</author><pubDate>Wed, 07 Oct 2020 22:27:59 +0800</pubDate><description><![CDATA[小工具，文件夹内容过大，只选取前N张图片。
import os
from shutil import copy
i = 0
save_dir = 'E:/test'
if not os.path.isdir(save_dir):
    os.mkdir(save_dir)
file_path = 'E:\dataset\VOC07+12\JPEGImages'
img_name = os.listdir(file_path)
img_name.sort()
for img in img_name:
   ]]></description><category></category></item><item><title><![CDATA[暂存（）]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/106769418</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/106769418</guid><author>bcy1252</author><pubDate>Mon, 15 Jun 2020 19:14:05 +0800</pubDate><description><![CDATA[1051
class Solution {
    public int heightChecker(int[] heights) {
        int [] heightsSave = new int[100];
        int temp = 0;
        int count = 0;
        for(int i = 0; i &lt; heights.length; i++){
            heightsSave[i] = heights[i];
       ]]></description><category></category></item><item><title><![CDATA[输出每个数组每个数的重复次数（java）]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/106244213</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/106244213</guid><author>bcy1252</author><pubDate>Sat, 23 May 2020 00:59:56 +0800</pubDate><description><![CDATA[class Solution {
    public int[] topKFrequent(int[] nums, int k) {
        int n = nums.length;
        int[] repeatNums = new int[n];// 每个值重复的次数
        for(int i = 0;i &lt; n; i++){
            repeatNums[i] = 1;
        }
        //执行下段语句后，repeatNums[i]]></description><category></category></item><item><title><![CDATA[图论_最短路径_Dijistra算法_Leetcode743题]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/106036930</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/106036930</guid><author>bcy1252</author><pubDate>Sun, 10 May 2020 15:34:10 +0800</pubDate><description><![CDATA[package first;
import java.util.Arrays;

 

public class Hello_world {
		public static void main(String[] args) {
			Hello_world Dijkstra = new Hello_world();
			int[][] times = {{2, 1, 1}, {2, 3, 1},{3, 4, 1}};
			System.out.println(Dijkstra.networkDelayT]]></description><category></category></item><item><title><![CDATA[图论基础_BFS和DFS(JAVA)]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105800638</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105800638</guid><author>bcy1252</author><pubDate>Mon, 27 Apr 2020 21:51:50 +0800</pubDate><description><![CDATA[package datastructure;

import java.util.*;

public class ListGraph {

    ArrayList&lt;ArrayList&lt;Integer&gt;&gt; graphs;

    public static void main(String[] args) {
        ListGraph graph = new...]]></description><category></category></item><item><title><![CDATA[优先队列和堆（java实现）]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105755785</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105755785</guid><author>bcy1252</author><pubDate>Sat, 25 Apr 2020 20:18:44 +0800</pubDate><description><![CDATA[package datastructure;
//优先队列至少两种操作，插入，删除最小值；

public class PriorityQueue {
    static class Node {
        int value;
        //优先级，数值越大优先级越高
        int priority;
        Node next;

        public ...]]></description><category></category></item><item><title><![CDATA[树基础和二叉查找树的java实现]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105715094</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105715094</guid><author>bcy1252</author><pubDate>Thu, 23 Apr 2020 19:15:12 +0800</pubDate><description><![CDATA[package datastructure;

/*
 *  二叉树（Binary Tree）：每个节点最多含有两个子节点，上面图示中的树就是二叉树。
	完全二叉树（Complete Binary Tree）：假设一个二叉树深度（depth）为d（d &gt; 1），除了
								       第d层外，其它各层的节点数量均已达到最大值，且第d层
								       所有节点从左...]]></description><category></category></item><item><title><![CDATA[哈希表（hashmap）_分离链式法实现_java]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105707509</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105707509</guid><author>bcy1252</author><pubDate>Thu, 23 Apr 2020 14:45:29 +0800</pubDate><description><![CDATA[package datastructure;
import java.util.ArrayList;
/* 散列表以常数平均时间执行插入、删除和查找，不支持排序；
 * 理想散列表：具有固定大小的数组，为此尽量选择合理的哈希函数；
 * 散列表由&lt;key,value&gt;组成，通过哈希函数H(key)计算出哈希值（一般为数组下标）
 * 进行存储，查找；哈希函数：通常key为整数可以取摸，...]]></description><category></category></item><item><title><![CDATA[栈和队列链表和数组实现（java）]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105647996</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105647996</guid><author>bcy1252</author><pubDate>Mon, 20 Apr 2020 23:47:36 +0800</pubDate><description><![CDATA[1.1数组栈
package datastructure;

/*只有栈顶元素可以访问
 * Array（[]）：最高效；但是其容量固定且无法动态改变；只能存基础数据类型
   ArrayList：  容量可动态增长；但牺牲效率；存对象不可以存基础数据类型，有多种方法调用
              size(),add(),remove()*/

public class ArrayStack ...]]></description><category></category></item><item><title><![CDATA[java静态内部类实现单链表]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105624690</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105624690</guid><author>bcy1252</author><pubDate>Sun, 19 Apr 2020 23:05:44 +0800</pubDate><description><![CDATA[package datastructure;

public class LinkedList {
	//定义节点,内部类只为其外部类使用
	//要创建嵌套类的对象，并不需要其外围类的对象,直接用.next；
	static class ListNode{
		int val;
		ListNode next;//指针，指向下一个节点位置
		public ListNode(int val) {
...]]></description><category></category></item><item><title><![CDATA[链表实现下压堆栈（java）]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105587536</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105587536</guid><author>bcy1252</author><pubDate>Fri, 17 Apr 2020 20:05:28 +0800</pubDate><description><![CDATA[package algorithm;

import java.util.Iterator;

import edu.princeton.cs.algs4.StdIn;

public class Stack &lt;Item&gt; implements Iterable&lt;Item&gt;{
	private Node first; //栈顶（最近添加的元素）
	private int N...]]></description><category></category></item><item><title><![CDATA[VTK演示回调的作用和实例]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105545694</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105545694</guid><author>bcy1252</author><pubDate>Wed, 15 Apr 2020 22:02:58 +0800</pubDate><description><![CDATA[VTk通过数据流实现变信息为图形数据的。
数据流一般为：source—filter——mapper——actor——render——renderwindow——interactor。
#!/usr/bin/env python

"""
演示回调的使用。
"""

import vtk


def main():
    #  决定使用什么方法。
    use_function_callback...]]></description><category></category></item><item><title><![CDATA[java实现数组二分查找]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105522568</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105522568</guid><author>bcy1252</author><pubDate>Tue, 14 Apr 2020 22:11:25 +0800</pubDate><description><![CDATA[package algorithm;
import java.util.Arrays;

public class BinarySearch {
	public static int rank(int key,int[] a){
		//数组必须是有序
		int lo = 0;
		int hi = a.length - 1;
		while(lo &lt;= hi) {
			int i = ...]]></description><category></category></item><item><title><![CDATA[VTK用python实现基本rending和pipeline]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105508600</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105508600</guid><author>bcy1252</author><pubDate>Tue, 14 Apr 2020 11:43:10 +0800</pubDate><description><![CDATA[#!/usr/bin/env python

# 这个简单的例子展示了如何进行


import vtk


def main ():
    colors = vtk.vtkNamedColors()
    # 设置背景颜色
    bkg = map(lambda x: x / 255.0, [26, 51, 102, 255])
    # bkg要是一个可迭代的对象
    colors...]]></description><category></category></item><item><title><![CDATA[数据结构和算法基础知识]]></title><link>https://blog.youkuaiyun.com/bcy1252/article/details/105390090</link><guid>https://blog.youkuaiyun.com/bcy1252/article/details/105390090</guid><author>bcy1252</author><pubDate>Wed, 08 Apr 2020 16:11:53 +0800</pubDate><description><![CDATA[准备系统完整的学习数据结构和算法，开始的东西很基础+简单，但也写一下，以后要回顾直接看这一篇省事。
一.什么是数据结构
程序 = 数据结构+算法
数据结构：相互之间存在一种或多种特定关系的数据元素的集合。
数据对象：具有相同性质的数据元素的几何，是数据的一个子集。

二.数据结构整体概览

数据的逻辑结构：
集合：元素除同属一集合无其他关系。
线性结构：元素之间为一对一关系，除了第一个元素所有元素...]]></description><category></category></item></channel></rss>