- 博客(67)
- 资源 (2)
- 问答 (4)
- 收藏
- 关注
RSS订阅原创 基于关联分析法的美国专利技术网络挖掘（python代码 图文 超详细）
目录数据清洗Apriori结果数据清洗挑选5000多条美国专利数据进行关联分析，首先设置支持度为0.01，找寻5000多条数据中被引用次数在50条以上的专利，认为其为核心专利技术首先用excel对参考专利数据进行简单的数据清洗，并使用nltk库进行分词import pandas as pdfrom nltk import word_tokenizedata=pd.read_csv("Desktop\\python_work\\435_2.csv")txt=data['UREF:PNO']#工作
2020-11-19 20:42:53
815
原创 基于关联分析法的专利发明人合作关系探究（python代码 图文 超详细）
目录分词Apriori结果分词应用python中nltk包分词首先在找到国际G（物理领域）的所有专利，最终得到6000多条专利数据。接下来应用python中nltk包对专利发明人进行分词import pandas as pdfrom nltk import word_tokenize#将编码utf-8改成gbkdata=pd.read_csv("Desktop\\python_work\\diming_data.csv",encoding='gbk')txt=data['INVT']#工作簿
2020-11-19 19:18:50
933
原创 基于决策树方法的专利被引影响因素研究（python代码 图文 超详细）
目录综述1.数据来源与指标选取1.1数据来源1.2指标选取2.数据清洗与转换2.1数据清洗2.2数据转换3.决策树模型构建及准确性评估与优化3.1模型构建准确性评估与优化4.分析结果综述本次研究基于决策树方法对可能影响专利被引的6个影响因素（专利申请年、专利公开年、发明人数量、专利权人数量、发明人国家、专利权人国家）与专利是否被引的潜在关系进行分析。研究发现，专利申请年是其中影响最为显著的因素，而后依次是发明人数量、专利公开年数量、专利权人数量，而其他2个指标的影响效果并不明显。1.数据来源与指标选
2020-10-30 14:12:27
1732
原创 管理信息系统重要知识点整理
目录信息的概念与性质：信息系统的概念系统：信息系统：信息系统的发展：需求：管理信息系统的概念管理信息系统与环境：管理信息系统的技术基础数据处理：数据组织：数据库技术计算机网络技术物联网技术区块链管理信息系统的战略规划和开发方法战略规划的作用、内容和步骤MIS战略规划方法MIS开发方法管理信息系统的系统分析可行性分析管理信息系统的系统设计管理信息系统的系统实施物理系统的实施计算机系统的实施网络系统的实施程序设计程序和系统调试信息的概念与性质：信息是客观世界各种事物特征的反应信息是可以通讯的信息经过加工
2020-09-05 10:53:07
5647
原创 LeetCode Insertion Sort List （insertion sort）（java & golang）
ProblemAnalysis ProcessFirst of all, to avoid the judgment of the head, create a newHead, newHead. Since the head may be updated in the insertion sort, every time the head is removed, use newIndex = newhead.nextCreate two pointers and record the header
2020-08-26 22:52:57
130
原创 LeetCode Sort Colors（Dutch National Flag problem ）（java & golang）
ProblemAnalysis ProcessThe question is known as the Dutch National Flag problemWe use three Pointers (p0, p2, and curr) to track the right-most boundary of 0, the left-most boundary of 2, and the currently considered element, respectivelyThe idea of t
2020-08-25 22:43:35
206
原创 LeetCode Word Ladder BFS（golang & java）
ProblemAnalysis Process1.Preprocess the given wordList to find all the universal states and record the universal states in the dictionary, the key is the universal state, and the value is all the words with the universal stateuniversal state:Replace a
2020-08-15 13:37:58
211
原创 LeetCode Flatten Binary Tree to Linked List BFS（java & golang）
ProblemAnalysis ProcessAfter the binary tree is expanded into a single linked list, the order of nodes in the single linked list is the order of nodes traversed and visited before the binary tree.Therefore, the binary tree can be preordered traversal to
2020-08-14 22:32:38
129
原创 LeetCode Binary Tree Zigzag Level Order Traversal BFS（golang & java）
ProblemAnalysis ProcessThe most intuitive approach is BFS, which traverses the tree layer by layer.The default order of BFS at each layer is from left to right, so the BFS algorithm needs to be adjusted to generate the sawtooth sequenceThe key is to u
2020-08-13 10:44:42
129
原创 LeetCode Symmetric Tree BFS (golang & java)
ProblemAnalysis ProcessBoth trees are mirror images of each other if the following conditions are metBoth of their roots have the same valueThe right subtree of each tree is mirrored to the left subtree of the other treeWe can achieve such a recursiv
2020-08-12 10:52:15
135
原创 LeetCode Surrounded Regions DFS （java & golang）
problemAnalysisi ProcessNotice in the explanation of the title that no O at any boundary is filled with X and we can imagine that all O that is not surrounded is directly or indirectly connected to O at the boundary and we can use this property to deter
2020-08-11 10:37:01
121
原创 LeetCode Letter Combinations of a Phone Number Backtracking (golang & java)
ProblemAnalysis Process1.Iterate over the letter corresponding to the first number2.A new letter is added to each number3.Adds the combined letters to the result set code until the numeric string is emptyas shown in the figureCodegolangfunc backt
2020-08-10 10:20:18
133
原创 LeetCode Restore IP Addresses DFS+Backtracking （golang & java）
ProblemAnalysis ProcessHow many options do we have when we do the first step? Take “25525511135” for examplepick “2” for the first segmentpick “25” for the first segmentpick “255” for the first segmentThere are three options. After you make your cho
2020-08-09 10:57:52
143
原创 LeetCode Rotting Oranges BFS (golang & java)
ProblemAnalysis ProcessBFS1.To start with, we take all the rotten oranges, and we queue them up as nodes at level 02.Then BFS is carried out. The adjacent nodes of each node may be nodes in four directions, top, bottom, left and right. Pay attention t
2020-08-08 10:20:08
239
原创 LeetCode Convert Sorted Array to Binary Search Tree BFS （golang & java）
ProblemAnalysis ProcessIn a given sequence traversal array, the number in each subtree must be continuous in the array, so the number contained in the subtree can be determined through the array subindex range, denoted as [left,right] for the entire mid
2020-08-07 10:05:40
149
原创 LeetCode Clone Graph （golang&java）
ProblemBasicsGraphIn computer science, a graph is defined as a set of vertices paired with a set of edges. The vertices are represented by circles, and the edges are the lines between them. Edges connect a vertex to other vertices.The following are a
2020-08-06 22:15:15
193
原创 LeetCode Course Schedule II Topological Sorting（golang&java）
ProblemAnalysis ProcessWhen we use a queue for breadth first search, all the nodes with an entry degree of 0 are placed in the queue, they are the first nodes that can be ordered topologically, and the relative order between them is irrelevantIn each s
2020-08-05 10:40:07
152
原创 LeetCode Course Schedule Topological Sorting（golang&java）
ProblemBasicsTopological SortingTo perform Topological ordering of a Directed Acyclic Graph (DAG)G, all vertices in G are arranged into a linear sequence, making any pair of vertices u and v in the Graph. If the edge <u,v> E(G), then u appears be
2020-08-04 18:33:40
181
原创 【最新】k8s中kubeflow(v1.0)部署全过程+踩坑全集（图文）
目录简述部署环境及要求部署1.下载kfctl包和yaml文件2.apply yaml文件3.阿里云构建拉取所需要的镜像4.创建pv5.修改各个deploy statefulset 的镜像下载策略部署成功踩坑全集1.报错Segmentation fault2.使用ksonnet 时找不到yaml文件3.apply kfctl_k8s_istio.v1.0.2.yaml时一直卡着不动4.
2020-08-03 17:27:17
6322
18
原创 LeetCode Candy Greedy Algorithm（golang）
ProblemAnalysis ProcessRule definition:Suppose student A and student B are adjacent to each other, and AAis to the left of B;Left rule: when ratings A>ratings A ,B has more sugar than A,Right rule: when ratings A>ratings B ,A has more sugar tha
2020-08-03 15:16:56
137
原创 【k8s实战】 在离线项目混部 通过kubeflow（tf-operator）部署TensorFlow机器学习任务+prometheus/grafana监控资源使用全过程（最新 图文）
目录在离线混合部署概念最新版kubeflow部署TensorFlow部署二级目录三级目录在离线混合部署概念先举一个例子，众所周知的天猫双十一当天的流量非常之大，那么就需要成百上千台服务器构成一个超大集群来提供计算能力，但是双十一过去之后，集群资源就面临着浪费的局面。假设业务分为在线和离线两种模式：在线任务需要资源相对较少，但要求响应时间短；离线任务则不需要对任务进行迅速响应，但是计算量相对较大、占用资源多。那么我们应该怎么在K8S集群上完成这两种业务的部署、并且使得CPU利用率始终维持在一个比较高的水平
2020-08-02 22:35:39
1185
原创 LeetCode Jump Game Greedy Algorithm（golang）
ProblemAnalysis ProcessUse the greedy algorithm ideaSelect the value of the first position as the maximum length of the initial jump，then compare the jump position to the last position to determine whether the position is less than the jump position v
2020-08-02 12:08:48
143
原创 LeetCode Is Subsequence Greedy Algorithm（golang）
ProblemBasicsGreddy AlgorithmThe greedy algorithm, which means that when you solve a problem, you always make what seems to be the best choice at the moment. In other words, instead of thinking about the overall optimal solution, the algorithm gives yo
2020-08-01 16:12:18
153
原创 Summary of algorithms I‘ve learned（dp,Binary search,Two pointer, Stack , Binary Tree）(golang)
ContentsDynamic programmingWhich promblem can be sovled by dp?General ideas of problem solving by dpThe steps of algorithm implementationPseudocodeExamplePackage ProblemBinary searchThe steps of algorithm implementationExamplesTwo pointerThe steps of algor
2020-07-31 18:33:13
259
原创 LeetCode BinaryTree Level Order Traversal (golang)
ProblemAnalysis Process1.Recursiveuse DFSWe can first traversal the binary tree in order (around the root), at the same time, record the level of the node, and define an array for each level, and then put the value of the accessed node into the array
2020-07-31 10:35:54
142
原创 LeetCode Binary Tree Postorder Traversal (golang)
ProblemAnalysis ProcessRecursive solution is easyIterative soltionIterating from the root, the top element pops out to the output list, then presses all its child nodes in turn, pressing the stack from top to bottom, left to rightCodeRecursive/**
2020-07-30 10:17:02
151
原创 LeetCode Binary Tree Preorder Traversal (golang)
ProblemAnalysis ProcessTwo kinds of solutionsOne is Rescursive it is very easyThe other is IterativeStart at the root node, each iteration pops the current top element and pushes its child onto the stack, pressing the right child first and then the
2020-07-29 13:48:53
146
原创 Cgroups中的资源管理 hierarchy层级树（cgroup树）
之前在学习docker的时候接触到了Cgroups的相关概念，下面将总结一些 hierarchy层级树（cgroup树）相关知识Cgroups组件在学习cgroup之前需要了解cgroups的三个组件控制组一个cgroups包含一组进程，并可以在这个cgroups上增加Linux subsystem的各种参数配置，将一组进程和一组subsystem关联起来subsystem 子系统是一组资源控制模块，可以通过lssubsys -a命令查看当前内核支持哪些subsystemsubsystem作用
2020-07-28 14:52:27
2703
原创 LeetCode Binary Tree Inorder Traversal (golang)
ProblemAnalysis ProcessRecursive solution is very easywe need to use iterative algorithmHere we are going to use the auxiliary stack1.The left subtree is traversed first to push the element onto the stack and then traversed in order to push the eleme
2020-07-28 10:43:41
144
原创 kubernetes中的调度和资源管理（QoS，优先级，抢占）
之前学习kubernetes时，实际部署操作和理论知识并不能很好的连接起来，尤其是如何调度的过程有些模棱两可，下面是一些总结以及对于k8s资源管理的学习目录一、调度过程1.开始有一个Yaml文件2.提交完Yaml文件后，APIServer将待创建的请求路由给Controllers进行校验3.校验完后，创建一个Pod，但此时namespace为空，phase为pending4.Kube-Scheduler观察到新创建的Pod namespace为空，视为待调度5.通过一系列计算，Kube-Scheduler
2020-07-27 22:57:52
600
原创 LeetCode Same Tree (golang)
ProblemAnalysis ProcessRecursion1.Determines whether the value of the current node is equal2.Recursively determines whether left and right subtrees are equalCode/** * Definition for a binary tree node. * type TreeNode struct { * Val int *
2020-07-27 10:14:22
119
原创 阿里云ACK 托管版K8s 创建与部署应用 全过程（图文）
目录简介创建集群配置Work配置组件配置使用镜像快速创建无状态Deployment应用应用基本信息容器配置高级设置测试使用私有镜像仓库创建应用准备好镜像仓库及镜像创建YAML简介容器服务Kubernetes版ACK（Alibaba Cloud Container Service for Kubernetes）是全球首批通过Kubernetes一致性认证的服务平台，提供高性能可伸缩的容器应用管理服务，支持企业级Kubernetes容器化应用的生命周期管理。简化集群的搭建和扩容等运维工作，整合阿里云虚拟化、
2020-07-25 22:34:43
8695
1
原创 【解决】k8s 通过kubeadm部署节点node时输入完token后一直卡着不动
问题描述之前在部署k8s时，通过kubeadm 将node节点接入master节点时，一时卡着不动，如下图，找遍全网也没找到相应的解决方法，经过自己长时间的不断排查，终于找到了问题所在，下面是具体过程排查过程1.一开始自然而然就想到会不会是token失效导致无法接通，但是通过在master节点上进行kubectl create token 后重新生成接入后还是不行2.通过查找日志，他报的错误是怀疑是无法拉取国外的镜像文件进行接通，就先下载了国内镜像，通过tag进行替换docker pull r
2020-07-25 21:11:38
6006
1
原创 k8s部署 JAVAWEB 理论+实战全过程(图文)
目录简述1.制作镜像三级目录2.创建控制器管理pod3.Pod数据持久化4.暴露应用5对外发布应用简述之前通过docker部署了Javaweb项目，现在将项目移植到k8s平台主要分为五个部分1.制作镜像主要是基础镜像制作，服务镜像制作，以及项目镜像制作，将制作好的镜像打包发布到仓库中三级目录2.创建控制器管理pod用k8s控制器去部署，一般选择有Deployment：无状态部署StatefulSet：有状态部署DaemonSet：守护进程部署Job & CronJob：批处理
2020-07-25 16:45:09
1842
原创 LeetCode Basic Calculator Stack (golang)
PromblemAnalysis Process1.Define two stacks，One is the numeric stack and the other is the symbol stack2.Define symbol priority3.Same-level symbols can pop up, low-level symbols can pop up high-level symbols (except open bracket)4.The numeric stack a
2020-07-25 09:54:27
352
原创 LeetCode Vaild Parentheses Stack (golang)
problembasicsStackA special data structure in a linear table in which data can only be inserted or deleted from a fixed end and the other end is blockedThe main characteristic of Stack is First In Last OutStack overflows when full, and underflows whe
2020-07-24 10:48:12
112
原创 LeetCode Median of Two Sorted Arrays Binary Search (golang)
ProblemAnalysis ProcessThe problem says there are two arrays and the overall run time complexity should be O(log(m+n)),it’s natural to think about merging arrays and binary search.By the definition of median, when m+n is odd,the median is the (m+n)/2
2020-07-23 11:00:23
160
原创 Kubernetes(k8s)集群部署全过程+常见问题详解——基于CentOS8(图文)
目录设备准备虚拟机： VMware Workstation Pro 15操作系统 CentOS8Master节点部署Node节点部署常见问题三级目录自己在进行k8s部署集群时，遇到了很多很多问题，可以说是非常麻烦，本文主要是记录部署全过程以及常见问题的一些解决方案设备准备虚拟机： VMware Workstation Pro 15这里用到了三台k8s-master01k8s-node01k8s-node02操作系统 CentOS8具体设置可参考另一篇文章 https://blog.csd
2020-07-22 22:38:11
1508
原创 Kubernetes(k8s)概述（背景 价值 目的 原理）
目录概念背景价值目的原理组件概念Kubernetes(K8S)是一个可移植的，可扩展的开源平台，用于管理容器化的工作负载和服务，可促进声明式配置和自动化。它拥有一个庞大且快速增长的生态系统。Kubernetes的服务，支持和工具广泛可用背景k8s的前身是Google公司内部使用的borg,于2014年开源，由go语言写成。在这之前也有一些资源管理器，比如Twitter之前使用的Mesos,Docker自带的swarm等等价值传统部署时代： 早期，组织在物理服务器上运行应用程序。无法为物理服务器中
2020-07-22 12:07:58
1878
原创 LeetCode Search in Rotated Sorted Array Binary Search (golang)
ProblemBasicsBinary SearchBinary Search is a more efficient method of finding data. However, Binary Search requires a linear table to be stored sequentially, and the elements in the table are arranged in order by keywordSearch ProcessFirst, assuming
2020-07-22 10:43:35
149
TA创建的收藏夹 TA关注的收藏夹
TA关注的人