• Korean Journal of Mathematics
• /
• 제27권3호
• /
• pp.613-627
• /
• 2019

Consider a connected molecular graph G = (V, E) where V is the set of vertices and E is the set of edges. In G, vertices represent the atoms and edges represent the covalent bonds between atoms. In graph G, every edge (say) e = uv will be connected by two atoms u and v. The edge Szeged index is a topological index which has been introduced by Ivan Gutman. In this paper, we have computed edge Szeged indices of a hydrocarbon family called Benzene ring and is denoted by $(BR)_{n{\times}n}$.

• 한국정보통신학회논문지
• /
• 제13권1호
• /
• pp.53-59
• /
• 2009

무선 애드록 네트워크의 특수한 형태인 무선 메쉬 네트워크는 최근 새로운 연구과제의 초석으로 주목받고 있다. WMN의 제한적인 동작 환경으로 인하여 효과적인 연결 Dominating set 구성은 브로드캐스팅, 라우팅, 혹은 가상 백본을 구성을 위한 방법 중 하나로 중요한 관심 대상이다. 본 논문에서 분산적인 방법을 토대로 네트워크에서 최소지연과 효율적인 대역폭 사용을 통하여 성능 향상을 시키기 위하여 Interference와 Bandwidth을 Dominating set 구성 파라미터로 사용한 연결 Dominating set 구성 알고리즘을 제안한다. 시뮬레이션을 통하여 제안된 알고리즘은 최대의 주파수 대역폭을 가진 링크와 연결된 최소의 연결 Dominating set이 구성됨으로써 네트워크 전체 성능이 향상됨을 보여준다.

• 한국정보처리학회논문지
• /
• 제4권2호
• /
• pp.596-605
• /
• 1997

복소 평면상의 임의의 점을 c값으로 고려한 2차 복소함수,$f(Z)=z^2+c$의 동력한 시스템은 초기 값0을 대입함으로써 획득된 순열의 발산성에 따라 C값을 분류한 만델브로트 집합을 제공한다[2]. 각 화소의 발산성을 나타내는 전형적인 만델브로트 집합 영상의 생성 에 소요되는 단축하기 위해 영역분할법(divide-and-conquer)과 삼각형을 이용한 경계 선 추적법( riangular boundary tracing)들이 제안되었다[4,6]그러나, 영역분할법은 만델브로트 집합의 생성에 영향을 주지 못하는 화소에 대한 순열의 발산여부를 조사하고 , 삼각형을 이용한 경계선 추적법은 8-연결성으로 연열된 일부 영상을 표현하지 못 하는 단점이 있다. 본 논문에서는 삼각형 추적 기법의 문제점을 해결한 화소의 8-연결성을 이용한 경계선 추적 알고리즘을 제안한다. 제안된 경계선 추적 기법은 8-연결성에 기초한 경계선 추적으로 만델브로트 영상을 생성할 때 영향을 주지 못하는 화소에 대한 발산 검사를 하지 않을 뿐만 아니라, hairly 구조와 같이 8-연결성을 갖는 만델 브로트 집합의 정확한 표현을 얻을 수 있다.

• 대한수학회지
• /
• 제46권4호
• /
• pp.813-826
• /
• 2009

In this paper, we generalize the notions of preserving and strongly preserving maps to arbitrary set based topological categories. Further, we obtain characterizations of each of these concepts as well as interprete analogues and generalizations of theorems of Gerlits at al [20] in the categories of filter and local filter convergence spaces.

• 대한수학회보
• /
• 제34권2호
• /
• pp.225-231
• /
• 1997

In 1970's Goodykoontz gave characterizations of connectedness imkleinen and locally arcwise connectedness of $2^X$ only at singleton set {x} ${\epsilon} 2^X$ [5,6,7]. In [7], we gave necessary conditions for C(X) to be arcwise connected im kileinen at any point $A {\epsilon} C(X)$.

• 대한수학회보
• /
• 제54권5호
• /
• pp.1851-1857
• /
• 2017

We study relations between two descriptions of closed orientable 3-manifolds: as branched coverings and as Heegaard splittings. An explicit relation is presented for a class of 3-manifolds which are branched cyclic coverings of connected sums of lens spaces, where the branching set is an axis of a hyperelliptic involution of a Heegaard surface.

• Korean Journal of Mathematics
• /
• 제14권1호
• /
• pp.65-70
• /
• 2006

In this article, we mention some subsequent developments of the theory of cluster sets, and present a new boundary cluster set for a simply connected domain in the complex plane and its applications.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2000년도 전력전자학술대회 논문집
• /
• pp.493-497
• /
• 2000

A battery is the device that transforms the chemical energy into the direct-current electrical energy without a mechanical process. Unit cells are connected in series to obtain the required voltage while being connected in parallel to organize capacity for load current. Because the voltage drop down in one set of battery is faster than in two one it may result in the low efficiency of power converter with the voltage drop and cause the system shutdown. However when the system being shutdown. However when the system being driven in parallel a circular-current can be generated,. It is shown that as a result the new batteries are heated by over-charge and over-discharge and the over charge current increases rust of the positive grid and consequently shortens the lifetime of the new batteries. The difference between the new batteries and old ones is the amount of internal resistance. In this paper we can detect the unbalance current using the microprocessor and achieve the balance current by adjusting resistance of each set, The internal resistance of each set becomes constant and the current of charge and discharge comes to be balanced by inserting the external resistance into the system and calculating the change of internal resistance.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.93-107
• /
• 1999

We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

• 대한수학회지
• /
• 제37권1호
• /
• pp.31-44
• /
• 2000

We study a free boundary problem satisfying Bernoulli type boundary condition along which the gradient of a piecewise harmonic solution jumps zero to a given constant value. In such problem, the free boundary splits the domain into two regions, the zero set and the harmonic region. Our main interest is to identify the global shape and the location of the zero set. In this paper, we find the lower and the upper bound of the zero set. In a convex domain, easier estimation of the upper bound and faster disk test technique are given to find a rough shape of the zero set. Also a simple proof on the convexity of zero set is given for a connected zero set in a convex domain.