2 2Young2Simple

尚未进行身份认证

暂无相关简介

等级
TA的排名 5w+

pip 恢复默认源

进入pip配置文件夹cd ~/.config/pip打开pip.conf将里面的内容删掉或者用#注释掉

2019-12-26 16:48:41

Paper概括:On the use of Deep Learning for Image Quality Assessment

Paper概括:On the use of Deep Learning for Image Quality Assessment1. Introduction:​ 介绍了数码图像可能因光照,噪点,镜头等原因产生图片质量低下的情况。图片质量预测算法就是为了能够帮助在图片获取过程中提高图片质量。图片的质量通常以人类对其评分的平均值为准。近年来的图片质量算法通常分为full-reference, ...

2019-06-23 13:55:06

ubuntu统计某文件夹下文件的个数

统计某文件夹下文件的个数ls -l |grep “^-”|wc -l统计某文件夹下目录的个数ls -l |grep “^d”|wc -l统计文件夹下文件的个数,包括子文件夹里的ls -lR|grep “^-”|wc -l如统计/home/han目录(包含子目录)下的所有js文件则:ls -lR /home/han|grep js|wc -l 或 ls -l “/home/han”|g...

2019-05-09 11:52:47

配置tmux鼠标操作

在Terminal输入vi ~/.tmux.conf创建一个配置文件, 并在文件中输入set -g mouse on并保存.随后在Terminal中输入tmux进入tmux模式, 进入后按Ctrl+b+:, 此时tmux底部会变颜色. 在此输入source ~/.tmux.conf并回车即可....

2019-05-09 01:04:52

Ubuntu下查看CUDA和CUDNN版本的方法

cuda版本cat/usr/local/cuda/version.txtcudnn版本cat/usr/local/cuda/include/cudnn.h|grepCUDNN_MAJOR-A2这个结果就表示我的CUDA版本为8.0.44,cuDNN版本为5.1.10

2019-05-09 00:50:25

Ubuntu sudo 安装报错 (Could not get lock /var/lib/dpkg/lock-frontend)

Could not get lock /var/lib/dpkg/lock-frontend – open (11: Resource temporarily unavailable)E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend)这是我在用sudo apt-get upgrade时显示的报错, ...

2019-05-09 00:27:06

新手的Pytorch入门笔记(一)

新手的Pytorch入门笔记(一)pytorch的安装因为工作原因,最近开始学习PyTorch,为了方便自己日后查阅,在次记录一下自己学习的一些心得以及学习中遇到的一些坑,愿与诸位共勉。pytorch的安装安装过程十分简单,直接上pytorch的官网:https://pytorch.org/根据自己的系统选择对应的版本复制命令行。这里不建议使用conda,因为我在用conda安装pyto...

2019-04-28 21:11:27

ubuntu下更改默认python版本

输入vi ~/.bashrc如果要将默认改为python2在底下添加alias python='/usr/bin/python2'要改为python3就加alias python='/usr/bin/python3'修改完成之后输入. ~/.bashrc就可以了...

2018-10-23 00:15:57

Lintcode 54. String to Integer (atoi) (Medium) (Python).md

String to Integer (atoi)Description:Implement function atoi to convert a string to an integer.If no valid conversion could be performed, a zero value is returned.If the correct value is out of the...

2018-09-30 19:21:29

Lintcode 134. LRU Cache (Medium) (Python)

LRU CacheDescription:Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be posi...

2018-09-30 18:39:38

Lintcode 131. The Skyline Problem (Super Hard) (Python) (未完成)

The Skyline ProblemDescription:Given N buildings in a x-axis,each building is a rectangle and can be represented by a triple (start, end, height),where start is the start position on x-axis, end is ...

2018-09-30 17:57:18

Lintcode 86. Binary Search Tree Iterator (Hard) (Python)

Binary Search Tree IteratorDescription:Design an iterator over a binary search tree with the following rules:Elements are visited in ascending order (i.e. an in-order traversal)next() and hasNext(...

2018-09-30 13:59:52

Lintcode 65. Median of two Sorted Arrays (Hard) (Python)

Median of two Sorted ArraysDescription:There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays.ExampleGiven A=[1,2,3,4,5,6] and B=[2,3,4,5], the ...

2018-09-30 12:45:11

Lintcode 1076. Minimum ASCII Delete Sum for Two Strings (Python) (Medium)

Minimum ASCII Delete Sum for Two StringsDescription:Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.ExampleExample 1:Input: s1 = “sea”, s2 = “e...

2018-09-30 11:16:30

Windows系统下显卡挖零币(ZEC)的方法

注册地址:https://gateio.io/signup/2237911

2018-09-20 03:49:51

Lintcode 545. Top k Largest Numbers II (Medium) (Python)

Top k Largest Numbers IIDescription:Implement a data structure, provide two interfaces:add(number). Add a new number in the data structure. topk(). Return the top k largest numbers in this data...

2018-09-14 06:33:40

Lintcode 159. Find Minimum in Rotated Sorted Array (Medium) (Python)

Find Minimum in Rotated Sorted ArrayDescription:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum elem...

2018-09-14 05:21:07

Lintcode 544. Top k Largest Numbers (Medium) (Python)

Top k Largest NumbersDescription:Given an integer array, find the top k largest numbers in it.Example Given [3,10,1000,-99,4,100] and k = 3. Return [1000, 100, 10].Code:class Solution:...

2018-09-14 03:44:27

Lintcode 383. Container With Most Water (Medium) (Python)

Container With Most WaterDescription:Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of lin...

2018-09-14 02:57:56

Lintcode 886. Convex Polygon (Medium) (Python)

Convex PolygonDescription:Given a list of points that form a polygon when joined sequentially, find if this polygon is convex (Convex polygon definition).Example Given points = [[0, 0], [0, 1],...

2018-09-13 13:55:53

查看更多

勋章 我的勋章
  • GitHub
    GitHub
    绑定GitHub第三方账户获取
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!
  • 勤写标兵Lv1
    勤写标兵Lv1
    授予每个自然周发布1篇到3篇原创IT博文的用户。本勋章将于次周周三上午根据用户上周的博文发布情况由系统自动颁发。