- 博客(212)
- 资源 (1)
- 收藏
- 关注
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 【知识图谱】王昊奋-第1课笔记-知识图谱概论
一、知识图谱与语义技术概述1. 起源人的思想是偏重关联的(Vannevar Bush)→以“链接”(超文本)为中心的系统Web→维基百科2. 语义网从链接文本(Web of Texts, Web of Documents)到链接数据(Web of Objects, Web of Data, Web of Things)i.e. Web中有各种类型的事物,事物(Things no...
2019-11-20 23:24:33
934
2
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 【知识图谱】王昊奋-公开课笔记-从人工智能到开放知识图谱
1. 数据科学是什么?数据科学家在做什么?2. 描述性数据分析(IJCAI2017)3. 知识库(IJCAI2017)(1) BabelNet 自动构建的、开放领域的、多语言的语义网络(2)YAGO2 以Wikipedia为知识来源,包含空间、时间维度的高密度大规模知识库4. 什么是知识?(1)表示形式和传承方式:人类的自然语言、创作的绘画和音乐、数学语言、物理模型、...
2019-10-29 23:02:24
1153
1
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 【PAT】Problem List and Solutions (Advanced Level)
Problem Point(s) Key Star(s) Date Attention 1001A+B Format 20 ⭐ Aug 1 ...
2019-08-21 17:08:21
416
原创 【TensorFlow】GPU和显存资源的配置
随时更新……使用指定的GPUGPU的编号在终端输入nvidia-smi查看。(1)在终端设置# 设置运行该程序可见的GPUCUDA_VISIBLE_DEVICES = 0,1,2 python your_file.py # 指定0#,1#,2#GPUCUDA_VISIBLE_DEVICES = "3,4" python your_file.py # 指定3#,4#GPUCUDA_VISIBLE_DEVICES = "" # 不使用GPU(2)在Python代码设置设置.
2020-10-13 15:59:12
403
原创 【Linux】文件和目录管理指令
Linux一切皆文件Linux的所有内容都是以文件的形式存储和管理的,包括一般文件、目录文件、外接设备(如键盘、硬盘、打印机等)、套接字等。其利弊都比较明显,好处是开发者只需要一套API和开发工具就可以调用Linux系统中的资源;坏处是使用任何外接硬件设备都必须要和某一目录挂载。Linux文件系统层次结构和路径Linux 操作系统中,所有的文件和目录都被组织成以一个根节点“/”开始的倒置的树状结构。指明一个文件存放的位置,可以分别用绝对路径和相对路径,前者是恒定不变的,后者是相对于当前目录.
2020-07-29 14:28:40
359
原创 【Linux】服务器常用指令和解读
查看GPU信息nvidia-smi # 查看当前GPU使用情况watch -n 5 nvidia-smi # 查看实时GPU使用情况(每5秒)参数介绍:GPU: 序号Fan: 风扇转速, 在0~100%之间Temp: 温度(摄氏度)Perf: 性能, 在P0(最大)~P12之间Pwr: 能耗Persistence-M: 持续模式是否打开, 虽然增加能耗但是可以更快启动该GPUBus-Id: 关于GPU总线Disp.A: GPU的显示是否初始化Memory-Usage: 显存使
2020-07-13 15:35:27
749
原创 【Python入门】Numpy扩展程序库常用函数
NumPy(Numerical Python) 是 Python 语言的一个扩展程序库,支持大量的维度数组与矩阵运算,也针对数组运算提供大量的数学函数库。通常与 SciPy(Scientific Python)和 Matplotlib(绘图库)一起使用。NumPy 官网http://www.numpy.org/推荐工具:Jupyter Notebook (非常推荐!一个基于Web的交互式应用...
2020-02-07 01:39:54
1053
原创 【知识图谱】王昊奋-第2课笔记-知识表示与知识建模
(未完待续)一、早期知识表示简介1. 知识是智能的基础,推理和学习一样重要。2. 知识的特性:相对正确性、不确定性、可表示性和可利用性。3. 知识分类:常识+领域、事实+过程+控制、确定+不确定、逻辑+形象。4. 早期知识表示方法(1)一阶谓词逻辑:Horn逻辑(子集)、描述逻辑(可判定子集,O:=<TBox,ABox>)(2)产生式规则:if-then结...
2019-11-23 22:15:01
808
原创 【机试】字符串匹配 (字符串处理)
字符串匹配来源:北京航空航天大学题目描述读入数据string[ ],然后读入一个短字符串。要求查找string[ ]中和短字符串的所有匹配,输出行号、匹配字符串。匹配时不区分大小写,并且可以有一个用中括号表示的模式匹配。如“aa[123]bb”,就是说aa1bb、aa2bb、aa3bb都算匹配。输入描述:输入有多组数据。 每组数据第一行输入n(1<=n<=1000)...
2019-11-12 19:35:41
491
原创 【百练】神奇的口袋 (DP)
神奇的口袋简述:必须装满的01背包的方案数题目描述有一个神奇的口袋,总的容积是40,用这个口袋可以变出一些物品,这些物品的总体积必须是40。John现在有n个想要得到的物品,每个物品的体积分别是a1,a2……an。John可以从这些物品中选择一些,如果选出的物体的总体积是40,那么利用这个神奇的口袋,John就可以得到这些物品。现在的问题是,John有多少种不同的选择物品的方式。输...
2019-11-12 15:10:06
163
原创 【模板】动态规划之最大子段和、最大子矩阵问题
最大子段和Description:给出一段序列,选出其中连续且非空的一段使得这段和最大。Input:第一行是一个正整数N(N<= 200000),表示了序列的长度。第接下来的N行包含N个绝对值不大于10000的整数A[i],描述了这段序列。Output:仅包括1个整数,为最大的子段和是多少。子段的最小长度为1。Sample Input:72 ...
2019-11-12 15:06:11
622
原创 【知识图谱】王昊奋《知识图谱》课程笔记和资源
序号 课程 日期 备注 公开课 从人工智能到开放知识图谱 Oct 29 第1课 知识图谱概论 Nov 20 (持续更新中……)其它笔记:知识图谱笔记(小象学院课程)KG-知识图谱入门-王昊奋课程详细笔记(附课件、课程链接与详细笔记)...
2019-10-29 23:09:51
2457
原创 【LeetCode】53. Maximum Subarray
53.Maximum SubarrayEasyGiven an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,...
2019-09-28 23:08:27
105
原创 【LeetCode】Problem List and Solutions
Problem Key Star(s) Date Attention 2.Add Two Numbers 链表 ⭐⭐ May 29,2019 7.Reverse Integer ⭐ May 27,2019 取余和取模的区别 8.S...
2019-09-28 22:51:30
96
原创 1133 Splitting A Linked List (25 point(s))
1133Splitting A Linked List(25point(s))Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the v...
2019-09-07 19:06:42
92
原创 1135 Is It A Red-Black Tree (30 point(s))
1135Is It A Red-Black Tree(30point(s))There is a kind of balanced binary search tree namedred-black treein the data structure. It has the following 5 properties:(1) Every node is either red o...
2019-09-07 19:01:55
189
原创 1143 Lowest Common Ancestor (30 point(s))
1143Lowest Common Ancestor(30point(s))The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.A binary search tree (BST) is recu...
2019-09-07 17:36:56
192
原创 1151 LCA in a Binary Tree (30 point(s))
1151LCA in a Binary Tree(30point(s))The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.Given any two nodes in a binary tree...
2019-09-07 17:15:26
162
原创 1127 ZigZagging on a Tree (30 point(s))
1127ZigZagging on a Tree(30point(s))Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder trav...
2019-09-06 17:24:52
279
原创 1126 Eulerian Path (25 point(s))
1126Eulerian Path(25point(s))In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends...
2019-09-06 17:13:32
87
原创 1125 Chain the Ropes (25 point(s))
1125Chain the Ropes(25point(s))Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as sho...
2019-09-06 17:10:31
132
原创 1122 Hamiltonian Cycle (25 point(s))
1122Hamiltonian Cycle(25point(s))The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".In this problem, you ...
2019-09-06 02:35:03
113
原创 1124 Raffle for Weibo Followers (20 point(s))
1124Raffle for Weibo Followers(20point(s))John got a full mark on PAT. He was so happy that he decided to hold a raffle(抽奖) for his followers on Weibo -- that is, he would select winners from eve...
2019-09-06 01:38:42
197
原创 1139 First Contact (30 point(s))
1139First Contact(30point(s))Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would ...
2019-09-06 00:38:49
405
原创 1117 Eddington Number (25 point(s))
1117Eddington Number(25point(s))British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an "Eddington number",E-- that is, the max...
2019-09-06 00:37:19
157
原创 1150 Travelling Salesman Problem (25 point(s))
1150Travelling Salesman Problem(25point(s))The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shorte...
2019-09-05 21:01:45
160
原创 1149 Dangerous Goods Packaging (25 point(s))
1149Dangerous Goods Packaging(25point(s))When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in serio...
2019-09-05 20:23:09
120
原创 1148 Werewolf - Simple Version (20 point(s))
1148Werewolf - Simple Version(20point(s))Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,player #1 sai...
2019-09-05 20:14:22
171
原创 1121 Damn Single (25 point(s))
1121Damn Single(25point(s))"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of....
2019-09-05 12:54:42
165
原创 1134 Vertex Cover (25 point(s))
1134Vertex Cover(25point(s))Avertex coverof a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex se...
2019-09-05 03:23:20
122
原创 1138 Postorder Traversal (25 point(s))
1138Postorder Traversal(25point(s))Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the fi...
2019-09-05 03:05:37
131
原创 1137 Final Grading (25 point(s))
1137Final Grading(25point(s))For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first o...
2019-09-05 02:32:13
134
原创 1132 Cut Integer (20 point(s))
1132Cut Integer(20point(s))Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 167334, we have A = 16...
2019-09-05 00:44:12
111
原创 1155 Heap Paths (30 point(s))
1155Heap Paths(30point(s))In computer science, aheapis a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is eit...
2019-09-05 00:30:04
145
原创 1154 Vertex Coloring (25 point(s))
1154Vertex Coloring(25point(s))Aproper vertex coloringis a labeling of the graph's vertices with colors such that no two vertices sharing the same edge have the same color. A coloring using at ...
2019-09-04 23:36:10
119
原创 1153 Decode Registration Card of PAT (25 point(s))
1153Decode Registration Card of PAT(25point(s))A registration card number of PAT consists of 4 parts:the 1st letter represents the test level, namely,Tfor the top level,Afor advance andBf...
2019-09-04 19:37:43
195
原创 1144 The Missing Number (20 point(s))
1144The Missing Number(20point(s))Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.Input Specification:Each input file contains one test ...
2019-09-04 15:32:56
112
原创 1152 Google Recruitment (20 point(s))
1152Google Recruitment(20point(s))In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is super-simple, a...
2019-09-04 15:20:43
175
原创 1147 Heaps (30 point(s))
1147Heaps(30point(s))In computer science, aheapis a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either g...
2019-09-04 14:59:38
137
numpy_basic.rar
2020-02-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人