์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 | 30 |
- ์ค๋ ๋
- ํฐ์คํ ๋ฆฌ์ฑ๋ฆฐ์ง
- mariadb
- ์ค๋ธ์
- ๋ฐ์ดํฐ ์ ์ก
- ์ฃผ๊ธฐ์ ํธ
- ๋น์ฃผ๊ธฐ์ ํธ
- ํ๋ก์ด๋์์
- ์ค๋ฅ์ ์ด
- xv6
- i-type
- ์ค๋ฅ๊ฒ์ถ
- reducible
- ์์๋ฒํธ
- ํญํด99
- IEEE 802
- til
- ๊ฐ๋ฐ์์ทจ์
- git merge
- ์ฐ๋ถํฌdb
- ํ๋ ์ ๊ตฌ์กฐ
- leetcode
- tcp ์ธ๊ทธ๋จผํธ
- ์ฝ๋ฉํ ์คํธ์ค๋น
- well known ํฌํธ
- tcp ํ๋กํ ์ฝ
- 99ํด๋ฝ
- ์๋น์ค ํ๋ฆฌ๋ฏธํฐ๋ธ
- ๊ทธ๋ฆฌ๋ ์๊ณ ๋ฆฌ์ฆ
- ํ ํฐ ๋ฒ์ค
- Today
- Total
๋ชฉ๋ก๋ถ๋ฅ ์ ์ฒด๋ณด๊ธฐ (164)
Unfazedโ๏ธ๐ฏ
Limitations of the Simple Perceptron The primary limitation of a simple perceptron is its inability to handle data that isn't linearly separable. This means that if you can't draw a straight line (in two dimensions, or a hyper-plane in higher dimensions) to separate the classes, the perceptron won't be able to classify the data correctly. In the context of logical operations, a perceptron can mo..
Major Topics of NN NN or Neuron itself At its core, a neural network is comprised of nodes or "neurons", which are inspired by the biological neurons found in our brains. These artificial neurons receive inputs, process them (via weights and biases) and produce an output. Architectures FNN (Feedforward Neural Network): Data flows in one direction, from input to output. It consists of an input la..
ํ๋ก๊ทธ๋จ ๋์คํฌ์ ์ ์ฅ๋ ์คํ ๊ฐ๋ฅํ ์ฝ๋์ ์งํฉ ํ๋ก์ธ์ค ์คํ ์ค์ธ ํ๋ก๊ทธ๋จ์ ์ธ์คํด์ค๋ก, ์ด์ ์ฒด์ ๊ฐ ๊ด๋ฆฌํ๋ ์คํ ์ปจํ ์คํธ test.c๋ ์์ค ์ฝ๋ ํ์ผ ์ด ์์ค ์ฝ๋๋ฅผ ์ปดํ์ผํ์ฌ ์คํ ๊ฐ๋ฅํ ๋ฐ์ด๋๋ฆฌ(ํ๋ก๊ทธ๋จ)๋ฅผ ๋ง๋ ๋ค. ์ด ํ๋ก๊ทธ๋จ์ ์คํํ๋ฉด test๋ผ๋ ํ๋ก์ธ์ค๊ฐ ์์ฑ๋์ด ์คํ๋๋ค. test.c ์์ค ์ฝ๋ ๋ด์ a()๋ผ๋ ์์คํ ์ฝ์ด ์๋ค๊ณ ๊ฐ์ ํด๋ณด์. a()๋ testํ๋ก์ธ์ค ๋ด์์ ํธ์ถ๋๋ ์์คํ ์ฝ์ด๋ค. ๋ฐ๋ผ์ ๋ณ๋์ ํ๋ก์ธ์ค๋ก ์คํ๋๋ ๊ฒ์ด ์๋๋ค( a() ์์คํ ์ฝ์ด ์ข ๋ฃ๋ ๊ฒ์ด์ง testํ๋ก์ธ์ค๊ฐ ์ข ๋ฃ๋ ๊ฒ์ด ์๋, ํธ์ถ ๊ทธ๋ํ๋ฅผ ๊ทธ๋ฆฌ๋ ๊ณผ์ ์์ ์ด ๋ถ๋ถ์ ํผ๋ํ๊ณ ์์๋ค ). ํ์ฌ ์คํ ์ค์ธ test ํ๋ก์ธ์ค์ ์ปจํ ์คํธ์์ ์ปค๋ ๋ชจ๋๋ก ์ ํํ์ฌ a() ์์คํ ์ฝ์ด ์ฒ๋ฆฌ๋๋ค. (con..
In the vast realm of cryptography, two prominent heroes emerge: Asymmetric (Public-Key) and Symmetric encryption. Both come with their strengths and weaknesses. But when combined, they form a powerful duo, providing a robust and efficient security mechanism for our digital communications. Asymmetric and Symmetric Cryptography Asymmetric Cryptography Involves a pair of keys - a public key and a p..
๋ฉ์๋ ์ฐธ์กฐ -ํ๋์ ๋ฉ์๋๋ง ํธ์ถํ๋ ๋๋ค์์ '๋ฉ์๋ ์ฐธ์กฐ'๋ก ๋ ๊ฐ๋จํ ํ ์ ์๋ค. ์ข ๋ฅ ๋๋ค ๋ฉ์๋ ์ฐธ์กฐ static๋ฉ์๋ ์ฐธ์กฐ (x)-> ClassName.method(x) ClassName::method ์ธ์คํด์ค๋ฉ์๋ ์ฐธ์กฐ (obj.x)->obj.method(x) ClassName::method -static ๋ฉ์๋ ์ฐธ์กฐ Integer method(String s) { //Integer.parseInt(String s)๋ง ํธ์ถ return Integer.parseInt(s); } ๋๋ค์ Function f = (String s) -> Integer.parseInt(s); ๋ฉ์๋ ์ฐธ์กฐ Function f = (String s) -> Integer::parseInt(s); -์์ฑ์์ ๋ฉ์๋ ์ฐธ์กฐ..

ํจ์ํ ์ธํฐํ์ด์ค๋ฅผ ์ฌ์ฉํ๋ ์ปฌ๋ ์ ํ๋ ์์์ ๋ฉ์๋ ์ธํฐํ์ด์ค ๋ฉ์๋ ์ค๋ช Collection boolean removelf(Predicate filter) ์กฐ๊ฑด์ ๋ง๋ ์์๋ฅผ ์ญ์ List void replaceAll(UnaryOperator operator) ๋ชจ๋ ์์๋ฅผ ๋ณํํ์ฌ ๋์ฒด Iterable void forEach(Consumer action) ๋ชจ๋ ์์์ ์์ action์ ์ํ Map V compute(K key, BiFunction f) ์ง์ ๋ ํค์ ๊ฐ์ ์์ f๋ฅผ ์ํ V computeIfAbsent(K key, Function f) ํค๊ฐ ์์ผ๋ฉด, ์์ f ์ํ ํ ์ถ๊ฐ V computeIfPresent(K key, Bifunction f) ์ง์ ๋ ํค๊ฐ ์์ ๋ ์์ f ์ํ V m..
Predicate์ ๊ฒฐํฉ -and(), or(), negate()๋ก ๋ Predicate๋ฅผ ํ๋๋ก ๊ฒฐํฉ(default ๋ฉ์๋) Predicate p = i -> i i i%2 == 0; Predicate notP =p.negate(); // i >= 100 Predicate all = notP.and(q).or(r); // 100 Integer.toBinaryString(i); Function h = f.andThen(g); Function h2 = f.compose(g); System.out.println(h.apply("FF")); //"FF" -> 255 -> "11111111" System.out.prin..
java.util.function ํจํค์ง - ์์ฃผ ์ฌ์ฉ๋๋ ๋ค์ํ ํจ์ํ ์ธํฐํ์ด์ค๋ฅผ ์ ๊ณต 1) java.lang.Runnable // java.util.function ํจํค์ง๋ ์๋ void run() : ๋งค๊ฐ๋ณ์๋ ์๊ณ , ๋ฐํ๊ฐ๋ ์์ public class MyRunnable implements Runnable { @Override public void run() { System.out.println("This is running in a thread."); } public static void main(String[] args) { Thread thread = new Thread(new MyRunnable()); thread.start(); // This will invoke the run() m..
๋ง์ (A+B)%C=(A%C+B%C)%C ex) (20+6)%3=26%3=2 (20%3+6%3)%3=(2+0)%3=2 ๋ปด์ (A-B)%C=(A%C-B%C)%C ex) (20-6)%3=14%3=2 (20%3-6%3)%3=(2-0)%3=2 ๊ณฑ์ (A*B)%C=(A%C)*(B%C)%C ex) (20*6)%3=120%3=0 (20%3)*(6%3)%3=(2*0)%3=0 ๋๋์ (A/B)%C != (A%C)/(B%C)%C => ์ฑ๋ฆฝํ์ง ์์ ex) (20/6)%3=3%3=0 (20%3)/(6%3)%3=(2/0)%3=>๋ถ๋ชจ 0 X MOD ์ฐ์ฐ์ ๋ง์ , ๋ปด์ , ๊ณฑ์ ์ ๋ํด์ ๋ถ๋ฐฐ ๋ฒ์น์ด ์ฑ๋ฆฝํ๋ค. =>์ฆ, ์ ๋ต์ ๊ตฌํ ๋ค % ์ฐ์ฐ์ ํ๋ ๊ฒ์ด ์๋, ๊ฐ ๋จ๊ณ๋ง๋ค %์ฐ์ฐ์ ํ๋ฉด์ ๋ฌธ์ ๋ฅผ ํ๋๋ก ํ์. ๋ฐฑ์ค 11051๋ฒ ..
In the MIPS instruction set architecture, the immediate value in I-format instructions is typically considered a signed 16-bit number. This means that the immediate value can range from ๋๋ถ๋ถ์ I-format ๋ช ๋ น์ด๋ค์ imm ๊ฐ์ ์๋์ ๊ฐ์ signed 16-bit number์ด๋ค. (-2^15) ~ (2^15-1) or -32,768 to 32,767 in decimal notation. For certain instructions, like addi, the immediate value is treated as a two's complement s..