好久没有Coding了,今天兴趣来了,找了一本Matlab与C++嵌入式编程的书翻了翻,想到以后可能也需要用,就觉得尝试着弄了下,
http://www.quants.hk/category/amibroker-%E6%95%99%E5%AD%B8/ http://www.elitetrader.com/et/index.php?threads/amibroker-or-r-or-python.254851/Interactive Broker Tutorialhttp://holowczak.com/ib-tws-api-t
_.py在__init__.py中改掉这一行就可以了。tup= line.split("") add_
VC中动态申请double data[100][8000],dataInterp[300][8000] 方法一: double **data,**dataInterp; 申请分配 data = (double **)malloc(sizeof(double)*100); dataInterp = (double **)malloc(sizeof(double)*300); for(p = 0;p&
RT
X。Y and X “圈里面一个叉”Y are the Hadamard and Kronecker product of matriceshttp://en.wikipedia.org/wiki/Hadamard_product_(matrices)http://en.wikipedia.org/wiki/Kronecker_product 也叫外积http://en.wikiped
1. 买域名 go daddy 上2. 买服务器空间go dad
https://leetcode.com/pro
RT 这个问题经常遇到。通常是使用PStricks包才有出现的问题
工具-扩展程序管理器tool-extension manager
1. Dirichlet 概率分布 是 概率分布的分布。its support 是simplex,即Dirichlet 概率密
ctrl + L 选中浏览器中的网址shift + insert 是在vim中插入copy的文本
ref:oosely thought of as a function on the real line which is zero everywhere except at the origin, where
ref:eigen vectorhttp://www.quora.com/What-is-an-eigenvector-of-a-covariance-matrixgeometric interpretationhttp://www.visiondummy.com/2014/04/geometric-interpretation-covariance-matrix/It is positive s
General but ImportantGiven a matrix, ask yourself,is it square matrix?is it symmetric? eigenvectors are orthonormal for distinct eigenvaluescan be decomposed? Eigendecomposed? SVD?How about is eigenva
https://leetcode.com/problems/combinations/思路1: 枚举0,1全排列。这里的dfs tree: 见自己总结的notes这题是经典的back tracking的题目。只要求出0,1全排列就行。利用backtracking的模板这里的m是表示第m个元素class Solution(object): def dfs(self, m, k, nums,
port visual studio c++ to linux gcc version. make 之后 遇到LBFGSCPP.cpp: In member func
win7安装ubuntu14参考:win7安装ubuntu14 更新语言支持: system setting->languag
1.项目-》属性-》调试-》命令参数(空格间隔)2.在Debug里设了相关属性,换成Release之后,要重新设定3.matlab的库,目录:属性里
winedit 用texify 编译,有-fy的就是编译后自动打开
Subsetshttps://leetcode.com/problems/subsets/思路1 这里其实就是把Combination拿到题目的思路2,收集那种组合树所有root到其余节点(不包括root本身)path。class Solution: # @param S, a list of integer # @return a list of lists of integer
赋值list a, bb = a, it is just a reference assignment. a改变,b也改变b = a[:], it is copy. a 改变,b不变b = a + [4]a[::]里::是一种operater, 默认是a[::1],1代表从头到尾的取间隔为1的元素组成新的list。所以a[::-1],就是reversed,还可以有a[::-2] 排序list xx
参考: http://wp4fb.com/how-to-add-a-privacy-policy-to-your-apps/
list: easily delete, and insert2. stack: need base pointer, top pointer & stacksizeap
可能原因:1. link的时候 没有加lib 或者include 2. 最后link的时候,g++命令一定要把所有的.o全部放到argument里,而不只是把被main.cpp include的o文件
seis07:/projdata3/info_fil/yqxu/opinion_mining/code[88] > make g++ -g -c main.c In file included from main.c:12: LBFGSCPP.h:18: error: looser throw specifier for ‘virtual ExceptionWithIfla
RT. 此外 ~/表示 ¥HOME directory。
如果最后一行什么都没有,即倒数第二行多了个\n,文本的末尾多一个\n,那么fileIn还是会读取到length,因为什么都没有,所以length还会是last time value。所以。要每次都给length赋初值为0while ( fileIn.good() && !fileIn.eof() ) fileIn>>length;
\documentclass[a4paper]{article}
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号