The Classification of the Human Memories and their Relate Anatomy
References 이정모 (2009) 『인지과학:?학문 간 융합의 원리와 응용』.? 성균관대학교출판부. pp.443-450 이애영 (2013) 기억의 분류와 담당 뇌구조. 『2013년 대한신경과학회 제32차 학술대회 강의록』. pp.203-208
References 이정모 (2009) 『인지과학:?학문 간 융합의 원리와 응용』.? 성균관대학교출판부. pp.443-450 이애영 (2013) 기억의 분류와 담당 뇌구조. 『2013년 대한신경과학회 제32차 학술대회 강의록』. pp.203-208
Install Caffe on?Linux Ubuntu 16.04 My Configurations Linux: Ubuntu 16.04 LTS Anaconda: Anaconda 2 (64-bit),?Anaconda2-4.3.0-Linux-x86_64.sh CPU or GPU: CPU Install Caffe 1. Install CUDA 8 (Optional. I failed this installation.) Go to the CUDA download page(https://developer.nvidia.com/cuda-downloads). ‘ Go to the directory where the downloaded file cuda_8.0.44_linux.run?is located.
1 2 3 4 5 6 7 8 9 10 11 12 13 |
$ sudo sh cuda_8.0.44_linux.run ... Installing the NVIDIA display driver... It appears that an X server is running. Please exit X before installation. If you're sure that X is not running, but are getting this error, please delete any X lock files in /tmp. =========== = Summary = =========== Driver: Installation Failed Toolkit: Installation skipped Samples: Installation skipped $ |
I got an error. http://askubuntu.com/questions/149206/how-to-install-nvidia-run Hit CTRL+ALT+F1 […]
A heap is a data structure in the form of a balanced binary tree with a special constraint that will be introduced in the followings. In the tree, each node contains a key and two references to two child nodes. The key represents a value, which is normally an integer since every data type in […]
Kruskal’s Algorithm Approach: greedy approach Purpose: to find a minimum spanning tree in a weighted graph Example References Kruskal’s Algorithm | Essay Assignment | Seminar on Advanced Mathematics Spanning Tree | tutorialspoint Kruskal’s Spanning Tree Algorithm | tutorialspoint Prim’s Spanning Tree Algorithm | tutorialspoint
In practice, quicksort outperforms merge sort, and it significantly outperforms selection sort and insertion sort. The average-case running time of quicksort is as good as mergesort’s. That’s because?the constant factor hidden in the big-Θ notation for quicksort makes mergesort quite faster?than mergesort. Not using additional storage. pivot, split point Example References Overview of quicksort | […]
The Black-Scholes Equation $latex \frac{\partial V}{\partial t}+\frac{1}{2}\sigma^2 S^2 \frac{\partial^2 V}{\partial S^2}+rS\frac{\partial V}{\partial S}-rV=0 &s=3$ $latex S$: the price of the stock $latex V=V(S,t)$: the price of a derivative(e.g., option) $latex K$: the strike price of the option $latex r$: the annualized risk-free interest rate $latex \sigma$: the standard deviation of the stock’s return $latex […]
Installation Open the terminal. Ctrl+Alt+t Update apt-get program
1 |
sudo apt-get update |
enter the user password Yes-type ‘y’- to all the questions while the installation. Install Java JDK
1 |
sudo apt-get install openjdk-6-jdk |
(You can change jdk version by switching 6 to the version you want.) Yes-type ‘y’- to all the questions while the installation. Install Eclipse
1 |
sudo apt-get install eclipse |
Yes-type ‘y’- to all […]
The empty string, the empty list, the empty dictionary, the empty set, and zero all evaluate to False.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
bool('') # the empty string Out[1]: False bool('a non-empty string') # a non-emepty string Out[2]: True bool(list()) # the empty list Out[3]: False bool(['a non-empty list']) # a non-empty list Out[4]: True bool(dict()) # the empty dictionary Out[5]: False bool({'key':'value'}) # a non-empty dictionary Out[6]: True bool(set()) # the empty set Out[7]: False bool({'a non-empty set'}) # a non-empty set Out[8]: True bool(0) # zero Out[9]: False bool(1) # a non-zero Out[10]: True |
Diagram: Conversion Between Str and Bytes Conversion to String
1 2 3 4 5 6 7 8 |
def to_str(bytes_or_str): if isinstance(bytes_or_str, bytes): # bytes_or_str is bytes. value = bytes_or_str.decode('utf-8') else: # bytes_or_str is not bytes, but str. value = bytes_or_str return value |
1 2 3 4 5 6 |
>>> bytes_ex = b'This is a string.' >>> str_ex = 'This is a string' >>> to_str(bytes_ex) 'This is a string' >>> to_str(str_ex) 'This is a string' |
Conversion To Bytes
1 2 3 4 5 6 7 8 |
def to_bytes(bytes_or_str): if isinstance(bytes_or_str, str): # bytes_or_str is str. value = bytes_or_str.encode('utf-8') else: # bytes_or_str is not str, but bytes value = bytes_or_str return value |
1 2 3 4 5 6 |
>>> bytes_ex = b'This is a string.' >>> str_ex = 'This is a string' >>> to_bytes(bytes_ex) b'This is a string' >>> to_bytes(str_ex) b'This is a string' |
Write a?File in Write Binary Mode (‘wb’)
1 2 3 4 5 |
with open('binary.txt', 'wb') as f: f.write(to_bytes(str_ex)) with open('bytes.txt', 'wb') as f: f.write(to_bytes(bytes_ex)) |
Write a?File in Write Character?Mode (‘w’)
1 2 3 4 5 |
with open('str.txt', 'w') as f: f.write(to_str(str_ex)) with open('str.txt', 'w') as f: f.write(to_str(bytes_ex)) |