• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.628-633
• /
• 2010

This paper proposes a block matching algorithm to improve the sub-block matching algorithm that uses partial sub-blocks being a great contribution to the block matching. Unlike the conventional algorithm using the one sub-block group the proposed algorithm uses two sub-block groups. The matching using the small group selects a candidate block to be a good possibility of a similar block with a small computation cost and the additional matching using the large group in the selected block decreases a wrong matching. Simulation results show that the proposed algorithm always has good image quality at the same computation cost as compared to the conventional algorithm and it has an outstanding performance at the matching using a few sub-blocks.

• Electronics and Telecommunications Trends
• /
• v.16 no.6 s.72
• /
• pp.1-8
• /
• 2001

IMT-2000 비동기 시스템은 단말기, 기지국과 무선망 제어국으로 구성되는 무선 접속망 그리고 핵심망 등으로 구성된다. 특히 IMT-2000 비동기 시스템의 무선망 제어국은 기지국과 접속 기능을 가지는 기지국 정합용 무선 접속 서브 시스템, 무선 트래픽 채널의 소프트 핸드오프 처리 기능을 가지는 트래픽 처리용 무선 접속 서브 시스템, 무선망 제어국을 제어하는 무선망 제어국 제어용 서브 시스템, 그리고 회선 및 패킷 교환망을 수용하는 핵심망 및 타 무선망 제어국과의 접속 기능을 수행하는 망 정합용 무선 접속 서브 시스템으로 구성된다. 본 논문에서는 다양한 서비스 품질 파라미터를 갖는 서비스를 지원하기 위한 전달 기능으로서 ATM을 기반으로 하는 ATM 스위치 망을 IMT-2000 비동기 시스템의 무선망 제어국에 적용하여 무선망 제어국의 각 서브 시스템 간 접속시켜 통신 경로 제공 기능을 수행하도록 하였다. 따라서 기지국과 핵심망 사이를 상호 연결하여 음성 및 데이터의 트래픽 정보와 제어 정보를 전달하는 기능을 수한다. 이와 같이 IMT-2000 비동기 시스템에서는 무선망 제어국 내의 서브 시스템과의 접속은 ATM 스위치를 통하여 사용자의 요구에 따라 가변적으로 필요한 대역폭을 제공함으로써 사용자의 요구에 부합되는 통신 수단을 제공할 뿐만 아니라 기존의 IMT-2000 이전 시스템의 서비스 보다는 훨씬 향상된 품질의 패킷 데이터와 멀티미디어 서비스를 포함하는 오디오, 비디오, 그리고 데이터 서비스를 제공할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.823-826
• /
• 2007

유비쿼터스 환경이란 사용자가 원하는 모든 종류의 서비스를 시간 및 장소에 구애받지 않고 사용가능하도록 지원하는 것을 뜻한다. 유비쿼터스 환경에서는 다양한 종류의 디바이스 및 서비스가 산재하며, 유동적인 특성을 가진다. 이러한 환경에서 사용자가 원하는 서비스를 발견하기 위해서 기존에는 서비스 디스커버리 미들웨어(서브네트워크)가 제공되었다. 하지만 이러한 서브네트워크는 상호운용을 지원하지 못한다. 상호 운용의 문제를 해결하기 위하여 OSGi, DomoNet, WSUN 등의 연구가 진행되었다. 이러한 연구 중에서 디바이스 및 서비스 통합을 위한 연구인 WSUN 는 US Broker 를 이용하여 사용자가 모든 서브네트워크의 서비스를 사용할 수 있도록 한다. US Broker 는 서브네트워크의 서비스를 웹 서비스화 하여 레지스트리에 저장 및 활용하며, 각각의 서브네트워크와 통신하기 위해 Adaptor 를 컴포넌트로 갖는다. 본 논문에서는 여러 서브네트워크 중 JINI 를 위한 Adaptor 에 대해 구체화하였다.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.201-213
• /
• 2006

A time-series database is a set of time-series data sequences, each of which is a list of changing values of the object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We argue that index interpolation is fairly useful to resolve this problem. The index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their inherent sizes. For index interpolation, we first decide the sites of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes in the perspective of physical database design. For this, given a set of query sequences to be peformed in a target time-series database and a set of window sizes for building multiple indexes, we devise a formula that estimates the cost of all the subsequence matchings. Based on this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally Prove the optimality as well as the effectiveness of the algorithm. Finally, we perform a series of extensive experiments with a real-life stock data set and a large volume of a synthetic data set. The results reveal that the proposed approach improves the previous one by 1.5 to 7.8 times.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.295-303
• /
• 2008

In general, transform domain adaptive filters show faster convergence speed than the time domain adaptive filters, but the amount of calculation increases dramatically as the filter order increases. This problem can be solved by making use of the subband structure in transform domain adaptive filters. In this paper, to increase the convergence speed on the generalized subband decomposition FIR adaptive filters, a structure of the adaptive filter with subfilter of dyadic sparsity factor in wavelet transform domain is designed. And, in this adaptive filter, the equivalent input in transform domain is derived and, by using the input, the convergence properties for the LMS algorithm is analyzed and evaluated. By using this sub band adaptive filter, the inverse system modeling and the periodic noise canceller were designed, and, by computer simulation, the convergence speeds of the systems on LMS algorithm were compared with that of the subband adaptive filter using DFT(discrete Fourier transform).

• Journal of IKEEE
• /
• v.8 no.1 s.14
• /
• pp.73-78
• /
• 2004

In this paper, it is designed for 5.8GHz Wireless LAN sub harmonic resistive mixer. Sub harmonic resistive mixer is constituted by advantage of sub harmonic mixer and resistive mixer. Sub harmonic resistive mixers mix harmonics of LO with RF and obtain IF frequency. Therefore, it was possible to use decreasing LO frequency than conventional mixers. And, Sub harmonic resistive mixer has low IMD because of using unbiased channel resistance of GaAs FET. When LO power is 13dBm, the conversion loss of manufactured sub harmonic resistive mixer is 10.67 dB. And IIP3 of mixer is 21.5dBm.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.448-460
• /
• 2003

In this paper, we propose a network fault recovery algorithm based on a segment restoration scheme to reduce restoration time and restoration resource. The proposed segment restoration scheme is based on network partitioning which divides a large network into several small subnetworks. The restoration performance of the proposed segment restoration scheme depends on the size and the topology of subnetworks. Since most faults can be restored in a subnetwork, restoration time is reduced obviously. We compare and analyze restoration performance according to the size of subnetworks and restoration schemes. From simulation results, the proposed segment restoration scheme has the shortest restoration time compared with other restoration schemes. Especially the restoration performance of the proposed segment restoration scheme is better than the SLSP, which is also a segment-based restoration scheme, in terms of restoration time and required restoration resource capacity.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2016.02a
• /
• pp.282.2-282.2
• /
• 2016

중적외선 물질에는 Ge, ZnS, ZnSe, Si 등이 있으나 고굴절율이므로 반사가 매우 크게 발생을 한다. 이를 줄이기 위해 다층 박막 무반사 코팅을 일반적으로 사용하지만 열에 취약함, 적합한 물질을 찾는 것이 매우 어려움, 다층 박막으로 제작 시 두께가 매우 두꺼워짐의 단점이 있다. 또한 Ge, ZnS, ZnSe 의 소재는 가격이 Silicon에 비해 매우 비싸다. 그러므로 RCWA(Rigorous Coupled Wavelength Analysis) 시뮬레이션을 이용하여 상대적으로 저렴한 소재임에도 고투과성을 지닌 중적외선용 무반사 실리콘 서브파장구조(Subwavelength Structures, SWSs)를 제안한다. 본 연구에서는 원기둥, 원뿔, 파라볼라, 잘린 원뿔(truncated cone) 등의 형태에 따른 투과율 특성을 파악하여 최적구조가 파라볼라 형태임을 증명하였다. 또한 서브파장구조의 주기, 높이의 특성을 조절하여 공정 시의 종횡비(Aspect ratio)를 고려한 최적형태를 제안하였다. 중적외선 영역($3{\mu}m{\sim}5{\mu}m$)에서 일반 Silicon의 적외선 영역에서 평균 55%의 낮은 투과율을 보이나, 양면에 무반사 구조를 설계 하였을 때 평균 94%의 높은 투과율을 확인할 수 있다. 다양한 형태를 가진 무반사 실리콘 서브파장 구조물을 RCWA 방식으로 계산함으로서 특성을 파악하며 최적구조를 설계 할 수 있다. 또한 단면에 비하여 양면으로 SWSs 구조를 제작할 시 매우 두드러지는 투과특성을 확인할 수 있다. 고굴절율이지만 뛰어난 투과특성을 이용하여 초소형 적외선 카메라 렌즈 뿐만 아니라 적외선 광검출기, 광학 필터 등에 이용 가능할 것으로 예상된다.