<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[juiceda的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/juiceda</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; juiceda]]></copyright><item><title><![CDATA[activity_manager_server]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/85078616</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/85078616</guid><author>juiceda</author><pubDate>Tue, 18 Dec 2018 20:53:03 +0800</pubDate><description><![CDATA[目录结构



 

mapp.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot; ?&amp;gt;
&amp;lt;maxml version=&quot;2.0&quot; xmlns=&quot;http://www.nj.fiberhome.com.cn/map&quot;
	xmlns:xsi=&quot;http://www.w3.org/2001/XMLSchema-instance&quot;
	xsi]]></description><category></category></item><item><title><![CDATA[activity_manager_client]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/85073175</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/85073175</guid><author>juiceda</author><pubDate>Tue, 18 Dec 2018 18:39:19 +0800</pubDate><description><![CDATA[目录结构



config.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;
&amp;lt;config scope=&quot;client&quot; clientversion=&quot;4&quot; devicetype=&quot;all&quot; theme=&quot;skin-cyan&quot;&amp;gt; 
  &amp;lt;appid&amp;gt;activit]]></description><category></category></item><item><title><![CDATA[ssm-jar包]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82655381</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82655381</guid><author>juiceda</author><pubDate>Wed, 12 Sep 2018 07:52:59 +0800</pubDate><description><![CDATA[用户管理-ssm框的jar包（chenyaping）

 

 ]]></description><category></category></item><item><title><![CDATA[uixml+H5 demo]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82624139</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82624139</guid><author>juiceda</author><pubDate>Tue, 11 Sep 2018 13:01:59 +0800</pubDate><description><![CDATA[config.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;
&amp;lt;config scope=&quot;client&quot; clientversion=&quot;4&quot; devicetype=&quot;all&quot; theme=&quot;skin-default&quot;&amp;gt; 
  &amp;lt;appid&amp;gt;dwtemplate&a]]></description><category></category></item><item><title><![CDATA[用户管理-前端开发H5-01]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82584790</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82584790</guid><author>juiceda</author><pubDate>Mon, 10 Sep 2018 09:15:28 +0800</pubDate><description><![CDATA[参考下

https://blog.youkuaiyun.com/qq_39150192?t=1 

根目录



 

page目录



js目录



page目录



config.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;
&amp;lt;config scope=&quot;client&quot; clientversion=&quot;4&quot; devicetype=&quot;al]]></description><category></category></item><item><title><![CDATA[Edata数据挖掘样例]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82564006</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82564006</guid><author>juiceda</author><pubDate>Sun, 09 Sep 2018 23:49:36 +0800</pubDate><description><![CDATA[专家诊病模型



 

信用评估模型



 

客户流失模型



 

时间序列



 

时间序列图检测



 

平稳时间序列建模



时间序列预测模型

 

 

市场细分



 

媒体细分

 

异常检测模型

 

 

购物篮分析



文本挖掘



 文本分类



数据准备

 

 

统计

...]]></description><category></category></item><item><title><![CDATA[大数据培训记录]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82563918</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82563918</guid><author>juiceda</author><pubDate>Sun, 09 Sep 2018 23:32:30 +0800</pubDate><description><![CDATA[1 . 在地市数据源上建立数据资源（连接） 权限

2. 时间区间节点（粒度）：数据汇总 填充 不是每天的数据都有

3. 序列缺失填充 ：线性

4. 类型节点；很关键，读取值，选择输入、目标

有周期性的：指数平滑算法
比较稳定的：ARIMA算法

新建原生sql 选择输出
启用缓存 
合并节点

和移动开发连接
1： 输出到数据库，-&amp;gt;数据库节点
2： 表输出发布到空间（两万以内，当前...]]></description><category></category></item><item><title><![CDATA[用户管理-ssm-02]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82563862</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82563862</guid><author>juiceda</author><pubDate>Sun, 09 Sep 2018 23:27:32 +0800</pubDate><description><![CDATA[/hz-ssm-cyp/WebContent/WEB-INF/jsp/user/list.jsp


&amp;lt;%@ page language=&quot;java&quot; contentType=&quot;text/html; charset=UTF-8&quot;
    pageEncoding=&quot;UTF-8&quot;%&amp;gt;
&amp;lt;!DOCTYPE html PUBLIC &quot;-//W3C//DTD HTML 4.01 Tran...]]></description><category></category></item><item><title><![CDATA[用户管理-ssm-01]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/82563348</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/82563348</guid><author>juiceda</author><pubDate>Sun, 09 Sep 2018 22:50:43 +0800</pubDate><description><![CDATA[ 项目的结构





 

 web.xml


&amp;lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&amp;gt;
&amp;lt;web-app xmlns:xsi=&quot;http://www.w3.org/2001/XMLSchema-instance&quot; xmlns=&quot;http://xmlns.jcp.org/xml/ns/javaee&quot; xsi:schemaLocation=&quot]]></description><category></category></item><item><title><![CDATA[合并有序链表]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7989220</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7989220</guid><author>juiceda</author><pubDate>Mon, 17 Sep 2012 20:26:45 +0800</pubDate><description><![CDATA[struct node
{
    int v;
    node* next;
};


node* union_list(node* h1, node* h2)
{
    if(!h1) return h2;
    if(!h2) return h1;
    node* cur = new node;
    node* t1 = h1, *t2 = h2;
    while(h1&&]]></description><category></category></item><item><title><![CDATA[约瑟夫环（2012阿里笔试）]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7984460</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7984460</guid><author>juiceda</author><pubDate>Sun, 16 Sep 2012 14:31:15 +0800</pubDate><description><![CDATA[N 个数围城一个圈，编号从 1 - N； 给定步长m, 第一个数开始报1，数到 m的数被删除，下个数又从1开始报数，如此循环，直到剩下最后一个数。问最后一个数的编号是？


方法1： 当 m = 2的时候有通项，参见具体数学第一章，J(2^m+p) = 2p + 1 ,其中  0
提示： J（2n） = 2J（n）-1;  J(2n+1)  = 2J(n) + 1; ，对m 归纳。
当]]></description><category></category></item><item><title><![CDATA[加法分解方案]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7903685</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7903685</guid><author>juiceda</author><pubDate>Fri, 24 Aug 2012 13:45:13 +0800</pubDate><description><![CDATA[问题描述

　　给一个正整数n，输出它所有的正整数加法的分解方法。
　　注意：
　　1． 根据输入的要求决定交换加数的位置是否视为不同的分解方案。
　　2． 不分解也视为一种分解方案。
　　3． 按字典序输出所有分解方案，格式见样例。


输入格式

　　输入共1行，包含2个正整数n和m，之间用一个空格隔开。n表示待分解正整数，m是1或者2：
　　1表示交换加数的位置是否视]]></description><category></category></item><item><title><![CDATA[将C++文件间的编译依赖性降至最低【ZZ】]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7797090</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7797090</guid><author>juiceda</author><pubDate>Sat, 28 Jul 2012 16:58:32 +0800</pubDate><description><![CDATA[源地址：http://user.qzone.qq.com/39177203/blog/1263969682


假设某一天你打开自己的C++程序代码，然后对某个类的实现做了小小的改动。提醒你，改动的不是接口，而是类的实现，也就是说，只是细节部分。然后你准备重新生成程序，心想，编译和链接应该只会花几秒种。毕竟，只是改动了一个类嘛！于是你点击了一下"Rebuild"，或输入make（或其它类似命]]></description><category></category></item><item><title><![CDATA[求一个字符串中连续出现次数最多的字串.[面试宝典14.5节]]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7796865</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7796865</guid><author>juiceda</author><pubDate>Sat, 28 Jul 2012 15:55:00 +0800</pubDate><description><![CDATA[首先分清楚什么是子串，比如：abc这个字符串，对应的子串为 a/b/c/ab/bc/abc
如果字符串是abcbcbcabc ，则连续出现次数最多的子串是bc，连续出现的次数为3
关键是连续，看代码可以结合例子来理解


代码如下：

#include 
#include 
#include
using namespace std;

pair fun(const string &s]]></description><category></category></item><item><title><![CDATA[Z数组和螺旋数组]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7655552</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7655552</guid><author>juiceda</author><pubDate>Tue, 12 Jun 2012 12:25:31 +0800</pubDate><description><![CDATA[Z数组：

#include
#include
void fun(int n){
    /*动态创建二维数组*/
    int **a = (int **)malloc(n*sizeof(int*));
    if(a==NULL)
        return;
    int i,j;
    for(i=0;i<n;i++)
        a[i] = (int*) malloc]]></description><category></category></item><item><title><![CDATA[反转单向链表]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7607886</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7607886</guid><author>juiceda</author><pubDate>Mon, 28 May 2012 01:00:10 +0800</pubDate><description><![CDATA[#include 
#include 

typedef struct Node{
    struct Node * next;
    int data;
}node;

node* reverse_list(node *head){
    if(head==NULL || head->next == NULL)
        return head;
    node * cur = h]]></description><category></category></item><item><title><![CDATA[C++函数参数中的省略号]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7605550</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7605550</guid><author>juiceda</author><pubDate>Sat, 26 May 2012 22:17:23 +0800</pubDate><description><![CDATA[转自：http://waterday.blog.51cto.com/1032892/329079


C++允许定义形参个数和类型不确定的函数。例如，C语言中的标准函数printf便使用这种机制。在声明不确定形参的函数时，形参部分可以使用省略号“…”代替。“…”告诉编译器，在函数调用时不检查形参类型是否与实参类型相同，也不检查参数个数。

例如：

void ConnectData(]]></description><category></category></item><item><title><![CDATA[C++虚继承的作用]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7570091</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7570091</guid><author>juiceda</author><pubDate>Tue, 15 May 2012 19:29:58 +0800</pubDate><description><![CDATA[源地址：http://lingxiaoyequ.blog.163.com/blog/static/21639050200941941730984/

C++虚继承可以防止多重继承产生的二义性问题。

        虚继承，就是在被继承的类前面加上virtual关键字，这时被继承的类称为虚基类，如下面代码中的base类。虚继承在多重继承的时可以防止二义性。

    class bas]]></description><category></category></item><item><title><![CDATA[C++虚继承的作用]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7570088</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7570088</guid><author>juiceda</author><pubDate>Tue, 15 May 2012 19:29:11 +0800</pubDate><description><![CDATA[C++虚继承可以防止多重继承产生的二义性问题。

        虚继承，就是在被继承的类前面加上virtual关键字，这时被继承的类称为虚基类，如下面代码中的base类。虚继承在多重继承的时可以防止二义性。

    class base

    class derived1 : virutal public base

    class derived2 : virtual]]></description><category></category></item><item><title><![CDATA[C++中map的用法]]></title><link>https://blog.youkuaiyun.com/juiceda/article/details/7568342</link><guid>https://blog.youkuaiyun.com/juiceda/article/details/7568342</guid><author>juiceda</author><pubDate>Tue, 15 May 2012 13:26:04 +0800</pubDate><description><![CDATA[C++ map的基本操作和使用


   来源：(http://blog.sina.com.cn/s/blog_61533c9b0100fa7w.html)
 - C++ map的基本操作和使用_Live_新浪博客
    Map是c++的一个标准容器，她提供了很好一对一的关系，在一些程序中建立一个map可以起到事半功倍的效果，总结了一些map基本简单实用的操作！
1. map最基本的]]></description><category></category></item></channel></rss>