• 월간 기계설비
• /
• s.306
• /
• pp.112-115
• /
• 2016

• Journal of Advanced Navigation Technology
• /
• v.7 no.1
• /
• pp.14-21
• /
• 2003

We investigated the optimum pump light power compensating distorted WDM signal due to both chromatic dispersion and self phase modulation (SPM). The considered system is $3{\times}40$ Gbps intensity modulation direct detection (IM/DD) WDM transmission system with path-averaged intensity approximation (PAIA) mid-span spectral inversion (MSSI) as compensation method. This system have highly nonlinear dispersion shifted fiber (HNL-DSF) as nonlinear medium of optical phase conjugator (OPC) in the mid-way of total transmission line. We confirmed that HNL-DSF is an useful nonlinear medium in OPC for wideband WDM transmission, and the excellent compensation is obtained when the pump light power of HNL-DSF OPC was selected to equalize the conjugated light power into the second half fiber section with the input WDM signal light power depending on total transmission length. By this approach, it is verified the possibility to realize a long-haul high capacities WDM system by using PAIA MSSI compensation method, which have HNL-DSF OPC with optimal pump light power depending on transmission length.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.286-288
• /
• 2004

소스 호스트와 목적지 호스트간 경유 경로를 패킷 헤더에 모두 포함하는 DSR(Dynamic Source Routing)은 경유 호스트 수 증가에 비례 칠서 패킷 헤더와 개별 호스트들이 유지하는 라우트 캐쉬의 크기가 커져야 한다. 따라서 경로 크기와 선형적 관계로 유발되는 확장성 문제로 DSR을 수천 개 이상의 호스트로 구성 되는 대규모 애드-혹 망에 적용하기 어렵다. IETF(Internet Engineering Task Force)는 이러한 단점의 회피 방법으로 Flow State 메카니즘을 제안 하고 있다. 그러나 이 방법은 Route Discovery를 위한 Route Request 와 Route Response 패킷에 전체 경로를 포함 해야 하는 것은 물론 Route Cache에도 전체 경로를 저장 해야 하기 때문에 DSR 확장성 문제를 해결 할 수 없다. 본 논문에서는 경로 크기에 비례해 증가하는 DSR의 오버헤드를 패킷 헤더는 6-hoP, 라우트 캐쉬는 12-hoP 크기로 한정 하는 경로 분할 라우팅 방법을 제안한다.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.621-638
• /
• 2003

As demand of XML documents in the Web increases, Web service applications that manage XML documents as their resource are increasing. The view mechanism for XML data could be considered for effective in query processing in these Web service applications. If the XML query results are maintained as XML materialized views and their relevant XML query is processed using them, the query response time could be reduced. There are two types of processing an in path expression, which is one of the core features of XML query languages, using XML materialized views. One is the type where the complete query result is obtained from the materialized view, and the other is the type where some of the result is obtained from the materialized view and the rest is from the underlying XML documents. In this paper, we investigate the second type. An XML query in this paper is an XML path expression which is one of the core features of XML query languages. We first describe the storage structures of the XML materialized views derived from the underlying XML documents in the XML repository. Then, we propose the algorithms to decompose a given XML query into the subquery against the materialized view and the subquery against the underlying XML documents, and to integrate the results of these subqueries. Through performance evaluation, we figure out the condition under which our XML query decomposition using materialized views is more effective than the conventional processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.939-947
• /
• 2001

이 논문에서는 직접수열 부호분할 다중접속 시스템의 여러 경로 감쇄 환경에서 MMSE 검파기의 성능을 분석한다. MMSE 필터는 출력단에 나머지 쓰는 이의 간섭 성분이 남아 있다. 따라서 비트 오류율을 계산하려면 다른 쓰는 이 신호의 조합을 모두 생각해야 하므로, 쓰는 이 수에 따라 지수적인 계산량이 필요하다. 특히 여러 경로로 수신한 신호를 결합하여 심볼 결정을 할 경우, 각 쓰는 이의 모든 경로에 나머지 간섭이 영향을 미치므로, 이들 모든 조합을 다 고려하여 계산하기는 실질적으로 불가능하다. 여기서는 MMSE 검파기의 성능을 유도하기 위하여, 필터의 출력단에서 신호를 제외한 나머지 간섭과 배경 잡음 성분을 정규 분포로 근사한다. 이 경우 필터의 출력값을 상관관계를 갖는 정규분포의 잡음이 신호에 더해진 형태로 모형화 할 수 있으므로, 다른 쓰는 이 신호의 조합에 상관없이 성능 분석을 할 수 있다. 쓰는 이 수와 수신 경로 수를 변화시켜 가며 상관제거기와 성능을 비교하고, 정확도를 확인하였다.

• Microbiology and Biotechnology Letters
• /
• v.16 no.5
• /
• pp.421-426
• /
• 1988

Twenty-nine bacterial isolates capable of growing on aniline as n sole source of carbon and nitrogen were obtained. Ten of these isolates were identified. Nine isolates were Identified as Pseudomonas spp. and one was Acinetobacter sp.. Five strains among 29 isolates had one or several plasmids. Four of these five strains utilized aniline through meta pathway and one through ortho pathway. Pseudomonas acidovorans 4A1 which utilized aniline through meta pathway harbored a plasmid of ca. 230 kilobases shown to be involved in aniline metabolism.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1170-1182
• /
• 2004

A novel 4-way pipelined processing architecture is presented for three-step search block-matching motion estimation. For the 4-way pipelined processing, we have developed a method which divides the current block and search area into 4 subregions respectively and processes them concurrently. Also, we have developed memory partitioning method to access pixel data from 4 subregions concurrently without memory conflict. The architecture has been designed and simulated with C language and VHDL. Experimental results show that the proposed architecture achieves a high performance for real time motion estimation.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.131-137
• /
• 2007

I intend to seek the shortest path which an aircraft safely flies to its destination through the shadow volume of three dimensional terrain which propagation does not extend. Herein, I propose a method in which a relatively wide shadow volume is divided with a polygon type of block polygon, a path up to the intermediate destination is sought in the divided block polygons according to the weight, and then, the shortest path up to the final destination is sought by repeating courses for seeking a destination again from the adjacent polygon based on the starting point of the intermediate destination within the divided polygon. The shortest path was searched by using the revised algorithms which apply to a critical angle from graph growth algorithms on the shadow volume which propagation on the actual three dimensional terrain does not extend to. The experiment shows that a method proposed in this paper creates effective flying curves.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.1-7
• /
• 2003

In this paper, we propose load balanced routing and wavelength assignment (RWA) algorithm for static model. The proposed algorithm arranges the routing paths over the link uniformly and assigns routing paths according to the length of routing paths orderly. Thus, the proposed algorithm can efficiently utilize the network resources. Through the computer simulation on layered-graph model, we prove that the proposed algorithm improves network throughput and reduces blocking probability comparing to first-fit algorithm [1］. Moreover, the proposed algorithm considerably reduces computational time.