Research in General How to write a great research paper Basics of machine learning http://www.iro.umontreal.ca/~bengioy/DLbook/math.html http://www.iro.umontreal.ca/~bengioy/DLbook/ml.html Basics of deep learning http://www.iro.umontreal.ca/~bengioy/…

* Non-academic 1. Slowing Down to the Speed of Life, by Richard Carlson and Joseph Bailey.2. Your Money or Your Life, by Joe Dominguez andVicki Robins.3. The Art of Happiness, by the DalaiLama.4. Simplify Your Life, by Elaine St.James.5. The 4-Hour W…

Reading List List of reading lists and survey papers: Books Deep Learning, Yoshua Bengio, Ian Goodfellow, Aaron Courville, MIT Press, In preparation. Review Papers Representation Learning: A Review and New Perspectives, Yoshua Bengio, Aaron Courville…

从13年11月初开始接触DL,奈何boss忙or 各种问题,对DL理解没有CSDN大神 比如 zouxy09等 深刻,主要是自己觉得没啥进展,感觉荒废时日(丢脸啊,这么久....)开始开文,即为记录自己是怎么一步一个逗比的走过的路的,也为了自己思维更有条理.请看客,轻拍,(如果有错,我会立马改正,谢谢大家的指正.==!其实有人看没人看都是个问题.哈哈) 推荐 tornadomeet 的博客园学习资料 http://www.cnblogs.com/tornadomeet/category/4976…

Over the last seven years more than 200 quantitative finance articles have been written by members of the QuantStart team, prominent quant finance academics, researchers and industry professionals. 在过去七年中,QuantStart一共发表了200多篇量化金融文章,这些文章的作者包括QS团队成员.优秀…

Teen Readers Teens and younger children are reading a lot less for fun, according to a Common Sense Media report published Monday. 据常识媒体周一发布的报告,为了趣味而阅读青少年少了很多. While the decline over the past decade is steep for teen readers, some data in the report…

领军大家: Geoffrey E. Hinton http://www.cs.toronto.edu/~hinton/ 阅读列表: reading lists and survey papers for deep learning http://deeplearning.net/reading-list/ 课程和教材: Deep Learning 教程(邓侃老师力荐,已有中文版面) http://deeplearning.stanford.edu/wiki/index.php/UFLDL_Tut…

当 iOS7 刚发布的时候,全世界的苹果开发人员都立马尝试着去编译他们的app,接着再花上数月的时间来修复任何出现的故障,甚至重做app.这样的结果,使得人们根本无暇去探究 iOS7 所带来的新东西.一些明显而细微的更新,比如说[NSArray firstObject],这个方法可追溯到 iOS4 时代,现在被提为公有API,除此之外,还有很多隐藏的特性等着我们去挖掘. 平滑淡入淡出动画 我这里要讨论的并非新的弹性动画APIs 或者 UIDynamics,而是一些更细微的东西.CALayer增加…

当 iOS7 刚发布的时候,全世界的苹果开发人员都立马尝试着去编译他们的app,接着再花上数月的时间来修复任何出现的故障,甚至重做app.这样的结果,使得人们根本无暇去探究 iOS7 所带来的新东西.一些明显而细微的更新,比如说[NSArray firstObject],这个方法可追溯到 iOS4 时代,现在被提为公有API,除此之外,还有很多隐藏的特性等着我们去挖掘. 平滑淡入淡出动画 我这里要讨论的并非新的弹性动画APIs 或者 UIDynamics,而是一些更细微的东西.CALayer增加…

Courses on Turbulence Table of Contents 1. Lecture 1.1. UIUC Renewable energy and turbulent environment group 1.2. Turbulent Flow and Transport: MIT open course 1.2.1. reading lists 1 Lecture DEN403, QMUL 1.1 UIUC Renewable energy and turbulent envir…

ubuntu 下安装python开发包,执行命令 sudo apt-get install python-dev,报错: Reading package lists... Error! E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/AZ.archive.ubuntu.com_ubuntu_dists_natty_main_i18n _Translation…

luo@luo-ThinkPad-W540:~$ luo@luo-ThinkPad-W540:~$ luo@luo-ThinkPad-W540:~$ luo@luo-ThinkPad-W540:~$ sudo apt install libreadline-devReading package lists... Error!E: Encountered a section with no Package: headerE: Problem with MergeList /var/lib/apt/…

安装过程出错 首先出现问题sudo apt-get updateReading package lists… Error!E: Encountered a section with no Package: headerE: Problem with MergeList /var/lib/apt/lists/cn.archive.ubuntu.com_ubuntu_dists_natty_main_i18n_Translation-enE: The package lists or status…

一.环境 发行版:Ubuntu 18.04.1 LTS 代号:bionic 内核版本:4.15.0-30-generic 二.背景 在编译Openwrt/LEDE时出现以下错误,进而自动终止了编译: Signing package index... Cannot open file '/home/jello/openwrt/key-build' for reading 三.解决 有两种方法可以解决这一问题: 3.1 第一种为:手动生成对应的public key ./staging_dir/hos…

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1 → b2 → b3 begin to intersect at node c1. Notes: If the two linked lists have…

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 这道题让我们合并k个有序链表,之前我们做过一道Merge Two Sorted Lists 混合插入有序链表,是混合插入两个有序链表.这道题增加了难度,变成合并k个有序链表了,但是不管合并几个,基本还是要两两合并.那么我们首先考虑的方法是能不能利用之前那道题的解法来解答此题.答案是肯定的,但是需要修改…

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 这道混合插入有序链表和我之前那篇混合插入有序数组非常的相似Merge Sorted Array,仅仅是数据结构由数组换成了链表而已,代码写起来反而更简洁.具体思想就是新建一个链表,然后比较两个链表中的元素值,把较小的…

题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 没事来做做题,该题目是说两个排序好的链表组合起来,依然是排序好的,即链表的值从小到大. 代码: 于是乎,新建一个链表,next用两个链表当前位置去比较,谁的小就放谁.当一个链表放完之后,说明另外一个链表剩下的…

题目简述: Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1 → b2 → b3 begin to intersect at node c1. Notes: If the two linked lists…

Even relatively new C programmers have no trouble reading simple C declarations such as int foo[5]; // foo is an array of 5 ints char *foo; // foo is a pointer to char double foo(); // foo is a function returning a double but as the declarations get…

Write a program to find the node at which the intersection of two singly linked lists begins. Notice If the two linked lists have no intersection at all, return null. The linked lists must retain their original structure after the function returns. Y…

Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the two lists and sorted in ascending order. Have you met this question in a real interview? Yes Exampl…

这种错误的意思:无法解析或打开软件包的列表或是状态文件. 出现的原因:无法解析或打开软件包列表多数情况是安装的软件与本身系统有一些冲突之类的问题,或者曾在更新软件源或下载软件的时候意外中断造成的. 解决方法: 方法一 $ sudo rm /var/lib/apt/lists/* -vfR #删除apt-get install 的所有软件状态包,也可以直接删除lists文件夹 $ sudo apt-get update 方法二 $ sudo apt-get clean #清除已加载或本来该加载但是…

Cross-Origin Request Blocked: The Same Origin Policy disallows reading the remote resource at http://localhost:9001/api/size/get. (Reason: CORS header 'Access-Control-Allow-Origin' missing). 打开API项目录,命名用NuGet安装Microsoft.AspNet.WebApi.Cors: 在WebApiCon…

问题: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 官方难度: Hard 翻译: 合并k个已排序的链表,得到一个新的链表并且返回其第一个节点.分析并阐述其复杂度. 这是No.021(Merge Two Sorted Lists)的深入研究. 可以借鉴归并排序的思想,对于长度为k的数组,依次进行二路归并,返回这两个链表合并之后的头结点(利用No.…

问题: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 官方难度: Easy 翻译: 合并2个已排序的链表,得到一个新的链表并且返回其第一个节点. 考虑输入节点存在null的情况,直接返回另一个节点. 节点的定义在No.002(Add Two Numbers)中有…

Today I begin to learn to use Git. I learn from Pro Git. And I recommend it which is an excellent book. Some Ideas: Git is a Distributed Version Control System and it is brilliant. And we know that DDoS attack is famous and distributed as well. So, d…

1. Merge Two Sorted Lists 我们先来看这个 问题: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 是的,这是一个非常简单链表操作问题.也许你只需要花几分种便能轻松写出代码. 2. Merge k Sorted Lists 我们现在来研究这…

题目链接 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 合并k个有序的链表,我们假设每个链表的平均长度是n.这一题需要用到合并两个有序的链表子过程 算法1: 最傻的做法就是先1.2合并,12结果和3合并,123结果和4合并,…,123..k-1结果和k合并,我们计算一下复杂度. 1.2合并,遍历2n个节点 12结果和3合并,遍历3n个节点 123…

最近远程连接mysql总是提示 Lost connection 很明显这是连接初始化阶段就丢失了连接的错误 其实问题很简单,都是MySQL的配置文件默认没有为远程连接配置好,只需要更改下MySQL的配置文件即可.具体的解决步骤如下:找到并修改my.cnf文件.在不同的Linux系统下,my.cnf放在不同的位置.这里以Ubuntu Server做示例,其他系统请根据情况自行找到my.cnf的路径.一般只会存放在/etc/my.cnf或者/etc/mysql/my.cnf下.首先用vim打开my.…