• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.103-111
• /
• 1999

We find some conditions under which G(f)-sequence of a CW-pair (X, A) is exact. And we also introduce a G(f)-sequence for a CW-triple (X, A, B) and examine when the sequence is exact.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.235-244
• /
• 1996

For a self-map f of a CW-pair (X, A), we introduce the G(f)-sequence of (X, A) which consists of subgroups of homotopy groups in the homotopy sequence of (X, A) and show some properties of the relative homotopy Jian groups. We also show a condition for the G(f)-sequence to be exact.

• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.281-294
• /
• 1998

In this paper, we extend the G-sequence of a CW-pair to the G-sequence of a map and show the existence of a map with nonexact G-sequence. We also give an example of a finite CW-pair with nontrivial $\omega$-homology in high order.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.4
• /
• pp.28-36
• /
• 2009

Sequence-Pair(SP) model represents the topological relation between modules. In general, SP model based floorplanners search solutions using Simulated-Annealing(SA) algorithm. Several SA based floorplanning techniques using SP model have been published. To improve the performance of those techniques they tried to improve the speed for evaluation function for SP model, to find better scheduling methods and perturb functions for SA. In this paper we propose a two phase SA based algorithm. In the first phase, white space between modules is reduced by applying compaction technique to the floorplan obtained by an SP. From the compacted floorplan, the corresponding SP is determined. Solution space has been searched by changing the SP in the SA framework. When solutions converge to some threshold value, the first phase of the SA based search stops. Then using the typical SA based algorithm, ie, without using the compaction technique, the second phase of our algorithm continues to find optimal solutions. Experimental results with MCNC benchmark circuits show that how the proposed technique affects to the procedure for SA based floorplainning algorithm and that the results obtained by our technique is better than those obtained by existing SA-based algorithms.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.491-506
• /
• 2006

In this paper, we extend the concept of the group ${\varepsilon}(X)$ of self homotopy equivalences of a space X to that of an object in the category of pairs. Mainly, we study the group ${\varepsilon}(X,\;A)$ of pair homotopy equivalences from a CW-pair (X, A) to itself which is the special case of the extended concept. For a CW-pair (X, A), we find an exact sequence $1\;{\to}\;G\;{\to}\;{\varepsilon}(X,\;A)\;{to}\;{\varepsilon}(A)$ where G is a subgroup of ${\varepsilon}(X,\;A)$. Especially, for CW homotopy associative and inversive H-spaces X and Y, we obtain a split short exact sequence $1\;{\to}\;{\varepsilon}(X)\;{\to}\;{\varepsilon}(X{\times}Y,Y)\;{\to}\;{\varepsilon}(Y)\;{\to}\;1$ provided the two sets $[X{\wedge}Y,\;X{\times}Y]$ and [X, Y] are trivial.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.598-603
• /
• 2008

Sequence-Pair(SP)는 플로어플랜을 표현하는 모델 중 하나로써, 일반적으로 SP 모델을 사용하는 플로 어프래너 (floorplanner)는 Simulated-Annealing (SA) 알고리즙을 통해 해 탐색 과정을 수행한다. SP 모델을 이용한 다양한 논문에서 플로어플랜 성능 향상을 위해 평가함수의 개선과 스케줄링 기법 향상을 모색하였으며, 평가함수의 경우 O(nlogn) 시간 알고리즘이 존재한다. 본 논문에서는 SP 모델을 이용한 SA 기법에서 SA의 해 탐색 과정 중 초기 해 탐색 시점에서 좋은 해를 빠르게 찾을 수 있는 방법을 제안한다. 제안 기법은 기존의 SA 프레임펙을 수정한 2단계 SA 알고리즘으로써 SP에 대응하는 배치를 압축하고 압축한 배치를 역변환하는 과정으로 구성된다. 실험과 결과를 통해 제안기법의 효과를 보이며, 평균적으로 동일한 SA 환경 하에서 제안기법이 최종결과 면에서 우수함을 보인다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.943-946
• /
• 1988

A simple method is proposed for determining the frequency response function G(j.omega.) of a system using a pair of characteristic M-sequences (maximum length linear feed back shift register sequence). When a characteristic M-sequence is sampled with q$_{1}$ and q$_{2}$ both of which are coprime with N, where N is the period of the M-sequence, the obtained pair of sequences have conjugate complex frequency spectrum. Making use of this fact, two charcteristic M-sequences having conjugate complex frequency spectrum are applied to a system to be measured. Since the magnitude of spectrium of M-sequence is known, the gain of G(j.omega.) is directly obtained from the Fourier transform of the system output. The phase of G(j.omega.) is obtained simply by taking the average of the two phases of output spectrum.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.103-111
• /
• 2014

Let X be a uniformly convex Banach space, and S, T be pair of mean nonexpansive mappings. Some necessary and sufficient conditions are given for Ishikawa iterative sequence converge to common fixed points, and we prove that the sequence of Ishikawa iterations associated with S and T converges to the common fixed point of S and T. This generalizes former results proved by Z. Gu and Y. Li [4].

• Journal of the Chungcheong Mathematical Society
• /
• v.9 no.1
• /
• pp.89-99
• /
• 1996

We introduce and study certain subgroups of homotopy groups which contain evaluation subgroups and use these subgroups to obtain a sequence similar to homotopy sequence of fibration. We use the sequence to calculate evaluation subgroups or generalized evaluation subgroups of some topological pair.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.461-472
• /
• 2007

The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.