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.</λ> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.