<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[s37]]></title><description><![CDATA[s37]]></description><link>https://blog.youkuaiyun.com/papaaa</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; papaaa]]></copyright><item><title><![CDATA[linux - awk 和kill 批量杀死进程]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/87954617</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/87954617</guid><author>papaaa</author><pubDate>Tue, 26 Feb 2019 22:52:00 +0800</pubDate><description><![CDATA[ps -ef|grep check_os.sh | grep -v grep | awk ‘{print $2}’ | xargs kill -9
$2表示第2列,即进程号PID;
grep -v grep是列出除开grep命令本身的进程,grep iboss2确认进程关键字
kill -9 强杀进程;
xargs 使用上一个操作的结果作为下一个命令的参数使用
awk：
awk是一个强大的文本分析...]]></description><category></category></item><item><title><![CDATA[Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82990422</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82990422</guid><author>papaaa</author><pubDate>Tue, 09 Oct 2018 23:04:59 +0800</pubDate><description><![CDATA[
Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (i.e., buy one ...]]></description><category></category></item><item><title><![CDATA[linux防火墙]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82835413</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82835413</guid><author>papaaa</author><pubDate>Tue, 25 Sep 2018 10:21:01 +0800</pubDate><description><![CDATA[linux防火墙iptables使用iptables进行包过滤表链SELinuxlinux系统中查看己设置iptables规则通过iptables 过滤IP段欢迎使用Markdown编辑器新的改变功能快捷键合理的创建标题，有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一...]]></description><category></category></item><item><title><![CDATA[MySQL命令行学习]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82661701</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82661701</guid><author>papaaa</author><pubDate>Wed, 12 Sep 2018 15:00:20 +0800</pubDate><description><![CDATA[MySQL命令行学习

1、登录mysql

本地：mysql -u root -p, 回车后输入密码; 也可以p后不加空格，直接加密码。回车就登录了

远程：mysql -hxx.xx.xx.xx -u -pxxx

2、查看数据库：show databases;

3、连接数据库：use db_name;

4、查看数据表：show tables;

5、查询：select * from ta...]]></description><category></category></item><item><title><![CDATA[gradle]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82224368</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82224368</guid><author>papaaa</author><pubDate>Thu, 30 Aug 2018 16:58:09 +0800</pubDate><description><![CDATA[./gradlew distTar

./gradlew  clean

./gradlew debugRun

./gradlew assembleDist]]></description><category></category></item><item><title><![CDATA[Robust Network Traffic Classification]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82223593</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82223593</guid><author>papaaa</author><pubDate>Thu, 30 Aug 2018 16:26:05 +0800</pubDate><description><![CDATA[摘要


提出RTC（Robust statistical Traffic Classficiation）模型解决zero-day应用问题。
提出用于RTC模型参数自动优化的方法。




Introduction


三种主流流量分类问题的解决方案




    基于端口（port-based）
    - 依赖于检测标准端口，
    - 缺点：不使用标准端口和端口混淆

    基于pay...]]></description><category></category></item><item><title><![CDATA[ubuntu redis服务]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82184176</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82184176</guid><author>papaaa</author><pubDate>Wed, 29 Aug 2018 15:37:26 +0800</pubDate><description><![CDATA[
下载Redis
配置Redis




sudo vim /etc/redis/redis.conf

修改bind行，将127.0.0.1修改为*,配置远程可以访问


- ubuntu启动Redis服务

service redis-server start

service redis-server status


以命令行方式进入Redis，分别为本地进入方式与远程进入方式：


re...]]></description><category></category></item><item><title><![CDATA[tmux 常用命令]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/82183380</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/82183380</guid><author>papaaa</author><pubDate>Wed, 29 Aug 2018 15:01:33 +0800</pubDate><description><![CDATA[tmux new -s 会话名  //新起一个会话

tmux ls //查看现有的会话

tmux a //进入最近的会话

tmux a -t  会话名//进入指定会话

tumx kill-session -t 会话名 //干掉指定会话

control+b //唤起tmux(命令前缀)

c  //创建新窗口

w //查看所有窗口

&quot; //横分面板

% //竖分面板

, //修改窗...]]></description><category></category></item><item><title><![CDATA[Spark相对于MapReduce的优势对比]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81738300</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81738300</guid><author>papaaa</author><pubDate>Thu, 16 Aug 2018 11:20:35 +0800</pubDate><description><![CDATA[Spark相对于MapReduce的优势


MapReduce存在的问题




1. MapReduce框架局限性


　　1）仅支持Map和Reduce两种操作
　　2）处理效率低效。

　　　　a）Map中间结果写磁盘，Reduce写HDFS，多个MR之间通过HDFS交换数据; 任务调度和启动开销大; 
　　　　b）无法充分利用内存 
　　　　c）Map端和Reduce端均需要排序
　　3...]]></description><category></category></item><item><title><![CDATA[hadoop集群spark配置，jupyter notebook，ubuntu]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81676201</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81676201</guid><author>papaaa</author><pubDate>Tue, 14 Aug 2018 22:52:15 +0800</pubDate><description><![CDATA[
下载安装jupyter notebook，并配置，详见另一篇博客，jupyter notebook配置
安装python包 findspark、pyspark。
用findspark.init函数配置集群中spark-client2路径，python路径。


import findspark

findspark.init(spark_home=&quot;/usr/hdp/current/spark2...]]></description><category></category></item><item><title><![CDATA[hadoop单机部署,用来测试]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81585953</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81585953</guid><author>papaaa</author><pubDate>Sat, 11 Aug 2018 13:35:49 +0800</pubDate><description><![CDATA[转载自ee900222的博客

2. Hadoop安装


2.1 安装java

Hadoop是使用JAVA写的，所以需要先安装JAVA环境。

本次安装的是hadoop-2.7.0，需要JDK 7以上版本。




 yum install java-1.7.0-openjdk
 yum install java-1.7.0-openjdk-devel

安装后确认



java –vers...]]></description><category></category></item><item><title><![CDATA[第一个wordcount程序]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81564582</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81564582</guid><author>papaaa</author><pubDate>Fri, 10 Aug 2018 15:44:34 +0800</pubDate><description><![CDATA[
在hadoop集群中，系统自带了许多mapreduce的程序例子，在{%HOME%}/hadoop-mapreduce/hadoop-mapreduce-examples.jar里面有许多小例子，可以在hadoop集群中直接运行命令.
当然运行前需要在HDFS上创建input目录和output目录，
input目录需要一个输入文件，比如/s_tmp/input/tmp.txt
接下来需要创建ou...]]></description><category></category></item><item><title><![CDATA[大数据学习路线推荐]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81327875</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81327875</guid><author>papaaa</author><pubDate>Wed, 01 Aug 2018 11:35:25 +0800</pubDate><description><![CDATA[转自：https://www.cnblogs.com/zlslch/p/5448857.html

1 Java基础：

视频方面：
      推荐《毕向东JAVA基础视频教程》。学习hadoop不需要过度的深入，java学习到javase，在Java虚拟机的内存管理、以及多线程、线程池、设计模式、并行化多多理解实践即可。

书籍方面：

      推荐李兴华的《java开发实战经典》



...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81321519</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81321519</guid><author>papaaa</author><pubDate>Tue, 31 Jul 2018 22:00:10 +0800</pubDate><description><![CDATA[编程语言：JAVA

题目描述：



Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a ...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81320549</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81320549</guid><author>papaaa</author><pubDate>Tue, 31 Jul 2018 20:56:47 +0800</pubDate><description><![CDATA[编程语言：JAVA



题目描述：

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1
   / \
  2   2
 /...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Same Tree]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81293063</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81293063</guid><author>papaaa</author><pubDate>Mon, 30 Jul 2018 22:03:54 +0800</pubDate><description><![CDATA[编程语言：JAVA

题目描述：



Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the s...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Merge Sorted Array]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81291565</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81291565</guid><author>papaaa</author><pubDate>Mon, 30 Jul 2018 20:27:56 +0800</pubDate><description><![CDATA[编程语言：JAVA



题目描述：

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively....]]></description><category></category></item><item><title><![CDATA[leetcode题记:Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81282362</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81282362</guid><author>papaaa</author><pubDate>Mon, 30 Jul 2018 11:37:29 +0800</pubDate><description><![CDATA[编程语言：JAVA 
题目描述：




You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Sqrt(x)]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81276040</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81276040</guid><author>papaaa</author><pubDate>Sun, 29 Jul 2018 21:45:29 +0800</pubDate><description><![CDATA[编程语言：JAVA

题目描述：

Implement int sqrt(int x).

Compute and return the square root of x, where x is guaranteed to be a non-negative integer.

Since the return type is an integer, the decimal digits are ...]]></description><category></category></item><item><title><![CDATA[leetcode题记:Add Binary]]></title><link>https://blog.youkuaiyun.com/papaaa/article/details/81175747</link><guid>https://blog.youkuaiyun.com/papaaa/article/details/81175747</guid><author>papaaa</author><pubDate>Mon, 23 Jul 2018 22:06:30 +0800</pubDate><description><![CDATA[编程语言：JAVA



题目描述：

Given two binary strings, return their sum (also a binary string).

The input strings are both non-empty and contains only characters 1 or 0.

Example 1:

Input: a = &amp;amp;quot;11&amp;amp;quot;, b = &amp;amp;quot;1&amp;amp;quot;
...]]></description><category></category></item></channel></rss>