• 공학수학2_복소해석 . . . . 11 matches
       Connected
       any 2 points $z_1$ and $z_2$ in an open set can be '''connected''' by a polygonal line(꺾은선) that lies entirely within the set
       open connected set
       Simply Connected Domains
       Multiple Connected Domain
       - not simply connected domains
       ● If $f$ is analytic in a simply connected domain $D,$
       Cauchy-Goursat Theorem for multiple connected domains
       Cauchy-Goursat Theorem for multiple connected domains
       Domain is simply connected domain defined by
        * If $f$ is analytic in a simply connected domain $D,$ then $f$ has an antiderivative in $D$
       Let $f$ be analytic in a simply connected domain $D$ and
       Let $f$ be analytic in a simply connected domain $D$
        $D:$ simply connected domain
• 연결,connection . . . . 11 matches
       [[connected_component]] - [[성분,component]] or [[요소,component]] .. of [[RR:그래프이론,graph_theory]]
       [[연결그래프,connected_graph]]
       Srch:connected_graph
       [[연결공간,connected_space]] - topology
       ||'''연결,connection''' ||connectedness ? WtEn:connectedness - 그런 단어 있다. ||connectionlessness (WtEn:connectionlessness - 단어 있음. 볼필요x) ||
       WtEn:simple_connectedness
       대충 '''connection'''되었다는 [[성질,property]]: connectivity ~= connectedness.
       connected adj.
       Srch:connected
       [[연결성,connectivity]] or [[connectedness]]?
• 그래프,graph . . . . 9 matches
       두 꼭짓점 $u,v$ 가 연결되어 있거나 인접하였다고 함. // connected, adjacent
        connected_graph https://mathworld.wolfram.com/ConnectedGraph.html
        disconnected_graph https://mathworld.wolfram.com/DisconnectedGraph.html
       connected - 직간접적으로 연결된 .... ??? CHK
       연결그래프 connected graph
       비연결그래프 disconnected graph
       연결성분 connected component
       연결그래프 connected_graph : 모든 정점을 연결한 그래프 - [[연결성,connectivity]]
• 네트워크,network . . . . 9 matches
       == Section 2.9 Connectedness ==
       [[connectedness]]
        connected - path가 존재
        disconnected - path does not exist - $d_{ij}=\infty$
       network is connected - 모든 node가 connected
       network is disconnected - $d_{ij}=\infty$ 가 하나라도 존재
       $N_G$ : the size of the largest connected cluster within the network
       connected regime : 더 나아간 (그림에서 e)
       subcritical ↔ supercritical ↔ fully connected
• 위상,topology . . . . 9 matches
        연결 - 그래서 connectedness, separation
       연결성connectivity, 연결된connected, 비연결인disconnected, 분리된separated 관련:
       TBW: connected, disconnected, separated or separate, adjacent 관계를 명확히.
       [[연결공간,connected_space]]
       [[연결집합,connected_set]]
       [[연결관계,connected_relation]]
       [[연결성,connectedness]]
• 트리,tree . . . . 9 matches
       def. connected graph without cycle ? [[순환,cycle]] 없는 [[연결그래프,connected_graph]]?
        https://mathworld.wolfram.com/Forest.html < A forest is an acyclic graph. Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." >
       connected acyclc graph - 항상? chk
       [[connected_graph]] [[acyclic_graph]] { [[순환,cycle]]이 없는 [[그래프,graph]] }
       tree는 연결된 비순환 무방향성 그래프 (connected, acyclic, undirected)
        * 간선을 (하나만) 제거하면 (그 결과가 되는 그래프는) 더 이상 연결되지 않는다. (disconnected)
       (graph is connected) ⇔ (graph has its 생성수형도)
        [[그래프,graph]] 이론 graph_theory 의 tree는, see [[WpEn:Tree_(graph_theory)]] interwiki ko: [[WpKo:나무_그래프]] - [[순환,cycle]]을 갖지 않는 connected graph
• 벡터장,vector_field . . . . 4 matches
       $\vec{F}$ 가 열린 연결영역 D에서 연속인 벡터장이라 하자. // [[열린영역,open_region]] [[연결영역,connected_region]] ... 열린연결영역 open_connected_region ? [[연속성,continuity]]
       평면에서 [[단순연결영역,simply_connected_region]]은 D 안에 있는 모든 단순닫힌곡선(simply_closed_curve ? [[단순곡선,simple_curve]] and [[닫힌곡선,closed_curve]]? chk .... '''단순닫힌곡선'''은 $\vec{r}(a)=\vec{r}(b)$ 가 되지만 $a<t_1<t_2<b$ 일 때 $\vec{r}(t_1)\ne\vec{r}(t_2)$ 이다. (Stewart 8e ko p909)) 이 D 안에 있는 점만을 둘러싸고 있는 [[연결영역,connected_region]] D를 뜻한다.
• 코시-구르사_정리,Cauchy-Goursat_theorem . . . . 3 matches
       ● If $f$ is analytic in a simply connected domain $D,$
       Suppose that a function $f$ is analytic in a simply connected domain $D$ and that $f'$ is continuous in $D.$ Then for every simple closed contour $C$ in $D:$
       Suppose a function $f$ is analytic in a simply connected domain $D.$ Then for every simple closed contour $C$ in $D:$
• 신경망,neural_network . . . . 2 matches
        Hopfield network - flat and interconnected
       층간 모두 연결되면(fully connected) 효율이 떨어진다. 필수적인 연결만 남겨 둔 sparse NN, efficient NN도 연구되고 있다.
• 영역,domain . . . . 2 matches
       An open set that is connected is a '''domain'''. // [[열린집합,open_set]] [[연결집합,connected_set]]
• 위상공간,topological_space . . . . 1 match
        [[연결공간,connected_space]]
• 호,arc . . . . 1 match
       An '''arc''' (symbol: ⌒) is a connected subset of a differentiable curve. (Wikipedia)
• 호길이,arclength . . . . 1 match
       일단, 문제를 간단히 해서 곡선 위 유한 개의 점으로 나눈 [[선분,line_segment]]들로 된 polygonal path([[WpEn:Polygonal_chain]] : connected series of line segments)의 총 길이를 생각.

You can also click here to search title.