num
int64
0
1M
english
stringlengths
25
5.51k
korean
stringlengths
1
2.85k
text
stringlengths
61
8.37k
24,900
The size of the nodes is defined by the betweenness centrality.
λ…Έλ“œμ˜ ν¬κΈ°λŠ” 맀개 쀑심성에 μ˜ν•΄ μ •μ˜λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œμ˜ ν¬κΈ°λŠ” 맀개 쀑심성에 μ˜ν•΄ μ •μ˜λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: The size of the nodes is defined by the betweenness centrality.</끝>
24,901
In Bluetooth mesh networks nodes are created differently.
λΈ”λ£¨νˆ¬μŠ€ λ©”μ‹œ λ„€νŠΈμ›Œν¬μ—μ„œλŠ” λ…Έλ“œκ°€ μƒμ„±λ˜λŠ” 방법이 각기 λ‹€λ₯΄λ‹€.
### ν•œκ΅­μ–΄: λΈ”λ£¨νˆ¬μŠ€ λ©”μ‹œ λ„€νŠΈμ›Œν¬μ—μ„œλŠ” λ…Έλ“œκ°€ μƒμ„±λ˜λŠ” 방법이 각기 λ‹€λ₯΄λ‹€.</끝> ### μ˜μ–΄: In Bluetooth mesh networks nodes are created differently.</끝>
24,902
The nodes and weighted paths give an output based on the input.
λ…Έλ“œ 및 가쀑 κ²½λ‘œλŠ” μž…λ ₯에 κΈ°μ΄ˆν•˜μ—¬ 좜λ ₯을 μ œκ³΅ν•œλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œ 및 가쀑 κ²½λ‘œλŠ” μž…λ ₯에 κΈ°μ΄ˆν•˜μ—¬ 좜λ ₯을 μ œκ³΅ν•œλ‹€.</끝> ### μ˜μ–΄: The nodes and weighted paths give an output based on the input.</끝>
24,903
The synchronized network includes the node and additional nodes.
λ™κΈ°ν™”λœ λ„€νŠΈμ›Œν¬λŠ” λ…Έλ“œ 및 μΆ”κ°€ λ…Έλ“œλ“€μ„ ν¬ν•¨ν•œλ‹€.
### ν•œκ΅­μ–΄: λ™κΈ°ν™”λœ λ„€νŠΈμ›Œν¬λŠ” λ…Έλ“œ 및 μΆ”κ°€ λ…Έλ“œλ“€μ„ ν¬ν•¨ν•œλ‹€.</끝> ### μ˜μ–΄: The synchronized network includes the node and additional nodes.</끝>
24,904
As discussed previously nodes are more than just simple points.
이전에 λ…Όμ˜λœ κ²ƒμ²˜λŸΌ λ…Έλ“œλŠ” λ‹¨μˆœν•œ ν¬μΈνŠΈκ°€ μ•„λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 이전에 λ…Όμ˜λœ κ²ƒμ²˜λŸΌ λ…Έλ“œλŠ” λ‹¨μˆœν•œ ν¬μΈνŠΈκ°€ μ•„λ‹ˆλ‹€.</끝> ### μ˜μ–΄: As discussed previously nodes are more than just simple points.</끝>
24,905
Worker nodes are responsible for data storing and task execution.
μž‘μ—…μž λ…Έλ“œλŠ” 데이터 μ €μž₯ 및 μž‘μ—… 싀행을 λ‹΄λ‹Ήν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μž‘μ—…μž λ…Έλ“œλŠ” 데이터 μ €μž₯ 및 μž‘μ—… 싀행을 λ‹΄λ‹Ήν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Worker nodes are responsible for data storing and task execution.</끝>
24,906
The program is made of tangled layers of interconnected nodes.
이 ν”„λ‘œκ·Έλž¨μ€ μ„œλ‘œ μ—°κ²°λœ λ…Έλ“œμ˜ λ³΅μž‘ν•œ λ ˆμ΄μ–΄λ‘œ κ΅¬μ„±λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 이 ν”„λ‘œκ·Έλž¨μ€ μ„œλ‘œ μ—°κ²°λœ λ…Έλ“œμ˜ λ³΅μž‘ν•œ λ ˆμ΄μ–΄λ‘œ κ΅¬μ„±λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: The program is made of tangled layers of interconnected nodes.</끝>
24,907
This is a large number of connections compared to the number of nodes.
μ΄λŠ” λ…Έλ“œ μˆ˜μ— λΉ„ν•΄ λ§Žμ€ 수의 연결이닀.
### ν•œκ΅­μ–΄: μ΄λŠ” λ…Έλ“œ μˆ˜μ— λΉ„ν•΄ λ§Žμ€ 수의 연결이닀.</끝> ### μ˜μ–΄: This is a large number of connections compared to the number of nodes.</끝>
24,908
Each of the blockchain nodes maintains the same blockchain data.
각각의 블둝체인 λ…Έλ“œλŠ” λ™μΌν•œ 블둝체인 데이터λ₯Ό μœ μ§€ν•œλ‹€.
### ν•œκ΅­μ–΄: 각각의 블둝체인 λ…Έλ“œλŠ” λ™μΌν•œ 블둝체인 데이터λ₯Ό μœ μ§€ν•œλ‹€.</끝> ### μ˜μ–΄: Each of the blockchain nodes maintains the same blockchain data.</끝>
24,909
A tree is a hierarchical data structure with zero or more nodes.
νŠΈλ¦¬λŠ” 0개 μ΄μƒμ˜ λ…Έλ“œλ₯Ό κ°€μ§€κ³  μžˆλŠ” 계측적 데이터 ꡬ쑰닀.
### ν•œκ΅­μ–΄: νŠΈλ¦¬λŠ” 0개 μ΄μƒμ˜ λ…Έλ“œλ₯Ό κ°€μ§€κ³  μžˆλŠ” 계측적 데이터 ꡬ쑰닀.</끝> ### μ˜μ–΄: A tree is a hierarchical data structure with zero or more nodes.</끝>
24,910
The vehicle network may include a very large number of end nodes.
μ°¨λŸ‰ λ„€νŠΈμ›Œν¬λŠ” 맀우 λ§Žμ€ 수의 μ—”λ“œ λ…Έλ“œλ“€μ„ 포함할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μ°¨λŸ‰ λ„€νŠΈμ›Œν¬λŠ” 맀우 λ§Žμ€ 수의 μ—”λ“œ λ…Έλ“œλ“€μ„ 포함할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The vehicle network may include a very large number of end nodes.</끝>
24,911
A scene graph is a collection of nodes in a graph or tree structure.
μž₯λ©΄ κ·Έλž˜ν”„λŠ” κ·Έλž˜ν”„ λ˜λŠ” 트리 ꡬ쑰의 λ…Έλ“œ 집합이닀.
### ν•œκ΅­μ–΄: μž₯λ©΄ κ·Έλž˜ν”„λŠ” κ·Έλž˜ν”„ λ˜λŠ” 트리 ꡬ쑰의 λ…Έλ“œ 집합이닀.</끝> ### μ˜μ–΄: A scene graph is a collection of nodes in a graph or tree structure.</끝>
24,912
They are the nodes on the string patterns and relationships 27 37.
그것은 끈의 λ¬΄λŠ¬μ™€ μ—°κ΄€μ„±μ˜ λ§€λ“­μœΌλ‘œ 27κ³Ό 37이닀.
### ν•œκ΅­μ–΄: 그것은 끈의 λ¬΄λŠ¬μ™€ μ—°κ΄€μ„±μ˜ λ§€λ“­μœΌλ‘œ 27κ³Ό 37이닀.</끝> ### μ˜μ–΄: They are the nodes on the string patterns and relationships 27 37.</끝>
24,913
The crossing or adjacent locations can be referred to as touch nodes.
ꡐ차 λ˜λŠ” μΈμ ‘ν•œ μœ„μΉ˜λ“€μ€ ν„°μΉ˜ λ…Έλ“œλ“€λ‘œ 지칭될 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: ꡐ차 λ˜λŠ” μΈμ ‘ν•œ μœ„μΉ˜λ“€μ€ ν„°μΉ˜ λ…Έλ“œλ“€λ‘œ 지칭될 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The crossing or adjacent locations can be referred to as touch nodes.</끝>
24,914
The calculation graph may include a set of nodes and directed edges.
계산 κ·Έλž˜ν”„λŠ” λ…Έλ“œ 및 μ§€ν–₯된 μ—μ§€μ˜ 집합을 포함할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 계산 κ·Έλž˜ν”„λŠ” λ…Έλ“œ 및 μ§€ν–₯된 μ—μ§€μ˜ 집합을 포함할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The calculation graph may include a set of nodes and directed edges.</끝>
24,915
Yet BioDT can run on many nodes to process data even faster.
κ·ΈλŸ¬λ‚˜ λ°”μ΄μ˜€λ””ν‹°λŠ” λ§Žμ€ λ…Έλ“œμ—μ„œ μ‹€ν–‰λ˜μ–΄ 데이터λ₯Ό 더 μ‹ μ†ν•˜κ²Œ μ²˜λ¦¬ν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: κ·ΈλŸ¬λ‚˜ λ°”μ΄μ˜€λ””ν‹°λŠ” λ§Žμ€ λ…Έλ“œμ—μ„œ μ‹€ν–‰λ˜μ–΄ 데이터λ₯Ό 더 μ‹ μ†ν•˜κ²Œ μ²˜λ¦¬ν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: Yet BioDT can run on many nodes to process data even faster.</끝>
24,916
The nodes can relay the location request to the target mobile device.
λ…Έλ“œλ“€μ€ μœ„μΉ˜ μš”μ²­μ„ νƒ€κ²Ÿ λͺ¨λ°”일 λ””λ°”μ΄μŠ€μ— 쀑계할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œλ“€μ€ μœ„μΉ˜ μš”μ²­μ„ νƒ€κ²Ÿ λͺ¨λ°”일 λ””λ°”μ΄μŠ€μ— 쀑계할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The nodes can relay the location request to the target mobile device.</끝>
24,917
Touch nodes can be formed at the intersections of the rows and columns.
ν–‰λ“€κ³Ό μ—΄λ“€μ˜ ꡐ차점듀에 ν„°μΉ˜ λ…Έλ“œλ“€μ΄ ν˜•μ„±λ  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: ν–‰λ“€κ³Ό μ—΄λ“€μ˜ ꡐ차점듀에 ν„°μΉ˜ λ…Έλ“œλ“€μ΄ ν˜•μ„±λ  수 μžˆλ‹€.</끝> ### μ˜μ–΄: Touch nodes can be formed at the intersections of the rows and columns.</끝>
24,918
So the computer only look at a certain number of nodes and then stops.
κ·Έλž˜μ„œ μ»΄ν“¨ν„°λŠ” 단지 νŠΉμ • 수의 λ…Έλ“œλ₯Ό 보고 λ‚˜μ„œ λ©ˆμΆ˜λ‹€.
### ν•œκ΅­μ–΄: κ·Έλž˜μ„œ μ»΄ν“¨ν„°λŠ” 단지 νŠΉμ • 수의 λ…Έλ“œλ₯Ό 보고 λ‚˜μ„œ λ©ˆμΆ˜λ‹€.</끝> ### μ˜μ–΄: So the computer only look at a certain number of nodes and then stops.</끝>
24,919
The touch nodes can be formed on a single side of a transparent substrate.
ν„°μΉ˜ λ…Έλ“œλ“€μ€ 투λͺ… 기판의 일면에 ν˜•μ„±λ  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: ν„°μΉ˜ λ…Έλ“œλ“€μ€ 투λͺ… 기판의 일면에 ν˜•μ„±λ  수 μžˆλ‹€.</끝> ### μ˜μ–΄: The touch nodes can be formed on a single side of a transparent substrate.</끝>
24,920
It is the duration of the highlight box when selecting accessible nodes.
μ ‘κ·Ό κ°€λŠ₯ λ…Έλ“œ 선택 μ‹œ ν•˜μ΄λΌμ΄νŠΈ λ°•μŠ€μ˜ 지속 μ‹œκ°„μ΄λ‹€.
### ν•œκ΅­μ–΄: μ ‘κ·Ό κ°€λŠ₯ λ…Έλ“œ 선택 μ‹œ ν•˜μ΄λΌμ΄νŠΈ λ°•μŠ€μ˜ 지속 μ‹œκ°„μ΄λ‹€.</끝> ### μ˜μ–΄: It is the duration of the highlight box when selecting accessible nodes.</끝>
24,921
Both types of nodes are dedicated short-range communicationsdevices.
두 μœ ν˜•μ˜ 극점은 λͺ¨λ‘ 단거리 μ „μš© 톡신 DSRC μž₯μΉ˜μ΄λ‹€.
### ν•œκ΅­μ–΄: 두 μœ ν˜•μ˜ 극점은 λͺ¨λ‘ 단거리 μ „μš© 톡신 DSRC μž₯μΉ˜μ΄λ‹€.</끝> ### μ˜μ–΄: Both types of nodes are dedicated short-range communicationsdevices.</끝>
24,922
In the worst case splitting of nodes could exponentiate the total number of nodes represented by all the regions.
μ΅œμ•…μ˜ 경우 λ…Έλ“œ 뢄할이 λͺ¨λ“  지역을 λ‚˜νƒ€λ‚΄λŠ” λ…Έλ“œμ˜ 전체 개수λ₯Ό κΈ°ν•˜κΈ‰μˆ˜μ μœΌλ‘œ μ¦κ°€μ‹œν‚¬ 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μ΅œμ•…μ˜ 경우 λ…Έλ“œ 뢄할이 λͺ¨λ“  지역을 λ‚˜νƒ€λ‚΄λŠ” λ…Έλ“œμ˜ 전체 개수λ₯Ό κΈ°ν•˜κΈ‰μˆ˜μ μœΌλ‘œ μ¦κ°€μ‹œν‚¬ 수 μžˆλ‹€.</끝> ### μ˜μ–΄: In the worst case splitting of nodes could exponentiate the total number of nodes represented by all the regions.</끝>
24,923
The end node of each lattice connects to frame nodes of the last frame.
각 격자의 μ—”λ“œ λ…Έλ“œλŠ” λ§ˆμ§€λ§‰ ν”„λ ˆμž„μ˜ ν”„λ ˆμž„ λ…Έλ“œλ“€μ— μ ‘μ†ν•œλ‹€.
### ν•œκ΅­μ–΄: 각 격자의 μ—”λ“œ λ…Έλ“œλŠ” λ§ˆμ§€λ§‰ ν”„λ ˆμž„μ˜ ν”„λ ˆμž„ λ…Έλ“œλ“€μ— μ ‘μ†ν•œλ‹€.</끝> ### μ˜μ–΄: The end node of each lattice connects to frame nodes of the last frame.</끝>
24,924
Fully connectivity refers to each node being connected to all other nodes.
λ‹€λ₯Έ λͺ¨λ“  λ…Έλ“œμ— μ—°κ²°λœ 각 λ…Έλ“œλ₯Ό μ°Έμ‘°ν•˜λŠ” μ™„μ „ μ—°κ²°μž…λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λ‹€λ₯Έ λͺ¨λ“  λ…Έλ“œμ— μ—°κ²°λœ 각 λ…Έλ“œλ₯Ό μ°Έμ‘°ν•˜λŠ” μ™„μ „ μ—°κ²°μž…λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Fully connectivity refers to each node being connected to all other nodes.</끝>
24,925
The number of broker nodes is determined in part by the application type.
브둜컀 λ…Έλ“œμ˜ μˆ˜λŠ” λΆ€λΆ„μ μœΌλ‘œ μ‘μš©ν”„λ‘œκ·Έλž¨ μœ ν˜•μ— 따라 κ²°μ •λœλ‹€.
### ν•œκ΅­μ–΄: 브둜컀 λ…Έλ“œμ˜ μˆ˜λŠ” λΆ€λΆ„μ μœΌλ‘œ μ‘μš©ν”„λ‘œκ·Έλž¨ μœ ν˜•μ— 따라 κ²°μ •λœλ‹€.</끝> ### μ˜μ–΄: The number of broker nodes is determined in part by the application type.</끝>
24,926
A plurality of leaf nodes of a tree may include at least one primitive.
트리의 볡수의 리프 λ…Έλ“œλ“€μ€ 적어도 ν•˜λ‚˜μ˜ ν”„λ¦¬λ―Έν‹°λΈŒλ₯Ό 포함할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 트리의 볡수의 리프 λ…Έλ“œλ“€μ€ 적어도 ν•˜λ‚˜μ˜ ν”„λ¦¬λ―Έν‹°λΈŒλ₯Ό 포함할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: A plurality of leaf nodes of a tree may include at least one primitive.</끝>
24,927
Nodes in the output provide the transformed input to the requesting process.
좜λ ₯ λ‚΄μ˜ λ…Έλ“œλ“€μ€ λ³€ν™˜λœ μž…λ ₯을 μš”μ²­ ν”„λ‘œμ„ΈμŠ€μ— μ œκ³΅ν•œλ‹€.
### ν•œκ΅­μ–΄: 좜λ ₯ λ‚΄μ˜ λ…Έλ“œλ“€μ€ λ³€ν™˜λœ μž…λ ₯을 μš”μ²­ ν”„λ‘œμ„ΈμŠ€μ— μ œκ³΅ν•œλ‹€.</끝> ### μ˜μ–΄: Nodes in the output provide the transformed input to the requesting process.</끝>
24,928
Unless you have a ring that is anything but four nodes its not a hypercube.
λ„€κ°€ 4ꡐ점 링을 μ§€λ‹Œ 게 μ•„λ‹ˆλΌλ©΄ 그건 ν•˜μ΄νΌνλΈŒκ°€ μ•„λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λ„€κ°€ 4ꡐ점 링을 μ§€λ‹Œ 게 μ•„λ‹ˆλΌλ©΄ 그건 ν•˜μ΄νΌνλΈŒκ°€ μ•„λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Unless you have a ring that is anything but four nodes its not a hypercube.</끝>
24,929
The intermediate signal is used to generate values on the two output nodes.
쀑간 μ‹ ν˜ΈλŠ” 2개의 좜λ ₯ λ…Έλ“œλ“€ μƒμ—μ„œ 값듀을 μƒμ„±ν•˜λŠ”λ° μ‚¬μš©λœλ‹€.
### ν•œκ΅­μ–΄: 쀑간 μ‹ ν˜ΈλŠ” 2개의 좜λ ₯ λ…Έλ“œλ“€ μƒμ—μ„œ 값듀을 μƒμ„±ν•˜λŠ”λ° μ‚¬μš©λœλ‹€.</끝> ### μ˜μ–΄: The intermediate signal is used to generate values on the two output nodes.</끝>
24,930
This can include summing the proximity values of one or more touch nodes.
μ΄λŠ” ν•˜λ‚˜ μ΄μƒμ˜ ν„°μΉ˜ λ…Έλ“œλ“€μ˜ 근접값듀을 ν•©μ‚°ν•˜λŠ” 것을 포함할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μ΄λŠ” ν•˜λ‚˜ μ΄μƒμ˜ ν„°μΉ˜ λ…Έλ“œλ“€μ˜ 근접값듀을 ν•©μ‚°ν•˜λŠ” 것을 포함할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: This can include summing the proximity values of one or more touch nodes.</끝>
24,931
Information related to the plurality of notification nodes can also be acquired.
볡수의 톡지 λ…Έλ“œλ“€μ— κ΄€λ ¨λœ 정보가 λ˜ν•œ νšλ“λ  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 볡수의 톡지 λ…Έλ“œλ“€μ— κ΄€λ ¨λœ 정보가 λ˜ν•œ νšλ“λ  수 μžˆλ‹€.</끝> ### μ˜μ–΄: Information related to the plurality of notification nodes can also be acquired.</끝>
24,932
This can be considered as branching out from one node to the other two nodes.
μ΄λŠ” 첫 λ…Έλ“œμ—μ„œ λ‹€λ₯Έ 두 λ…Έλ“œλ‘œ ν™•μž₯ν•˜λŠ” κ²ƒμœΌλ‘œ 생각할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μ΄λŠ” 첫 λ…Έλ“œμ—μ„œ λ‹€λ₯Έ 두 λ…Έλ“œλ‘œ ν™•μž₯ν•˜λŠ” κ²ƒμœΌλ‘œ 생각할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: This can be considered as branching out from one node to the other two nodes.</끝>
24,933
This is a machine learning framework developed to expand to multiple nodes.
이것은 볡수의 λ…Έλ“œλ‘œ ν™•μž₯ν•  수 μžˆλ„λ‘ 개발된 λ¨Έμ‹ λŸ¬λ‹ ν”„λ ˆμž„μ›Œν¬λ‹€.
### ν•œκ΅­μ–΄: 이것은 볡수의 λ…Έλ“œλ‘œ ν™•μž₯ν•  수 μžˆλ„λ‘ 개발된 λ¨Έμ‹ λŸ¬λ‹ ν”„λ ˆμž„μ›Œν¬λ‹€.</끝> ### μ˜μ–΄: This is a machine learning framework developed to expand to multiple nodes.</끝>
24,934
The different component nodes of thinking are co-dependent and co-created.
μ‚¬κ³ μ˜ μ„œλ‘œ λ‹€λ₯Έ κ΅¬μ„±μš”μ†Œ λ…Έλ“œλŠ” μƒν˜Έ 의쑴적이며 κ³΅λ™μœΌλ‘œ μƒμ„±λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μ‚¬κ³ μ˜ μ„œλ‘œ λ‹€λ₯Έ κ΅¬μ„±μš”μ†Œ λ…Έλ“œλŠ” μƒν˜Έ 의쑴적이며 κ³΅λ™μœΌλ‘œ μƒμ„±λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: The different component nodes of thinking are co-dependent and co-created.</끝>
24,935
These nodes may then be used for comparing with the received biometric data.
이 λ…Έλ“œλ“€μ€ κ·Έ ν›„ μˆ˜μ‹ λœ 생체 데이터와 λΉ„κ΅ν•˜κΈ° μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 이 λ…Έλ“œλ“€μ€ κ·Έ ν›„ μˆ˜μ‹ λœ 생체 데이터와 λΉ„κ΅ν•˜κΈ° μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€.</끝> ### μ˜μ–΄: These nodes may then be used for comparing with the received biometric data.</끝>
24,936
Recursively copies all the nodes from the source node to the destination node.
μ›μ²œλ…Έλ“œλΆ€ν„° λͺ©μ μ§€ λ…Έλ“œκΉŒμ§€ λͺ¨λ“  λ…Έλ“œλ₯Ό 반볡적으둜 λ³΅μ‚¬ν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μ›μ²œλ…Έλ“œλΆ€ν„° λͺ©μ μ§€ λ…Έλ“œκΉŒμ§€ λͺ¨λ“  λ…Έλ“œλ₯Ό 반볡적으둜 λ³΅μ‚¬ν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Recursively copies all the nodes from the source node to the destination node.</끝>
24,937
Each of the plurality of grand-master nodes may have a different priority.
상기 볡수의 κ·Έλžœλ“œ λ§ˆμŠ€ν„° λ…Έλ“œλ“€ 각각은 μ„œλ‘œ λ‹€λ₯Έ μš°μ„ μˆœμœ„λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 상기 볡수의 κ·Έλžœλ“œ λ§ˆμŠ€ν„° λ…Έλ“œλ“€ 각각은 μ„œλ‘œ λ‹€λ₯Έ μš°μ„ μˆœμœ„λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.</끝> ### μ˜μ–΄: Each of the plurality of grand-master nodes may have a different priority.</끝>
24,938
The nodes may be combined and serviced by common components at the headend.
λ…Έλ“œλ“€μ€ ν—€λ“œμ—”λ“œμ—μ„œμ˜ 곡톡 μ»΄ν¬λ„ŒνŠΈλ“€μ— μ˜ν•΄ κ²°ν•© 및 μ„œλΉ„μŠ€λ  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œλ“€μ€ ν—€λ“œμ—”λ“œμ—μ„œμ˜ 곡톡 μ»΄ν¬λ„ŒνŠΈλ“€μ— μ˜ν•΄ κ²°ν•© 및 μ„œλΉ„μŠ€λ  수 μžˆλ‹€.</끝> ### μ˜μ–΄: The nodes may be combined and serviced by common components at the headend.</끝>
24,939
In order to deal with these unlimited nodes distributed management is important.
이 λ¬΄μ œν•œ λ…Έλ“œλ“€μ„ 닀루기 μœ„ν•΄μ„œλŠ” λΆ„μ‚° 관리가 μ€‘μš”ν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 이 λ¬΄μ œν•œ λ…Έλ“œλ“€μ„ 닀루기 μœ„ν•΄μ„œλŠ” λΆ„μ‚° 관리가 μ€‘μš”ν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: In order to deal with these unlimited nodes distributed management is important.</끝>
24,940
Then the multiple nodes output gets merged to generate the final result data.
그런 λ‹€μŒ 닀쀑 λ…Έλ“œμ˜ 좜λ ₯이 λ³‘ν•©λ˜μ–΄ μ΅œμ’… κ²°κ³Ό 데이터가 μƒμ„±λœλ‹€.
### ν•œκ΅­μ–΄: 그런 λ‹€μŒ 닀쀑 λ…Έλ“œμ˜ 좜λ ₯이 λ³‘ν•©λ˜μ–΄ μ΅œμ’… κ²°κ³Ό 데이터가 μƒμ„±λœλ‹€.</끝> ### μ˜μ–΄: Then the multiple nodes output gets merged to generate the final result data.</끝>
24,941
The list could not be found because no search nodes were assigned in company B.
Bμ‚¬μ—λŠ” 검색 λ…Έλ“œλ₯Ό ν• λ‹Ήν•˜μ§€ μ•Šμ•˜κΈ° λ•Œλ¬Έμ— λͺ©λ‘μ„ 찾을 수 μ—†μ—ˆλ‹€.
### ν•œκ΅­μ–΄: Bμ‚¬μ—λŠ” 검색 λ…Έλ“œλ₯Ό ν• λ‹Ήν•˜μ§€ μ•Šμ•˜κΈ° λ•Œλ¬Έμ— λͺ©λ‘μ„ 찾을 수 μ—†μ—ˆλ‹€.</끝> ### μ˜μ–΄: The list could not be found because no search nodes were assigned in company B.</끝>
24,942
The first data center node may be included in a plurality of data center nodes.
제1 데이터 μ„Όν„° λ…Έλ“œλŠ” 볡수의 데이터 μ„Όν„° λ…Έλ“œλ“€μ— 포함될 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 제1 데이터 μ„Όν„° λ…Έλ“œλŠ” 볡수의 데이터 μ„Όν„° λ…Έλ“œλ“€μ— 포함될 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The first data center node may be included in a plurality of data center nodes.</끝>
24,943
Each of the neural network layers includes one or more neural network nodes.
λ‰΄λŸ΄ λ„€νŠΈμ›Œν¬ 계측듀 각각은 ν•˜λ‚˜ μ΄μƒμ˜ λ‰΄λŸ΄ λ„€νŠΈμ›Œν¬ λ…Έλ“œλ“€μ„ ν¬ν•¨ν•œλ‹€.
### ν•œκ΅­μ–΄: λ‰΄λŸ΄ λ„€νŠΈμ›Œν¬ 계측듀 각각은 ν•˜λ‚˜ μ΄μƒμ˜ λ‰΄λŸ΄ λ„€νŠΈμ›Œν¬ λ…Έλ“œλ“€μ„ ν¬ν•¨ν•œλ‹€.</끝> ### μ˜μ–΄: Each of the neural network layers includes one or more neural network nodes.</끝>
24,944
It learns by rearranging connections between nodes after each new experience.
그것은 μƒˆλ‘œμš΄ κ²½ν—˜μ΄ μžˆμ„ λ•Œλ§ˆλ‹€ λ…Έλ“œ κ°„μ˜ 연결을 μž¬λ°°μΉ˜ν•˜μ—¬ ν•™μŠ΅ν•œλ‹€.
### ν•œκ΅­μ–΄: 그것은 μƒˆλ‘œμš΄ κ²½ν—˜μ΄ μžˆμ„ λ•Œλ§ˆλ‹€ λ…Έλ“œ κ°„μ˜ 연결을 μž¬λ°°μΉ˜ν•˜μ—¬ ν•™μŠ΅ν•œλ‹€.</끝> ### μ˜μ–΄: It learns by rearranging connections between nodes after each new experience.</끝>
24,945
The software had only one layer of neuron-like nodes which proved limited.
μ†Œν”„νŠΈμ›¨μ–΄κ°€ λ‰΄λŸ°κ³Ό 같은 λ…Έλ“œλ‘œ κ΅¬μ„±λœ 계측이 ν•˜λ‚˜λ°–μ— μ—†μœΌλ―€λ‘œ μ œν•œμ μ΄μ—ˆλ‹€.
### ν•œκ΅­μ–΄: μ†Œν”„νŠΈμ›¨μ–΄κ°€ λ‰΄λŸ°κ³Ό 같은 λ…Έλ“œλ‘œ κ΅¬μ„±λœ 계측이 ν•˜λ‚˜λ°–μ— μ—†μœΌλ―€λ‘œ μ œν•œμ μ΄μ—ˆλ‹€.</끝> ### μ˜μ–΄: The software had only one layer of neuron-like nodes which proved limited.</끝>
24,946
The retention nodes may extend from opposite walls of the housing into the recess.
μœ μ§€ λ…Έλ“œλŠ” ν•˜μš°μ§•μ˜ λŒ€ν–₯λ²½μœΌλ‘œλΆ€ν„° λ¦¬μ„ΈμŠ€ λ‚΄λ‘œ μ—°μž₯될 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μœ μ§€ λ…Έλ“œλŠ” ν•˜μš°μ§•μ˜ λŒ€ν–₯λ²½μœΌλ‘œλΆ€ν„° λ¦¬μ„ΈμŠ€ λ‚΄λ‘œ μ—°μž₯될 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The retention nodes may extend from opposite walls of the housing into the recess.</끝>
24,947
IPFS data storage requires storage space for nodes connected to the network.
IPFS 데이터 μŠ€ν† λ¦¬μ§€κ°€ μž‘λ™ν•˜λ €λ©΄ λ„€νŠΈμ›Œν¬μ— μ—°κ²°λœ λ…Έλ“œμ˜ μ €μž₯곡간이 ν•„μš”ν•˜λ‹€.
### ν•œκ΅­μ–΄: IPFS 데이터 μŠ€ν† λ¦¬μ§€κ°€ μž‘λ™ν•˜λ €λ©΄ λ„€νŠΈμ›Œν¬μ— μ—°κ²°λœ λ…Έλ“œμ˜ μ €μž₯곡간이 ν•„μš”ν•˜λ‹€.</끝> ### μ˜μ–΄: IPFS data storage requires storage space for nodes connected to the network.</끝>
24,948
The chief technology officer at Company A said that at least four nodes are needed.
Aμ‚¬μ˜ 졜고기술 μ±…μž„μžλŠ” 적어도 λ„€ 개의 λ…Έλ“œκ°€ ν•„μš”ν•˜λ‹€κ³  λ§ν–ˆλ‹€.
### ν•œκ΅­μ–΄: Aμ‚¬μ˜ 졜고기술 μ±…μž„μžλŠ” 적어도 λ„€ 개의 λ…Έλ“œκ°€ ν•„μš”ν•˜λ‹€κ³  λ§ν–ˆλ‹€.</끝> ### μ˜μ–΄: The chief technology officer at Company A said that at least four nodes are needed.</끝>
24,949
A plug-in may also implement its traversal through the preference tree nodes.
ν”ŒλŸ¬κ·ΈμΈμ€ μ„ ν˜Έ 트리 λ…Έλ“œλ₯Ό 톡해 κ·Έκ²ƒμ˜ 자체 순회 μˆœμ„œλ₯Ό κ΅¬ν˜„ν•  μˆ˜λ„ μžˆμŠ΅λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: ν”ŒλŸ¬κ·ΈμΈμ€ μ„ ν˜Έ 트리 λ…Έλ“œλ₯Ό 톡해 κ·Έκ²ƒμ˜ 자체 순회 μˆœμ„œλ₯Ό κ΅¬ν˜„ν•  μˆ˜λ„ μžˆμŠ΅λ‹ˆλ‹€.</끝> ### μ˜μ–΄: A plug-in may also implement its traversal through the preference tree nodes.</끝>
24,950
Our cloud infrastructure thus needs to dynamically provision Kubernetes nodes.
λ”°λΌμ„œ 우리의 ν΄λΌμš°λ“œ μΈν”„λΌλŠ” 쿠버넀츠 λ…Έλ“œλ₯Ό λ™μ μœΌλ‘œ ν”„λ‘œλΉ„μ €λ‹ν•΄μ•Όν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λ”°λΌμ„œ 우리의 ν΄λΌμš°λ“œ μΈν”„λΌλŠ” 쿠버넀츠 λ…Έλ“œλ₯Ό λ™μ μœΌλ‘œ ν”„λ‘œλΉ„μ €λ‹ν•΄μ•Όν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Our cloud infrastructure thus needs to dynamically provision Kubernetes nodes.</끝>
24,951
To increase the expandability the number of nodes in the blockchain will be increased.
ν™•μž₯성을 늘리기 μœ„ν•΄μ„œ λΈ”λ‘μ²΄μΈμ˜ λ…Έλ“œ μˆ˜κ°€ 증가할 κ²ƒμž…λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: ν™•μž₯성을 늘리기 μœ„ν•΄μ„œ λΈ”λ‘μ²΄μΈμ˜ λ…Έλ“œ μˆ˜κ°€ 증가할 κ²ƒμž…λ‹ˆλ‹€.</끝> ### μ˜μ–΄: To increase the expandability the number of nodes in the blockchain will be increased.</끝>
24,952
The processing then creates nodes for insertion points where words must be generated.
그런 λ‹€μŒ 단어가 μƒμ„±λ˜μ–΄μ•Ό ν•˜λŠ” μ‚½μž… 점에 λŒ€ν•œ λ…Έλ“œκ°€ μƒμ„±λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 그런 λ‹€μŒ 단어가 μƒμ„±λ˜μ–΄μ•Ό ν•˜λŠ” μ‚½μž… 점에 λŒ€ν•œ λ…Έλ“œκ°€ μƒμ„±λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: The processing then creates nodes for insertion points where words must be generated.</끝>
24,953
The input related to the speed of moving a viewpoint includes moving time between nodes.
μ‹œμ  이동 속도와 κ΄€λ ¨λœ μž…λ ₯은 λ…Έλ“œ κ°„ 이동 μ‹œκ°„μ„ ν¬ν•¨ν•œλ‹€.
### ν•œκ΅­μ–΄: μ‹œμ  이동 속도와 κ΄€λ ¨λœ μž…λ ₯은 λ…Έλ“œ κ°„ 이동 μ‹œκ°„μ„ ν¬ν•¨ν•œλ‹€.</끝> ### μ˜μ–΄: The input related to the speed of moving a viewpoint includes moving time between nodes.</끝>
24,954
The node data includes information about the intersections corresponding to the nodes.
λ…Έλ“œ λ°μ΄ν„°λŠ” λ…Έλ“œλ“€μ— λŒ€μ‘ν•˜λŠ” ꡐ차점듀에 λŒ€ν•œ 정보λ₯Ό ν¬ν•¨ν•œλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œ λ°μ΄ν„°λŠ” λ…Έλ“œλ“€μ— λŒ€μ‘ν•˜λŠ” ꡐ차점듀에 λŒ€ν•œ 정보λ₯Ό ν¬ν•¨ν•œλ‹€.</끝> ### μ˜μ–΄: The node data includes information about the intersections corresponding to the nodes.</끝>
24,955
You can also use a distribution switch to manage a large number of nodes in the center.
λ˜ν•œ λΆ„μ‚° μŠ€μœ„μΉ˜λ₯Ό μ΄μš©ν•΄ μ€‘μ•™μ—μ„œ μˆ˜λ§Žμ€ λ…Έλ“œλ₯Ό 관리할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: λ˜ν•œ λΆ„μ‚° μŠ€μœ„μΉ˜λ₯Ό μ΄μš©ν•΄ μ€‘μ•™μ—μ„œ μˆ˜λ§Žμ€ λ…Έλ“œλ₯Ό 관리할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: You can also use a distribution switch to manage a large number of nodes in the center.</끝>
24,956
Clustering may be construed as associating leaf nodes with the same parent node.
ν΄λŸ¬μŠ€ν„°λ§μ€ 리프 λ…Έλ“œλ“€μ„ λ™μΌν•œ λΆ€λͺ¨ λ…Έλ“œμ™€ μ—°κ΄€μ‹œν‚€λŠ” κ²ƒμœΌλ‘œ 해석될 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: ν΄λŸ¬μŠ€ν„°λ§μ€ 리프 λ…Έλ“œλ“€μ„ λ™μΌν•œ λΆ€λͺ¨ λ…Έλ“œμ™€ μ—°κ΄€μ‹œν‚€λŠ” κ²ƒμœΌλ‘œ 해석될 수 μžˆλ‹€.</끝> ### μ˜μ–΄: Clustering may be construed as associating leaf nodes with the same parent node.</끝>
24,957
Our cloud and physical nodes run Software A and are configured with Software B.
우리의 ν΄λΌμš°λ“œμ™€ 물리적 λ…Έλ“œλ“€μ€ A μ†Œν”„νŠΈμ›¨μ–΄λ₯Ό μ‹€ν–‰ν•˜λ©° B μ†Œν”„νŠΈμ›¨μ–΄λ‘œ κ΅¬μ„±λœλ‹€.
### ν•œκ΅­μ–΄: 우리의 ν΄λΌμš°λ“œμ™€ 물리적 λ…Έλ“œλ“€μ€ A μ†Œν”„νŠΈμ›¨μ–΄λ₯Ό μ‹€ν–‰ν•˜λ©° B μ†Œν”„νŠΈμ›¨μ–΄λ‘œ κ΅¬μ„±λœλ‹€.</끝> ### μ˜μ–΄: Our cloud and physical nodes run Software A and are configured with Software B.</끝>
24,958
Each domain may share one or more property nodes with one or more other domains.
각각의 도메인은 ν•˜λ‚˜ μ΄μƒμ˜ λ‹€λ₯Έ 도메인과 ν•˜λ‚˜ μ΄μƒμ˜ 속성 λ…Έλ“œλ₯Ό κ³΅μœ ν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 각각의 도메인은 ν•˜λ‚˜ μ΄μƒμ˜ λ‹€λ₯Έ 도메인과 ν•˜λ‚˜ μ΄μƒμ˜ 속성 λ…Έλ“œλ₯Ό κ³΅μœ ν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: Each domain may share one or more property nodes with one or more other domains.</끝>
24,959
The selection of target node and reference nodes of complete source code has been tested.
전체 μ†ŒμŠ€ μ½”λ“œμ˜ λŒ€μƒ λ…Έλ“œ 및 μ°Έμ‘° λ…Έλ“œμ˜ 선택이 ν…ŒμŠ€νŠΈ λ˜μ—ˆλ‹€.
### ν•œκ΅­μ–΄: 전체 μ†ŒμŠ€ μ½”λ“œμ˜ λŒ€μƒ λ…Έλ“œ 및 μ°Έμ‘° λ…Έλ“œμ˜ 선택이 ν…ŒμŠ€νŠΈ λ˜μ—ˆλ‹€.</끝> ### μ˜μ–΄: The selection of target node and reference nodes of complete source code has been tested.</끝>
24,960
The capacitive sensing nodes may be based on self-capacitance or mutual capacitance.
μš©λŸ‰μ„± 감지 λ…Έλ“œλ“€μ€ 자기 μ»€νŒ¨μ‹œν„΄μŠ€ λ˜λŠ” μƒν˜Έ μ»€νŒ¨μ‹œν„΄μŠ€μ— κΈ°μ΄ˆν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μš©λŸ‰μ„± 감지 λ…Έλ“œλ“€μ€ 자기 μ»€νŒ¨μ‹œν„΄μŠ€ λ˜λŠ” μƒν˜Έ μ»€νŒ¨μ‹œν„΄μŠ€μ— κΈ°μ΄ˆν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: The capacitive sensing nodes may be based on self-capacitance or mutual capacitance.</끝>
24,961
The second is the scalability that supports up to 32000 nodes at the industrial level.
두 λ²ˆμ§ΈλŠ” μ‚°μ—…μš© μˆ˜μ€€μœΌλ‘œ 총 3만 2000κ°œκΉŒμ§€ λ…Έλ“œλ₯Ό μ§€μ›ν•˜λŠ” ν™•μž₯성이닀.
### ν•œκ΅­μ–΄: 두 λ²ˆμ§ΈλŠ” μ‚°μ—…μš© μˆ˜μ€€μœΌλ‘œ 총 3만 2000κ°œκΉŒμ§€ λ…Έλ“œλ₯Ό μ§€μ›ν•˜λŠ” ν™•μž₯성이닀.</끝> ### μ˜μ–΄: The second is the scalability that supports up to 32000 nodes at the industrial level.</끝>
24,962
With this queries are split and distributed across parallel nodes and processed in parallel.
이것을 톡해 쑰회 μˆ˜λ“€μ€ λ‚˜λ‰˜μ–΄ 병렬 λ…Έλ“œλ‘œ λΆ„μ‚° μ²˜λ¦¬λœλ‹€.
### ν•œκ΅­μ–΄: 이것을 톡해 쑰회 μˆ˜λ“€μ€ λ‚˜λ‰˜μ–΄ 병렬 λ…Έλ“œλ‘œ λΆ„μ‚° μ²˜λ¦¬λœλ‹€.</끝> ### μ˜μ–΄: With this queries are split and distributed across parallel nodes and processed in parallel.</끝>
24,963
The variable node decoding is independent of degree information regarding the variable nodes.
κ°€λ³€ λ…Έλ“œ λ³΅ν˜Έν™”λŠ” κ°€λ³€ λ…Έλ“œμ— λŒ€ν•œ 차수 정보와 독립적이닀.
### ν•œκ΅­μ–΄: κ°€λ³€ λ…Έλ“œ λ³΅ν˜Έν™”λŠ” κ°€λ³€ λ…Έλ“œμ— λŒ€ν•œ 차수 정보와 독립적이닀.</끝> ### μ˜μ–΄: The variable node decoding is independent of degree information regarding the variable nodes.</끝>
24,964
An output of the control circuit 3 is connected to nodes G1 and G2 in the semiconductor device.
μ œμ–΄ 회둜 3의 좜λ ₯은 λ°˜λ„μ²΄ μž₯치의 λ…Έλ“œ G1κ³Ό G2에 μ—°κ²°λœλ‹€.
### ν•œκ΅­μ–΄: μ œμ–΄ 회둜 3의 좜λ ₯은 λ°˜λ„μ²΄ μž₯치의 λ…Έλ“œ G1κ³Ό G2에 μ—°κ²°λœλ‹€.</끝> ### μ˜μ–΄: An output of the control circuit 3 is connected to nodes G1 and G2 in the semiconductor device.</끝>
24,965
It is understood that some nodes in a network may not be interconnected as shown.
λ„€νŠΈμ›Œν¬ λ‚΄μ˜ 일뢀 λ…Έλ“œλ“€μ€ λ„μ‹œλœ 바와 같이 μƒν˜Έ μ—°κ²°λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€λŠ” 것이 μ΄ν•΄λœλ‹€.
### ν•œκ΅­μ–΄: λ„€νŠΈμ›Œν¬ λ‚΄μ˜ 일뢀 λ…Έλ“œλ“€μ€ λ„μ‹œλœ 바와 같이 μƒν˜Έ μ—°κ²°λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€λŠ” 것이 μ΄ν•΄λœλ‹€.</끝> ### μ˜μ–΄: It is understood that some nodes in a network may not be interconnected as shown.</끝>
24,966
The second was the Social Web with links between nodes representing friend relationships.
두 λ²ˆμ§ΈλŠ” 친ꡬ 관계λ₯Ό ν‘œμ‹œν•˜λŠ” λ…Έλ“œ μ‚¬μ΄μ˜ 링크가 μžˆλŠ” μ†Œμ…œ μ›Ήμ΄μ—ˆλ‹€.
### ν•œκ΅­μ–΄: 두 λ²ˆμ§ΈλŠ” 친ꡬ 관계λ₯Ό ν‘œμ‹œν•˜λŠ” λ…Έλ“œ μ‚¬μ΄μ˜ 링크가 μžˆλŠ” μ†Œμ…œ μ›Ήμ΄μ—ˆλ‹€.</끝> ### μ˜μ–΄: The second was the Social Web with links between nodes representing friend relationships.</끝>
24,967
Dialog acts are the terminal nodes of the tree structure that represents the dialog structure.
λŒ€ν™” μƒμžλŠ” λŒ€ν™” ꡬ쑰λ₯Ό λ‚˜νƒ€λ‚΄λŠ” 트리 ꡬ쑰의 터미널 λ…Έλ“œμž…λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λŒ€ν™” μƒμžλŠ” λŒ€ν™” ꡬ쑰λ₯Ό λ‚˜νƒ€λ‚΄λŠ” 트리 ꡬ쑰의 터미널 λ…Έλ“œμž…λ‹ˆλ‹€.</끝> ### μ˜μ–΄: Dialog acts are the terminal nodes of the tree structure that represents the dialog structure.</끝>
24,968
Particular nodes manipulate a subset of the data that is accessible to the particular node.
νŠΉμ • λ…Έλ“œλ“€μ€ νŠΉμ • λ…Έλ“œμ— μ•‘μ„ΈμŠ€ κ°€λŠ₯ν•œ λ°μ΄ν„°μ˜ μ„œλΈŒμ„ΈνŠΈλ₯Ό μ‘°μž‘ν•œλ‹€.
### ν•œκ΅­μ–΄: νŠΉμ • λ…Έλ“œλ“€μ€ νŠΉμ • λ…Έλ“œμ— μ•‘μ„ΈμŠ€ κ°€λŠ₯ν•œ λ°μ΄ν„°μ˜ μ„œλΈŒμ„ΈνŠΈλ₯Ό μ‘°μž‘ν•œλ‹€.</끝> ### μ˜μ–΄: Particular nodes manipulate a subset of the data that is accessible to the particular node.</끝>
24,969
Also you can expand to multiple GPU nodes by directly connecting the PCI-E switch and NIC.
λ˜ν•œ PCIE μŠ€μœ„μΉ˜μ™€ NICλ₯Ό 직접 μ—°κ²°ν•˜μ—¬ λ‹€μˆ˜μ˜ GPU λ…Έλ“œλ‘œ ν™•μž₯ν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: λ˜ν•œ PCIE μŠ€μœ„μΉ˜μ™€ NICλ₯Ό 직접 μ—°κ²°ν•˜μ—¬ λ‹€μˆ˜μ˜ GPU λ…Έλ“œλ‘œ ν™•μž₯ν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: Also you can expand to multiple GPU nodes by directly connecting the PCI-E switch and NIC.</끝>
24,970
Computer nodes are divided into switch blocks and process blocks through virtual LAN.
컴퓨터 λ…Έλ“œλŠ” 가상 랜vlan을 톡해 가상 μŠ€μœ„μΉ˜ 블둝과 ν”„λ‘œμ„ΈμŠ€ λΈ”λ‘μœΌλ‘œ λ‚˜λ‰œλ‹€.
### ν•œκ΅­μ–΄: 컴퓨터 λ…Έλ“œλŠ” 가상 랜vlan을 톡해 가상 μŠ€μœ„μΉ˜ 블둝과 ν”„λ‘œμ„ΈμŠ€ λΈ”λ‘μœΌλ‘œ λ‚˜λ‰œλ‹€.</끝> ### μ˜μ–΄: Computer nodes are divided into switch blocks and process blocks through virtual LAN.</끝>
24,971
5G is capable of supporting the growing volume of M2M nodes and sensors with mobile connectivity.
5GλŠ” λͺ¨λ°”일 μ—°κ²°μ„±μœΌλ‘œ μ¦κ°€ν•˜λŠ” M2Mλ…Έλ“œμ™€ μ„Όμ„œλ₯Ό 지원할 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 5GλŠ” λͺ¨λ°”일 μ—°κ²°μ„±μœΌλ‘œ μ¦κ°€ν•˜λŠ” M2Mλ…Έλ“œμ™€ μ„Όμ„œλ₯Ό 지원할 수 μžˆλ‹€.</끝> ### μ˜μ–΄: 5G is capable of supporting the growing volume of M2M nodes and sensors with mobile connectivity.</끝>
24,972
Four times as many nodes were needed to cut the two system components latency in half.
κ·Έ 두 μ‹œμŠ€ν…œ λΆ€ν’ˆ κ°„μ˜ μ§€μ—°μ‹œκ°„μ„ 반으둜 쀄이기 μœ„ν•΄μ„œλŠ” λ„€ λ°° λ§Žμ€ ꡐ점이 ν•„μš”ν–ˆλ‹€.
### ν•œκ΅­μ–΄: κ·Έ 두 μ‹œμŠ€ν…œ λΆ€ν’ˆ κ°„μ˜ μ§€μ—°μ‹œκ°„μ„ 반으둜 쀄이기 μœ„ν•΄μ„œλŠ” λ„€ λ°° λ§Žμ€ ꡐ점이 ν•„μš”ν–ˆλ‹€.</끝> ### μ˜μ–΄: Four times as many nodes were needed to cut the two system components latency in half.</끝>
24,973
The nodes applications range from industrial automation to military to manufacturing sectors.
이 λ…Έλ“œμ˜ μš©λ„λ“€μ€ μ‚°μ—… μžλ™ν™”μ—μ„œλΆ€ν„° κ΅°λŒ€ μ œμ‘°μ—… λΆ„μ•ΌκΉŒμ§€ λ‹€μ–‘ν•˜λ‹€.
### ν•œκ΅­μ–΄: 이 λ…Έλ“œμ˜ μš©λ„λ“€μ€ μ‚°μ—… μžλ™ν™”μ—μ„œλΆ€ν„° κ΅°λŒ€ μ œμ‘°μ—… λΆ„μ•ΌκΉŒμ§€ λ‹€μ–‘ν•˜λ‹€.</끝> ### μ˜μ–΄: The nodes applications range from industrial automation to military to manufacturing sectors.</끝>
24,974
A network communication path between the devices may traverse one or more network nodes.
λ””λ°”μ΄μŠ€λ“€ μ‚¬μ΄μ˜ λ„€νŠΈμ›Œν¬ 톡신 κ²½λ‘œλŠ” ν•˜λ‚˜ μ΄μƒμ˜ λ„€νŠΈμ›Œν¬ λ…Έλ“œλ“€μ„ νš‘λ‹¨ν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: λ””λ°”μ΄μŠ€λ“€ μ‚¬μ΄μ˜ λ„€νŠΈμ›Œν¬ 톡신 κ²½λ‘œλŠ” ν•˜λ‚˜ μ΄μƒμ˜ λ„€νŠΈμ›Œν¬ λ…Έλ“œλ“€μ„ νš‘λ‹¨ν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: A network communication path between the devices may traverse one or more network nodes.</끝>
24,975
According to our approach information is encoded in the connections of a grouping of nodes.
우리 μ ‘κ·Ό 방식에 μ˜ν•˜λ©΄ 정보 λ°μ΄ν„°λŠ” ꡐ점 그룹의 μ—°κ²°μ§€μ μ—μ„œ μΈμ½”λ”©λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 우리 μ ‘κ·Ό 방식에 μ˜ν•˜λ©΄ 정보 λ°μ΄ν„°λŠ” ꡐ점 그룹의 μ—°κ²°μ§€μ μ—μ„œ μΈμ½”λ”©λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: According to our approach information is encoded in the connections of a grouping of nodes.</끝>
24,976
Some of the business to local nodes on the announcement and specific provision shall prevail.
λ°œν‘œλ˜κ³  νŠΉλ³„μ‘°ν•­μ— ν•΄λ‹Ήν•˜λŠ” μ§€μ—­ ꡐ점 ν˜•μ„±μ˜ λͺ‡λͺ‡ 사업이 잘 μ•Œλ €μ§€κ²Œ λœλ‹€.
### ν•œκ΅­μ–΄: λ°œν‘œλ˜κ³  νŠΉλ³„μ‘°ν•­μ— ν•΄λ‹Ήν•˜λŠ” μ§€μ—­ ꡐ점 ν˜•μ„±μ˜ λͺ‡λͺ‡ 사업이 잘 μ•Œλ €μ§€κ²Œ λœλ‹€.</끝> ### μ˜μ–΄: Some of the business to local nodes on the announcement and specific provision shall prevail.</끝>
24,977
These technology applications generate vast volumes of data flow across the network nodes.
μ΄λŸ¬ν•œ 기술 μ• ν”Œλ¦¬μΌ€μ΄μ…˜μ€ λ„€νŠΈμ›Œν¬ λ…Έλ“œμ— 걸쳐 λ§Žμ€ μ–‘μ˜ 데이터 흐름을 μƒμ„±ν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μ΄λŸ¬ν•œ 기술 μ• ν”Œλ¦¬μΌ€μ΄μ…˜μ€ λ„€νŠΈμ›Œν¬ λ…Έλ“œμ— 걸쳐 λ§Žμ€ μ–‘μ˜ 데이터 흐름을 μƒμ„±ν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: These technology applications generate vast volumes of data flow across the network nodes.</끝>
24,978
In this way limited channel resources can be used efficiently by more wireless nodes.
μ΄λŸ¬ν•œ λ°©μ‹μœΌλ‘œ μ œν•œλœ 채널 μžμ›μ„ 더 λ§Žμ€ 무선 λ…Έλ“œλ₯Ό μ΄μš©ν•΄ 효율적으둜 μ‚¬μš©ν•  수 μžˆμŠ΅λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μ΄λŸ¬ν•œ λ°©μ‹μœΌλ‘œ μ œν•œλœ 채널 μžμ›μ„ 더 λ§Žμ€ 무선 λ…Έλ“œλ₯Ό μ΄μš©ν•΄ 효율적으둜 μ‚¬μš©ν•  수 μžˆμŠ΅λ‹ˆλ‹€.</끝> ### μ˜μ–΄: In this way limited channel resources can be used efficiently by more wireless nodes.</끝>
24,979
Multiple nodes each node a continuum create complexes of high diversity in high dimensions.
각 ꡐ점의 연속체인 닀쀑 ꡐ점은 μƒμœ„ μ°¨μ›μ—μ„œ 높은 닀양성을 κ°–μΆ˜ 집합체λ₯Ό λ§Œλ“ λ‹€.
### ν•œκ΅­μ–΄: 각 ꡐ점의 연속체인 닀쀑 ꡐ점은 μƒμœ„ μ°¨μ›μ—μ„œ 높은 닀양성을 κ°–μΆ˜ 집합체λ₯Ό λ§Œλ“ λ‹€.</끝> ### μ˜μ–΄: Multiple nodes each node a continuum create complexes of high diversity in high dimensions.</끝>
24,980
Such databases may include a plurality of nodes that each store a portion of the database.
μ΄λŸ¬ν•œ λ°μ΄ν„°λ² μ΄μŠ€λ“€μ—λŠ” 각 λ°μ΄ν„°λ² μ΄μŠ€μ˜ 일뢀λ₯Ό μ €μž₯ν•˜λŠ” μ—¬λŸ¬ λ…Έλ“œκ°€ 포함될 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μ΄λŸ¬ν•œ λ°μ΄ν„°λ² μ΄μŠ€λ“€μ—λŠ” 각 λ°μ΄ν„°λ² μ΄μŠ€μ˜ 일뢀λ₯Ό μ €μž₯ν•˜λŠ” μ—¬λŸ¬ λ…Έλ“œκ°€ 포함될 수 μžˆλ‹€.</끝> ### μ˜μ–΄: Such databases may include a plurality of nodes that each store a portion of the database.</끝>
24,981
In the type of network commonly used for voice recognition the nodes are arranged into layers.
μŒμ„± 인식에 일반적으둜 μ‚¬μš©λ˜λŠ” λ„€νŠΈμ›Œν¬ μœ ν˜•μ—μ„œ λ…Έλ“œλŠ” κ³„μΈ΅μœΌλ‘œ λ°°μ—΄λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μŒμ„± 인식에 일반적으둜 μ‚¬μš©λ˜λŠ” λ„€νŠΈμ›Œν¬ μœ ν˜•μ—μ„œ λ…Έλ“œλŠ” κ³„μΈ΅μœΌλ‘œ λ°°μ—΄λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: In the type of network commonly used for voice recognition the nodes are arranged into layers.</끝>
24,982
The nodes in the network are the systems components and the links are given by the interactions.
λ„€νŠΈμ›Œν¬μ˜ λ…Έλ“œλŠ” μ‹œμŠ€ν…œμ˜ κ΅¬μ„±μš”μ†Œμ΄λ©° λ§ν¬λŠ” μƒν˜Έμž‘μš©μ— μ˜ν•΄ μ œκ³΅λœλ‹€.
### ν•œκ΅­μ–΄: λ„€νŠΈμ›Œν¬μ˜ λ…Έλ“œλŠ” μ‹œμŠ€ν…œμ˜ κ΅¬μ„±μš”μ†Œμ΄λ©° λ§ν¬λŠ” μƒν˜Έμž‘μš©μ— μ˜ν•΄ μ œκ³΅λœλ‹€.</끝> ### μ˜μ–΄: The nodes in the network are the systems components and the links are given by the interactions.</끝>
24,983
Moving nodes in an organizational system collectively use their analysis to solve problems.
쑰직적인 체계 μ†μ—μ„œ μ›€μ§μ΄λŠ” λ…Έλ“œλ“€μ€ 각자 λΆ„μ„ν•œ λ‚΄μš©μ„ λͺ¨λ‘ 합쳐 문제 해결에 ν™œμš©ν•œλ‹€.
### ν•œκ΅­μ–΄: 쑰직적인 체계 μ†μ—μ„œ μ›€μ§μ΄λŠ” λ…Έλ“œλ“€μ€ 각자 λΆ„μ„ν•œ λ‚΄μš©μ„ λͺ¨λ‘ 합쳐 문제 해결에 ν™œμš©ν•œλ‹€.</끝> ### μ˜μ–΄: Moving nodes in an organizational system collectively use their analysis to solve problems.</끝>
24,984
Time synchronization typically involves sharing time synchronization messages between the nodes.
μ‹œκ°„ λ™κΈ°ν™”λŠ” 일반적으둜 λ…Έλ“œ 간에 μ‹œκ°„ 동기화 λ©”μ‹œμ§€λ“€μ„ κ³΅μœ ν•˜λŠ” 것을 ν¬ν•¨ν•œλ‹€.
### ν•œκ΅­μ–΄: μ‹œκ°„ λ™κΈ°ν™”λŠ” 일반적으둜 λ…Έλ“œ 간에 μ‹œκ°„ 동기화 λ©”μ‹œμ§€λ“€μ„ κ³΅μœ ν•˜λŠ” 것을 ν¬ν•¨ν•œλ‹€.</끝> ### μ˜μ–΄: Time synchronization typically involves sharing time synchronization messages between the nodes.</끝>
24,985
The first communication node may be a switch to which the plurality of communication nodes are connected.
제1 톡신 λ…Έλ“œλŠ” 볡수의 톡신 λ…Έλ“œκ°€ μ—°κ²°λ˜μ–΄μžˆλŠ” μŠ€μœ„μΉ˜μΌ 수 μžˆλ‹€.
### ν•œκ΅­μ–΄: 제1 톡신 λ…Έλ“œλŠ” 볡수의 톡신 λ…Έλ“œκ°€ μ—°κ²°λ˜μ–΄μžˆλŠ” μŠ€μœ„μΉ˜μΌ 수 μžˆλ‹€.</끝> ### μ˜μ–΄: The first communication node may be a switch to which the plurality of communication nodes are connected.</끝>
24,986
Each PD contains 21 racks with 189 Storage Nodes per PD and 45 3TB drives per Storage Node.
각 PDμ—λŠ” PDλ‹Ή 189개의 μŠ€ν† λ¦¬μ§€ λ…Έλ“œμ™€ μŠ€ν† λ¦¬μ§€ λ…Έλ“œ λ‹Ή 45개의 3TB λ“œλΌμ΄λΈŒκ°€ μžˆμ€ 21개의 λž™μ΄ μžˆλ‹€.
### ν•œκ΅­μ–΄: 각 PDμ—λŠ” PDλ‹Ή 189개의 μŠ€ν† λ¦¬μ§€ λ…Έλ“œμ™€ μŠ€ν† λ¦¬μ§€ λ…Έλ“œ λ‹Ή 45개의 3TB λ“œλΌμ΄λΈŒκ°€ μžˆμ€ 21개의 λž™μ΄ μžˆλ‹€.</끝> ### μ˜μ–΄: Each PD contains 21 racks with 189 Storage Nodes per PD and 45 3TB drives per Storage Node.</끝>
24,987
It is a graph search algorithm which begins at the root node and explores all the neighboring nodes.
그것은 뿌리 λ…Έλ“œμ—μ„œ μ‹œμž‘ν•΄ λͺ¨λ“  μ£Όλ³€ λ…Έλ“œλ₯Ό νƒμƒ‰ν•˜λŠ” κ·Έλž˜ν”„ 검색 μ•Œκ³ λ¦¬μ¦˜μ΄λ‹€.
### ν•œκ΅­μ–΄: 그것은 뿌리 λ…Έλ“œμ—μ„œ μ‹œμž‘ν•΄ λͺ¨λ“  μ£Όλ³€ λ…Έλ“œλ₯Ό νƒμƒ‰ν•˜λŠ” κ·Έλž˜ν”„ 검색 μ•Œκ³ λ¦¬μ¦˜μ΄λ‹€.</끝> ### μ˜μ–΄: It is a graph search algorithm which begins at the root node and explores all the neighboring nodes.</끝>
24,988
Because its connection to numerous nodes and multilevel structure make in-depth learning possible.
μˆ˜λ§Žμ€ λ…Έλ“œλ‘œ 연결돼 있고 λ‹€μΈ΅ ꡬ쑰둜 이뀄져 μžˆμ–΄ 심측적인 ν•™μŠ΅μ΄ κ°€λŠ₯ν•˜κΈ° λ•Œλ¬Έμ΄λ‹€.
### ν•œκ΅­μ–΄: μˆ˜λ§Žμ€ λ…Έλ“œλ‘œ 연결돼 있고 λ‹€μΈ΅ ꡬ쑰둜 이뀄져 μžˆμ–΄ 심측적인 ν•™μŠ΅μ΄ κ°€λŠ₯ν•˜κΈ° λ•Œλ¬Έμ΄λ‹€.</끝> ### μ˜μ–΄: Because its connection to numerous nodes and multilevel structure make in-depth learning possible.</끝>
24,989
A tree is a data structure containing zero or more nodes linked to one another in a hierarchical structure.
νŠΈλ¦¬λŠ” 계측 κ΅¬μ‘°μ—μ„œ μ„œλ‘œ μ—°κ²°λœ λ…Έλ“œκ°€ 0개 이상 ν¬ν•¨λœ 데이터 ꡬ쑰이닀.
### ν•œκ΅­μ–΄: νŠΈλ¦¬λŠ” 계측 κ΅¬μ‘°μ—μ„œ μ„œλ‘œ μ—°κ²°λœ λ…Έλ“œκ°€ 0개 이상 ν¬ν•¨λœ 데이터 ꡬ쑰이닀.</끝> ### μ˜μ–΄: A tree is a data structure containing zero or more nodes linked to one another in a hierarchical structure.</끝>
24,990
Collisions and interferences among nodes pose a challenge for data aggregation in many applications.
λ…Έλ“œ κ°„μ˜ 좩돌 및 간섭은 λ§Žμ€ μ‘μš© ν”„λ‘œκ·Έλž¨μ—μ„œ 데이터 집계에 λŒ€ν•œ λ¬Έμ œμ μ„ μ œκΈ°ν•œλ‹€.
### ν•œκ΅­μ–΄: λ…Έλ“œ κ°„μ˜ 좩돌 및 간섭은 λ§Žμ€ μ‘μš© ν”„λ‘œκ·Έλž¨μ—μ„œ 데이터 집계에 λŒ€ν•œ λ¬Έμ œμ μ„ μ œκΈ°ν•œλ‹€.</끝> ### μ˜μ–΄: Collisions and interferences among nodes pose a challenge for data aggregation in many applications.</끝>
24,991
In addition clusters must consume nodes before shutting them down to avoid loss of in-flight work.
λ˜ν•œ ν΄λŸ¬μŠ€ν„°λŠ” κΈ°λ‚΄ μž‘μ—… 손싀을 ν”Όν•˜κΈ° μœ„ν•΄ λ…Έλ“œλ₯Ό μ’…λ£Œν•˜κΈ° 전에 λ…Έλ“œλ₯Ό μ†Œλͺ¨ν•΄μ•Ό ν•©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: λ˜ν•œ ν΄λŸ¬μŠ€ν„°λŠ” κΈ°λ‚΄ μž‘μ—… 손싀을 ν”Όν•˜κΈ° μœ„ν•΄ λ…Έλ“œλ₯Ό μ’…λ£Œν•˜κΈ° 전에 λ…Έλ“œλ₯Ό μ†Œλͺ¨ν•΄μ•Ό ν•©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: In addition clusters must consume nodes before shutting them down to avoid loss of in-flight work.</끝>
24,992
You can develop block-chain applications in programming languages such as Java python Nodes and C .
μžλ°” 파이썬 λ…Έλ“œ C λ“± ν”„λ‘œκ·Έλž˜λ° μ–Έμ–΄λ‘œ 블둝체인 μ• ν”Œλ¦¬μΌ€μ΄μ…˜μ„ κ°œλ°œν•  수 μžˆλ‹€.
### ν•œκ΅­μ–΄: μžλ°” 파이썬 λ…Έλ“œ C λ“± ν”„λ‘œκ·Έλž˜λ° μ–Έμ–΄λ‘œ 블둝체인 μ• ν”Œλ¦¬μΌ€μ΄μ…˜μ„ κ°œλ°œν•  수 μžˆλ‹€.</끝> ### μ˜μ–΄: You can develop block-chain applications in programming languages such as Java python Nodes and C .</끝>
24,993
And the third is the Machine-Payable Web where the links between nodes represent payments between machines.
μ„Έ λ²ˆμ§ΈλŠ” λ…Έλ“œ μ‚¬μ΄μ˜ 링크가 기계 κ°„μ˜ μ§€λΆˆμ„ λ‚˜νƒ€λ‚΄λŠ” 기계 μ§€λΆˆ μ›Ήμž…λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: μ„Έ λ²ˆμ§ΈλŠ” λ…Έλ“œ μ‚¬μ΄μ˜ 링크가 기계 κ°„μ˜ μ§€λΆˆμ„ λ‚˜νƒ€λ‚΄λŠ” 기계 μ§€λΆˆ μ›Ήμž…λ‹ˆλ‹€.</끝> ### μ˜μ–΄: And the third is the Machine-Payable Web where the links between nodes represent payments between machines.</끝>
24,994
Currently the financial platform has about 400 clients and has recently exceeded 1000 operating nodes.
ν˜„μž¬ κ·Έ 금육 ν”Œλž«νΌμ€ μ•½ 400개 고객사λ₯Ό ν™•λ³΄ν–ˆκ³  졜근 운영 λ…Έλ“œ 규λͺ¨κ°€ 1000λŒ€λ₯Ό λ„˜κ²Όλ‹€.
### ν•œκ΅­μ–΄: ν˜„μž¬ κ·Έ 금육 ν”Œλž«νΌμ€ μ•½ 400개 고객사λ₯Ό ν™•λ³΄ν–ˆκ³  졜근 운영 λ…Έλ“œ 규λͺ¨κ°€ 1000λŒ€λ₯Ό λ„˜κ²Όλ‹€.</끝> ### μ˜μ–΄: Currently the financial platform has about 400 clients and has recently exceeded 1000 operating nodes.</끝>
24,995
BioDT runs on a computer cluster which consists of machines called nodes inter-connected and working as one.
BioDTλŠ” λ…Έλ“œλΌκ³  λΆˆλ¦¬λŠ” μ»΄ν“¨ν„°λ‘œ κ΅¬μ„±λœ 컴퓨터 ν΄λŸ¬μŠ€ν„°μ—μ„œ μ‹€ν–‰λ©λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: BioDTλŠ” λ…Έλ“œλΌκ³  λΆˆλ¦¬λŠ” μ»΄ν“¨ν„°λ‘œ κ΅¬μ„±λœ 컴퓨터 ν΄λŸ¬μŠ€ν„°μ—μ„œ μ‹€ν–‰λ©λ‹ˆλ‹€.</끝> ### μ˜μ–΄: BioDT runs on a computer cluster which consists of machines called nodes inter-connected and working as one.</끝>
24,996
For an ideal batch job doubling the number of nodes in your cluster will halve the jobs runtime.
이상적인 일괄 μž‘μ—…μ˜ 경우 ν΄λŸ¬μŠ€ν„°μ˜ λ…Έλ“œ 수λ₯Ό 두 배둜 ν•˜λ©΄ μž‘μ—… μ‹€ν–‰ μ‹œκ°„μ΄ 절반으둜 μ€„μ–΄λ“­λ‹ˆλ‹€.
### ν•œκ΅­μ–΄: 이상적인 일괄 μž‘μ—…μ˜ 경우 ν΄λŸ¬μŠ€ν„°μ˜ λ…Έλ“œ 수λ₯Ό 두 배둜 ν•˜λ©΄ μž‘μ—… μ‹€ν–‰ μ‹œκ°„μ΄ 절반으둜 μ€„μ–΄λ“­λ‹ˆλ‹€.</끝> ### μ˜μ–΄: For an ideal batch job doubling the number of nodes in your cluster will halve the jobs runtime.</끝>
24,997
In addition these hundreds of thousands or even millions of nodes are layered similarly to the brain.
κ²Œλ‹€κ°€ 이 μˆ˜μ‹­λ§Œ λ˜λŠ” 심지어 수백만 개의 λ…Έλ“œλ“€μ€ λ‡Œμ™€λ„ λΉ„μŠ·ν•˜κ²Œ 계측적 측을 이루고 μžˆλ‹€.
### ν•œκ΅­μ–΄: κ²Œλ‹€κ°€ 이 μˆ˜μ‹­λ§Œ λ˜λŠ” 심지어 수백만 개의 λ…Έλ“œλ“€μ€ λ‡Œμ™€λ„ λΉ„μŠ·ν•˜κ²Œ 계측적 측을 이루고 μžˆλ‹€.</끝> ### μ˜μ–΄: In addition these hundreds of thousands or even millions of nodes are layered similarly to the brain.</끝>
24,998
Parent 1 and Parent 2 do have similar structures in nodes and connections but they also do have distinctions.
λΆ€λͺ¨1κ³Ό λΆ€λͺ¨2λŠ” λ…Έλ“œμ™€ μ—°κ²°μ—μ„œ λΉ„μŠ·ν•œ ꡬ쑰λ₯Ό μ§€λ‹ˆμ§€λ§Œ κ·Έλ“€ μ—­μ‹œ 차이가 μžˆλ‹€.
### ν•œκ΅­μ–΄: λΆ€λͺ¨1κ³Ό λΆ€λͺ¨2λŠ” λ…Έλ“œμ™€ μ—°κ²°μ—μ„œ λΉ„μŠ·ν•œ ꡬ쑰λ₯Ό μ§€λ‹ˆμ§€λ§Œ κ·Έλ“€ μ—­μ‹œ 차이가 μžˆλ‹€.</끝> ### μ˜μ–΄: Parent 1 and Parent 2 do have similar structures in nodes and connections but they also do have distinctions.</끝>
24,999
In programming a linked list is a list of nodes or elements of a data structure connected by pointers.
ν”„λ‘œκ·Έλž˜λ°μ—μ„œ μ—°κ²°λœ λͺ©λ‘μ€ λ§ˆλ””λ“€μ΄λ‚˜ μ§€μΉ¨λ“€λ‘œ μ—°κ²°λœ 데이터 ꡬ쑰의 μš”μ†Œλ“€μ˜ λͺ©λ‘μ΄λ‹€.
### ν•œκ΅­μ–΄: ν”„λ‘œκ·Έλž˜λ°μ—μ„œ μ—°κ²°λœ λͺ©λ‘μ€ λ§ˆλ””λ“€μ΄λ‚˜ μ§€μΉ¨λ“€λ‘œ μ—°κ²°λœ 데이터 ꡬ쑰의 μš”μ†Œλ“€μ˜ λͺ©λ‘μ΄λ‹€.</끝> ### μ˜μ–΄: In programming a linked list is a list of nodes or elements of a data structure connected by pointers.</끝>