• 전자통신동향분석
• /
• 제37권1호
• /
• pp.32-41
• /
• 2022

With the development of computing technology, the convergence of ICT with existing traditional industries is being attempted. In particular, with the recent advent of 5G, connectivity with numerous AuT (autonomous Things) in the real world as well as simple mobile terminals has increased. As more devices are deployed in the real world, the need for technology for devices to learn and act autonomously to communicate with humans has begun to emerge. This article introduces "Device to the Edge," a new computing paradigm that enables various devices in smart spaces (e.g., factories, metaverse, shipyards, and city centers) to perform ultra-reliable, low-latency and high-speed processing regardless of the limitations of capability and performance. The proposed technology, referred to as EdgeCPS, can link devices to augmented virtual resources of edge servers to support complex artificial intelligence tasks and ultra-proximity services from low-specification/low-resource devices to high-performance devices.

• 한국정보과학회논문지:시스템및이론
• /
• 제29권9호
• /
• pp.493-502
• /
• 2002

다중 컴퓨터 네트워크의 고장 감내에 대한 대표적인 결정적 척도로 연결도와 에지 연결도가 있다. 연결도나 에지 연결도는 어떤 정점 분리 집합이나 에지 분리 집합을 제거했을 때 남은 그래프의 형태를 고려하지 않는다는 문제가 있다. 이러한 단점을 보완하기 위해서 superconnectivity, toughness, scattering number, vertex-integrity, binding number, restricted connectivity와 같은 일반화된 연결성 척도들이 함께 사용된다. 이 논문에서는 재귀원형군과 하이퍼큐브의 고장 감내에 대한 이러한 결정적 척도를 분석하고, 고장 감내 측면에서 비교한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.85-88
• /
• 2001

Unlike rigid objects or This paper developes the algorithm for segmenting gaseous objects on an image plane. Unlike rigid objects or solid non-rigid objects, gaseous objects vary in density even within single-object regions and the edge intensity differs at different locations. So, an edge detector may detect only strong edges and detected edges may be an incomplete parts of an whole object's boundary. Due to this property of gaseous objects, it is not easy to distinguish the real edges of gaseous objects from the noisy-like edges such as leaves. Our algorithm uses two criteria of edge intensity and edge's line connectivity, then applies fuzzy set so as to obtain the proper threshold of the edge detector

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권2호
• /
• pp.37-40
• /
• 2015

본 논문에서는 이항트리의 2-에지번호매김에서 선형적 에지번호매김 방법, 변형된 에지번호매김 방법 그리고 혼합형 에지번호매김 방법들을 제안한다. 이러한 연구결과는 최대 연결도를 갖는 신뢰성이 높은 상호연결망의 일종인 원형군 그래프(circulant graph)의 점프열(jump sequence)로 에지번호들을 사용하면 이항트리를 스패닝 트리로 갖고 최적방송이 가능한 다양한 위상들을 설계할 수 있다.

• Journal of applied mathematics & informatics
• /
• 제38권1_2호
• /
• pp.189-200
• /
• 2020

Let G be a simple connected graph with n vertices and m edges. Denote by d₁ ≥ d₂ ≥ ⋯ ≥ d_n > 0 and d(e₁) ≥ d(e₂) ≥ ⋯ ≥ d(e_m) sequences of vertex and edge degrees, respectively. If vertices v_i and v_j are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳_α(G) = ∑_i~j(d_i + d_j)^α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳_α(G) and 𝒳_α-1(G). Then we use it to obtain some new bounds for 𝒳_α(G).

• 한국정보통신학회논문지
• /
• 제20권2호
• /
• pp.415-420
• /
• 2016

선분 그래프(interval graph) G=(V,E)는 직선 상의 선분들을 나타내는 정점 집합 V와 간선 $(i,j){\in}E$는 선분 i와 j가 교차함을 나타내는 간선들의 집합 E로 이루어진다. 본 논문에서는 그래프의 여러 특성 중에서 정점 연결성(vertex connectivity)에 주목한다. 특별히 선분들이 겹쳐지는 모습으로 선분 그래프의 정점 연결성을 나타낸다. 또한 선분 그래프에서 정점이나 간선이 추가 되거나 삭제되는 완전 동적 (fully dynamic) 환경에서 정점 연결성을 계산하는 효율적인 알고리즘을 제안할 것이다. 특별한 형태의 선분 트리(interval tree)를 사용하여 새로운 선분이 추가되거나 삭제되는 상황 하에서 정점 연결성을 계산하고 트리를 유지하는데 O(logn) 시간이 소요됨을 보일 것이다.

• 전자통신동향분석
• /
• 제33권6호
• /
• pp.24-33
• /
• 2018

In the age of IoT, in which everything is connected to a network, there have been increases in the amount of data traffic, latency, and the risk of personal privacy breaches that conventional cloud computing technology cannot cope with. The idea of edge computing has emerged as a solution to these issues, and furthermore, the concept of ultra-low power edge intelligent semiconductors in which the IoT device itself performs intelligent decisions and processes data has been established. The key elements of this function are an intelligent semiconductor based on artificial intelligence, connectivity for the efficient connection of neurons and synapses, and a large-scale spiking neural network simulation framework for the performance prediction of a neural network. This paper covers the current trends in ultra-low power edge intelligent semiconductors including issues regarding their technology and application.

• 대한수학회보
• /
• 제58권1호
• /
• pp.31-46
• /
• 2021

Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1360-1363
• /
• 1987

Two edge detection methods are devised and tested. First one makes use of mean-difference between two connected regions after bimodal thresholding within a local window. It appears experimentally to provide reduced edge width maintaining good connectivity. It seems due to the use of the threshold obtained from a larger neighborhood. Second one uses additionally the gradient information to detect approximate zero crossing points of second directional derivative. This provides edges thinned nearly to one pixel width.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.857-858
• /
• 2008

This paper proposes a new fast algorithm that detects the lanes on the road using Moore-Neighbor edge trace algorithm, which traces the edge elements by searching the connectivity in eight direction window. The detected line components are connected if they have the same orientation on the same line. The proposed algorithm is faster than other conventional algorithms since it tests only the connectivities of the line segments. The performance of the proposed algorithm has tested by the experiments to test how fast and accurate.