test

ORACLE ANALYZE使用小结

佐手、 提交于 2020-02-04 13:55:56
ANALYZE 的介绍 使用 ANALYZE 可以收集或删除对象的统计信息、验证对象的结构、标识表或 cluster 中的行迁移 / 行链接信息等。官方文档关于 ANALYZE 功能介绍如下: · Collect or delete statistics about an index or index partition, table or table partition, index-organized table, cluster, or scalar object attribute. · Validate the structure of an index or index partition, table or table partition, index-organized table, cluster, or object reference (REF). · Identify migrated and chained rows of a table or cluster. · ANALYZE 的使用 ANALYZE TABLE 可以指定分析: 表、所有字段、所有索引字段、所有索引。 若不指定对应对象则表示全部都分析 # 完全分析,采样 100% ANALYZE TABLE TABLE_NAME COMPUTE STATISTICS; ANALYZE TABLE

项目一:Kaggle Titanic

喜夏-厌秋 提交于 2020-02-04 08:39:36
项目一:Kaggle Titanic 预备知识:《python机器学习基础教程》第二,四,五,六章知识。 编译环境:JupyterNotebook 代码: import numpy as np import pandas as pd import sklearn.model_seletion import GridSearchCV import sklearn.model_seletion import cross_val_score from sklearn.pipeline import make_pipeline from sklearn.preprogressing import StandardScaler from sklearn.svm import SVC import warning warnings.filterwarnings(action='ignore) step 1:Loading DataSet 这里的训练集和测试集和代码放在同一个目录 train = pd.read_csv(‘titanic_train.csv’) test = pd.read_csv(‘titanic_test.csv’) test2 = pd.read_csv(‘titanic_test.csv’) titanic = pd.concat([train, test], sort

C#中的多态性

爷,独闯天下 提交于 2020-02-04 08:20:40
多态性 首先理解一下什么叫多态。同一操作作用于不同的对象,可以有不同的解释,产生不同的执行结果,这就是多态性。 多态性通过派生类覆写基类中的虚函数型方法来实现。 多态性分为两种,一种是编译时的多态性,一种是运行时的多态性。 编译时的多态性:编译时的多态性是通过重载来实现的。对于非虚的成员来说,系统在编译时,根据传递的参数、返回的类型等信息决定实现何种操作。 运行时的多态性:运行时的多态性就是指直到系统运行时,才根据实际情况决定实现何种操作。C#中运行时的多态性是通过覆写虚成员实现。 下面我们来分别说明一下多态中涉及到的四个概念:重载,覆写,虚方法和抽象方法。 重载和覆写的区别: 重载 类中定义的方法的不同版本 public int Calculate(int x, int y) public double Calculate(double x, double y) 特点(两必须一可以) 方法名必须相同 参数列表必须不相同 返回值类型可以不相同 覆写 子类中为满足自己的需要来重复定义某个方法的不同实现。 通过使用override关键字来实现覆写。 只有虚方法和抽象方法才能被覆写。 要求(三相同) 相同的方法名称 相同的参数列表 相同的返回值类型 例: public class Test { public int Calculate(int x, int y) { return x +

Auditing Enhancements (Audit Policies and Unified Audit Trail) in Oracle Database 12c Release 1 (12.1)

梦想的初衷 提交于 2020-02-04 04:25:11
select substrb(parameter_name ,1,25) name, substrb(parameter_value,1,20) value, substrb(audit_trail ,1,20) trail from dba_audit_mgmt_config_params ; 8i | 9i | 10g | 11g | 12c | 13c | 18c | 19c | Misc | PL/SQL | SQL | RAC | WebLogic | Linux Home » Articles » 12c » Here Auditing Enhancements (Audit Policies and Unified Audit Trail) in Oracle Database 12c Release 1 (12.1) The introduction of audit policies and the unified audit trail simplifies the configuration of database auditing in Oracle 12c. Database auditing has always been extremely flexible, but that flexibility has also served to make

HDFS中namenode故障处理

核能气质少年 提交于 2020-02-04 03:53:56
NameNode故障后,可以采用如下两种方法恢复数据: 1、将SecondaryNameNode中数据拷贝到NameNode存储数据的目录 (1) kill -9 NameNode进程 [test@hadoop151 ~] $ jps 3764 DataNode 4069 NodeManager 3654 NameNode 7738 Jps [test@hadoop151 ~] $ kill - 9 3654 [test@hadoop151 ~] $ jps 3764 DataNode 4069 NodeManager 7770 Jps (2) 删除 NameNode 存储的数据(/opt/module/hadoop-2.7.2/data/tmp/dfs/name) [test@hadoop151 ~] $ rm - rf / opt / module / hadoop - 2 . 7 . 2 / data / tmp / dfs / name/ * (3) 拷贝 SecondaryNameNode 中数据到原 NameNode 存储数据目录 [test@hadoop151 ~] $ scp - r test@hadoop153: / opt / module / hadoop - 2 . 7 . 2 / data / tmp / dfs / namesecondary/ * /

手写数字识别 KNN

℡╲_俬逩灬. 提交于 2020-02-04 02:54:54
from numpy import * import csv import operator from sklearn . neighbors import KNeighborsClassifier def toInt ( array ) : array = mat ( array ) m , n = shape ( array ) Array = zeros ( ( m , n ) ) for i in range ( m ) : for j in range ( n ) : try : Array [ i , j ] = int ( array [ i , j ] ) except ValueError : continue return Array def nomalizing ( array ) : m , n = shape ( array ) for i in range ( m ) : for j in range ( n ) : if array [ i , j ] != 0 : array [ i , j ] = 1 return array def loadTrainData ( ) : l = [ ] with open ( "train.csv" ) as file : lines = csv . reader ( file ) for line in

在VS2005中初探MasterPage & JAVASCRIPT 之拙劣使用法(一)

ε祈祈猫儿з 提交于 2020-02-04 02:49:09
(纯供自己记录使用,只是为了兼容以前的javaSript,同时VS2005的验证控件有问题,所以采用此种拙劣的方式) 使用MasterPage页的例子: <%@ Page Language="C#" MasterPageFile="~/MasterPage/Default.master" CompileWith="testJavaScript.aspx.cs" ClassName="testJavaScript_aspx" Title="" %> <asp:Content ID=cont1 ContentPlaceHolderID=contMain Runat=server > <script lang=c# runat=server > //生成客户端代码时给服务器控件名添加的前缀“ctl00_” + ContentPlaceHolderID + “_” + 服务器控件ID public string str_Client = "ctl00_ContMain"; void Page_Load(object sender, EventArgs e) { // this.btn_Test.Attributes.Add("onclick", "return checkdata()"); //这里加入了转义字符 // this.txt_Test.Attributes["onblur"]

Codeforces Round #616 (Div. 2) C. Mind Control

只谈情不闲聊 提交于 2020-02-04 02:47:14
题目链接: https://codeforces.com/contest/1291 You and your n−1 friends have found an array of integers a1,a2,…,an. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process. You are standing in the m-th position in the line. Before the process starts, you may choose up to k different people in the line, and persuade them to always take

图神经网络 | (6) 图分类(SAGPool)实战

落爺英雄遲暮 提交于 2020-02-04 02:28:00
近期买了一本图神经网络的入门书,最近几篇博客对书中的一些实战案例进行整理,具体的理论和原理部分可以自行查阅该书,该书购买链接: 《深入浅出的图神经网络》 。 该书配套代码 本节我们通过代码来实现基于自注意力的池化机制(Self-Attention Pooling)。来对图整体进行分类,之前我们是对节点分类,每个节点表示一条数据,学习节点的表示,进而完成分类,本节我们通过自注意力池化机制,得到整个图的表示,进而对全图进行分类(每个图表示一条数据)。 导入必要的包 import os import urllib import torch import torch.nn as nn import torch.nn.init as init import torch.nn.functional as F import torch.utils.data as data import torch.optim as optim import numpy as np import scipy.sparse as sp from zipfile import ZipFile from sklearn.model_selection import train_test_split import pickle import pandas as pd import torch_scatter #注意

C. Mind Control

六眼飞鱼酱① 提交于 2020-02-04 01:50:20
链接: https://codeforces.com/contest/1291/problem/C You and your n−1n−1 friends have found an array of integers a1,a2,…,ana1,a2,…,an. You have decided to share it in the following way: All nn of you stand in a line in a particular order. Each minute, the person at the front of the line chooses either the first or the last element of the array, removes it, and keeps it for himself. He then gets out of line, and the next person in line continues the process. You are standing in the mm-th position in the line. Before the process starts, you may choose up to kk different people in the line, and