cheungbo-mong / mengoreo.github.io Goto Github PK

https://www.juicyiter.com/2018/07/25/csapp-1/

Files include **text files ** which consist exclusively of ASCII characters and binary files(all other files). Preprocessing phase: Reading the header file and insert it(them) into the C program te

https://www.juicyiter.com/2018/05/23/pat1002a/

多项式相加 123456789101112131415161718192021222324252627282930313233#include <stdio.h>int main(){ int k1,k2; int i,d,k=0;/k is the number of different exponents/ double a[1001]={0},t

https://mengoreo.github.io/post/deep_learning_book/

Linear Algebra Basic Types Scalars: A scalar is just a single number, usually in lower-case variable names.
Vectors: An array of numbers, with lower case names written in bold typeface. [ \boldsymbol{x} = [ x_1, x_2, \cdots, x_n ]^\top . ]
Matrices: A 2-D array of numbers, usually given in upper-case variable names with bold typeface, Such as (\boldsymbol{M}).
Tensors: An array with more than two axes, denoted by this typeface: (\boldsymbol{\mathsf{A}}) (in latex: \boldsymbol{\mathsf{A}}).

https://www.juicyiter.com/2018/05/23/pat1003a/

最短路径问题 路径短为首要选择。当最短路径相同时，选择人数多的路径。 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687

https://mengoreo.github.io/post/deep-learning-book-in-org-subtree-export/

Linear Algebra Basic Types Scalars: A scalar is just a single number, usually in lower-case variable names.

https://www.juicyiter.com/fjdifji

https://www.juicyiter.com/2018/07/26/csapp-2/

Information Storage A machine level program views memory as a large array of bytes, referred as virtual memory. Each byte of memory is defined by a unique number, known as its address, and the set of

https://www.juicyiter.com/2019/02/23/EPI-Python-4-1/

Problem The parity of a binary word is 1 is the number of 1s in the word is odd; otherwise, it is 0. For example the parity of 10111 is 0, and the parity of 1011 is 1. How would you calculate the par

https://www.juicyiter.com/2018/05/23/pat1005a/

类似格式化输出数字了 1234567891011121314151617181920212223242526272829#include <stdio.h>#include <string.h>#define maxSize 102void format(int n){ int i,count=0; char *numbers[]={"zero","on

http://blog.mengoreo.cn/post/vslam_ch4/

https://www.juicyiter.com/voices/

播客 The Philosopher's Stone 配音 寂静，如同地狱般的……

https://www.juicyiter.com/2018/07/26/CSAPP-Chapter-2/

Information Storage A machine level program views memory as a large array of bytes, referred as virtual memory. Each byte of memory is defined by a unique number, known as its address, and the set of

https://www.juicyiter.com/2018/05/23/pat1004a/

叶节点个数，我这里选择的广度搜索。 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162#include <stdio.h>#define maxSize 100typedef struct familyTre

http://blog.mengoreo.cn/post/learning_opencv/

Mat - The Basic Image Container Mat is basically a class with two data parts: the matrix header (containing information such as the size of the matrix, the method used for storing, at which address is the matrix stored …) and a pointer to the matrix data containing the pixe values. The matrix header size is constant, but the size of the matrix itself may vary.
OpenCV uses a reference counting system.

http://blog.mengoreo.cn/post/vslam_ch1/

个人拙见，如有错误，欢迎评论指出 🤗。

http://blog.mengoreo.cn/post/vslam_ch3/

个人拙见，如有错误，欢迎评论指出 🤗。

https://mengoreo.github.io/post/test/

test

https://mengoreo.github.io/post/cnn-in-org-subtree-export/

X’s and O’s Figure 1: Determining whether an image is an X or an O
To better understand how CNN works. Consider an simple example. In this example, CNN has one job. Each time we hand it a picture, it has to decide whether it has an X or an O. It assumes there is always one or another.
An naïve approach is solving it to save an image of an X and an O and compare every new image to the exemplars to see which is the better match.

https://mengoreo.github.io/post/rnn-lstm-in-org-subtree-export/

colah’s blog

https://www.juicyiter.com/2018/05/23/pat1006a/

找出最早进去的和最晚出来的。 1234567891011121314151617181920212223242526272829303132333435363738394041#include <stdio.h>#define maxSize 17struct record{ char id[17]; int starthour; int startmin; int star

https://www.juicyiter.com/2018/05/08/Hexo-pure/

如果你还没有入坑的话，请点击这里查看。 一番哔哔 这两天吐血熬夜搞了搞 「pure」 主题，网上一大片 「NexT」 的个性化配置教程，的确很美，但是不是我的风格，所以我只能耗费两天，凭着自己的 「推理」 ，自己搞下个性化。 因为学习前端的时候大约是一年前了，而且按时候学的也只是皮毛，所以现在只能靠着推理了。虽只是 「删」 「改」 「增」，但是并不知道作者制作主题时的逻辑结构，只能通过各个文件内的