• 한국정보과학회논문지:시스템및이론
• /
• 제26권10호
• /
• pp.1185-1193
• /
• 1999

최적 스택 필터는 시그널 또는 영상의 임의의 특성 정보를 보존하고자 하는 요구조건에 의해 강제된 구조적 제약 하에서 최대의 잡음제거 효과를 얻을 수 있다. 그리고 임계치 분할 특성과 양의 부울 함수에 기반한 이진 영역에서의 처리 특성은 이 필터가 높은 병렬성을 갖고 있음을 보여준다. 본 논문에서는 두 개의 병렬 계산 모델 MCC(Mesh-Connected Computer)와 CCC(Cube-Connected Computer)에서 최적 스택 필터를 위한 1차원 병렬 알고리즘을 개발한다. 최적 스택 필터의 실행 시간은 주로 이진 median 연산에 의해 결정되고 본 논문에서 제안된 알고리즘은 선형 분리성에 의해 이 연산을 구현한다. 이를 바탕으로, M 레벨의 1-D 시그널의 길이가 L이고 윈도우 폭이 N이라고 가정할 때, 제안된 알고리즘은 {{{{root M times root M`` MCC에서 O(L sqrt{M}`) 시간에 그리고 M 개의 PE를 갖는 CCC에서 O(L log M)시간에 수행될 수 있다. 또한 잡음을 더욱 효과적으로 제거하기 위해 윈도우 폭 N을 증가시킬 때, 제안된 병렬 알고리즘의 계산 시간은 일정하게 유지됨을 보인다.Abstract An optimal stack filter achieves the maximum noise attenuation under the structural constraints imposed by the requirement of preserving certain signal or image features. And the filter provides a high parallelism due to the principles of threshold decomposition and binary processing based on positive Boolean functions(PBFs). In this paper, we develop an one-dimensional parallel algorithm for the optimal stack filter on two parallel computation models, MCC(Mesh-Connected Computer) and CCC(Cube-Connected Computer). The running time of the optimal stack filter depends mainly on the binary median operation and our algorithm realizes this operation by the linear separability. Based on this scheme, our parallel algorithm can be performed in {{{{O(L sqrt{M}`) MCC and inO(L log M) time on CCC with M PEs, when the length of M``-valued 1-D signal is L`` and window width is N`` Also, we show that the computation time of our parallel algorithm keeps constant when the window width N increases in order to achieve the best noise attenuation.

• 전기전자학회논문지
• /
• 제23권1호
• /
• pp.338-341
• /
• 2019

본 논문에서는 대표적인 ESD 보호소자인 LVTSCR의 특성을 향상시킨 새로운 구조의 ESD소자를 제안하고 특정 application의 각 요구전압에 최적화된 설계를 위한 N-stack 기술에 대하여 검증한다. 주요 파라미터인 홀딩전압과 트리거전압에 대하여 특성을 파악하고 감내특성의 지표인 온도특성 또한 검증한다. well영역의 추가구성과 기생 npn BJT를 추가로 직렬 연결된 구조를 형성하여 보다 향상된 전기적 특성을 갖는다. 특성 검증을 위해 synopsys 사의 T-cad simulation tool을 이용하였다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제9권1호
• /
• pp.57-61
• /
• 2002

Let G be a connected graph. A pebbling move on a graph G is the movement of taking two pebbles off from a vertex and placing one of them onto an adjacent vertex. The pebbling number f(G) of a connected graph G is the least n such that any distribution of n pebbles on the vertices of G allows one pebble to be moved to any specified, but arbitrary vertex by a sequence of pebbling moves. In this paper, the pebbling numbers of the compositions of two graphs are computed.

• 대한수학회지
• /
• 제47권5호
• /
• pp.925-934
• /
• 2010

A crystallization of a closed connected PL manifold M is a special edge-colored graph representing M via a contracted triangulation. The regular genus of M is the minimum genus of a closed connected surface into which a crystallization of M regularly embeds. We disprove a conjecture on the regular genus of $\mathbb{S}\;{\times}\;\mathbb{S}^n$, $n\;{\geq}\;3$, stated in [J. Korean Math. Soc. 41 (2004), no. 3, p. 420].

• 충청수학회지
• /
• 제14권1호
• /
• pp.7-14
• /
• 2001

Let G be a connected graph. A pebbling move on a graph G is taking two pebbles off one vertex and placing one of them on an adjacent vertex. The pebbling number of a connected graph G, f(G), is the least n such that any distribution of n pebbles on the vertices of G allows one pebble to be moved to any specified, but arbitrary vertex by a sequence of pebbling moves. In this paper, the pebbling numbers of the lexicographic products of some graphs are computed.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• 대한수학회보
• /
• 제26권1호
• /
• pp.69-74
• /
• 1989

Recently one of the present authors [2] asserted that a real hypersurface of a complex space form M$^{n}$ (c), c.neq.0, is of cyclic parallel if and only if AJ=JA and he showed also a complete and connected cyclic-parallel real hypersurface of M$^{n}$ (c), is congruent to type $A_{1}$, $A_{2}$ or A according as c>0 or c<0. A real hypersurface of a complex space form M$^{n}$ (c) is said to be covariantly cyclic constant if the cyclic sum of covariant derivative of the second fundamental form is constant. The purpose of the present paper is to extend theorem 3 and 4 in [2] when the hypersurfaces are of coveriantly cyclic constant, that is a real hypersurface of a complex space form M$^{n}$ (c), c.neq.0, is of covariantly cyclic constant if an only if AJ=JA, and a complete and connected covariantly cyclic constant real hypersurface of M$^{n}$ (c) is congruent to type $A_{1}$, $A_{2}$ or a according as c>0 or c<0.

• Smart Structures and Systems
• /
• 제15권5호
• /
• pp.1293-1309
• /
• 2015

3D two adjacent buildings with different heights founded in different kinds of soil connected with viscous dampers groups, with especial arrangement in plane, were investigated. Soil structure interaction for three different kinds of soil (stiff, medium and soft) were modeled as 3D Winkler model to give the realistic behavior of adjacent buildings connected with viscous dampers under various earthquake excitations taking in the account the effect of different kinds of soil beneath the buildings, using SAP2000n to model the whole system. A range of soil properties and soil damping characteristics are chosen which gives broad picture of connected structures system behavior resulted from the influence soil-structure interaction. Its conclusion that the response of connected structures system founded on soft soil are more critical than those founded on stiff soil. The behavior of connected structures is different from those with fixed base bigger by nearly 20%, and the efficiency of viscous dampers connecting the two adjacent buildings is reduced by nearly 25% less than those founded on stiff soil.

• 대한수학회보
• /
• 제21권2호
• /
• pp.67-75
• /
• 1984

Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

• 대한전기학회논문지
• /
• 제41권7호
• /
• pp.793-801
• /
• 1992

This paper proposes a method of extracting connected strokes and characters in a Hangeul document image represented by a quadtree. Connected strokes are extracted by examining adjacency for each node of a black region to the side of east and south. Then, each character is extracted by the sizes and the relations of connected strokes. This is done by iterative vertical and horizontal manipulation. The result shows all characters are extracted in the same sequence as that of context with space and time efficiency.