pydata

Keep Looking, Don't Settle

How to keep alive ssh sessions

1. On AWS to connect with ServerAliveInterval=100

ssh -i ~/.ssh/xxxx.pem ubuntu@hithere.amazonaws.com -o ServerAliveInterval=100

2. General Setup

Many NAT firewalls time out idle sessions after a certain period of time to keep their trunks clean. Sometimes the interval between session drops is 24 hours ...

2019-02-23 Week 8

Shares From Internet

  1. Handling Categorical Data in Python
    • Categorical features may have a very large number of levels, known as high cardinality, (for example, cities or URLs), where most of the levels appear in a relatively small number of instances.
    • Many machine learning models, such as regression or SVM or ...

2019-02-09 Week 6

Shares From Internet

  1. 如何配置一台适用于深度学习的工作站?
  2. 配置深度学习主机与环境(TensorFlow+1080Ti):(四)基于Anaconda的TensorFlow安装
  3. 不踩坑:Ubuntu下安装TensorFlow的最简单方法(无需手动安装CUDA和cuDNN 远程运行Jupyter Notebook
  4. DQN实战篇1 从零开始安装Ubuntu, Cuda, Cudnn, Tensorflow, OpenAI Gym
  5. 服务器配置多版本CUDA、CUdnn(不同Linux账户使用不同CUDA、CUdnn版本)
  6. Ubuntu16.04+Ananconda3+CUDA+CUDNN+Tensorflow-gpu配置教程
  7. Build TensorFlow-GPU with CUDA 9.1 MKL and Anaconda Python 3.6 using a Docker Container
  8. 到底什么是生成式对抗网络GAN?
# Dockerfile to ...

leetcode 312. Burst Balloons

题目大意 给定n个气球,每个气球有一个数字,用数组nums来表示n个气球上面的数字。如果气球i被打破,那么你会得到nums[left] * nums[i] * nums[right].这里left和right分别为气球i的左右两边的气球。打破所有的气球后把所有的数字相加,求解怎么打破这些气球使得最后得到的数字最大。

leetcode 321. Create Maximum Number

题目大意 给定长度为m和n的两个数组,数组里面数字为0到9.要求从这两个数组里面去k个数字构成的数字的最大值。k<=m+n。题目要求新的数字的顺序跟原来数组的数字顺序保持一致。