• Journal of Power System Engineering
• /
• v.13 no.1
• /
• pp.19-25
• /
• 2009

This paper is a study on the link composition design of a double link type level luffing jib crane using path generation synthesis passing through three precision points according to parameters, the length of backstay, the ratio of fly jib length between two moving hinges to the total length of fly jib, the location of a intermediate passing point etc. when the maximum and minimum working radius of the crane are given. The performance of the crane depends on the deviation of the luffing trajectory at fly jib tip. The luffing trajectories according to the above parameters are analyzed and shown in graphs by the developed computer program. In a real-life design, some trials are needed to arrive at a proper link composition design. Therefore, it is expected that the present computer program can rapidly and exactly deal with a link composition design proper to the design criteria of the crane.

• Journal of Advanced Navigation Technology
• /
• v.23 no.6
• /
• pp.570-576
• /
• 2019

The configuration of dispersion-managed optical link with optical phase conjugator, which is placed at the non-midway of total transmission length, is proposed for implementing of the flexible optical network. The optical phase conjugator is located between the former half transmission section and the latter half transmission section, which are consisted of 6 fiber spans and 14 fiber spans respectively, and the averaged RDPS of each half transmission section are inconsistence. And, the artificial distribution of each fiber span's RDPS, which are gradually increased/decreased as the span numbers are increased, is adopted to compensate for the distorted wavelength division multiplexed channels. From the simulation results, it is confirmed that the compensation in dispersion-managed link configured by a special distribution pattern among 16 proposed patterns, in which the RDPS of each fiber spans are gradually decreased/increased in the former/latter half section with the small deviation, is suitable to compensate for the distorted wavelength division multiplexed channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.855-864
• /
• 2008

Optical link techniques compensating chromatic dispersion and nonlinear effects, which affect distortion of optical signals, generated in single mode fiber are investigated through computer simulation and design rule of these link techniques is proposed for implementation of wideband and long-haul WDM ($24{\times}40$ Gbps) transmission system. The optical link consist of dispersion management (DM) compensating the cumulated dispersion through total transmission line and optical phase conjugation in middle of total transmission line for compensating distorted signals by frequency inversion. DM schemes considered in this research are lumped DM and inline DM. It is confirmed that eye opening penalty (EOP) of overall WDM channels are more improved than those in WDM transmission systems with only optical phase conjugator (OPC), if DM is additionally applied to these systems. And, design rule in both DM schemes are proposed by using effective residual dispersion range. It is confirmed that inline DM is better than lumped DM in the improving EOP of total WDM channels and in effective residual dispersion range.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.211-220
• /
• 2018

The standard data link layer encryption provided by CCSDS has a structure that encodes HDLC frame into it using an AES algorithm. However, CCSDS is standard method has a structure in which the receiving side cannot request a re-activation when noise interference occurs over an unstable channel. SES Alarmed has a structure that enables the receiving side to additionally detect errors and perform re-activation requests in an operational structure similar to that of link encryption in CCSDS. The SES Alarmed related paper was intended to identify the optimum range of thresholds and identify data corruption due to channel noise. In this paper, the focus was on reducing the re-activation process if the HDLC frame, excluding the password Sync code, consistently exceeds any threshold levels. The HDLC frame order was changed and the results of using SES Alarmed were proposed and compared.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.105-115
• /
• 2002

Since NUMA architecture has to access remote memory an interconnection network determines the performance of CC-NUMA system Bus which has been used as a popular interconnection network has many limits to build a large-scale system because of the limited physical scalabilty and bandwidth Dual ring interconnection network composed of high speed point-to-point links is made up for resolving the defects of the bus for large-scale system But it also has a problem that the response latency is rapidly increased when many node are attached to snooping based CC-NUMA system with dual ring In this paper we propose a chordal ring architecture in order to overcome the problem of the dual ring on snooping based CC-NUMA system and design and efficient link controller adopted to this architecture. We also analyze the effects of chordal ring architecture on the system performance and the response latency by using probability driven simulator.

• Journal of Korean Society of Transportation
• /
• v.19 no.2
• /
• pp.61-72
• /
• 2001

기존의 링크교통량으로부터 OD추정모형은 기존 OD에 대한 추정의 종속성이 커, 기존 OD나 관측링크교통량의 오차에 따라 추정결과가 일관적이지 않은 문제점을 가지고 있다. 또한 관측링크교통량의 정확도가 중요함에도 불구하고 차종구분 없이 링크교통량을 이용하여 정보의 손실을 초래하였고 결과적으로 OD 추정력을 저하시켰다. 그렇지만 다차종 링크교통량으로부터 다차종 OD를 구하는 연구는 거의 없었으며, 그 추정결과가 단일차종에 대한 추정결과와 어떻게 다른지에 대한 연구도 전무하였다. 본 연구의 목적은 기존의 OD 추정모형이 기존 OD에 대해 종속성을 가지며 차종구분 없이 모형을 구성함으로써 추정력의 저하를 초래하였음을 밝히고, 이에 대한 대안으로 종속성 문제를 완화하고 차종구분을 통해 OD 추정모형의 추정력을 증진시키자 하는 것이다. 이를 위해 유전알고리즘을 이용한 다차종 OD행렬 추정모형(GAMUC)을 구축하고, 이를 기존의 바이레벨 모형의 IEA 알고리즘 및 다차종으로 확장한 모형(IEAMUC)과 게임이론측면에서 검토하였으며, 사례네트워크에 대해 각 기법을 비교하였다. 본 연구는 유전알고리즘을 이용한 OD 추정기법을 축도로에 적용한 임용택 등(2000)과 이를 네트워크로 확장한 백승걸 등(2000)의 연구를 다차종으로 확장한 것이다. 사례분석 결과 기존 OD의 오차변화나 관측링크교통량의 오차변화 등에 있어 GAMUC가 IEA나 IEAMUC보다 추정력이 양호하여, 실제 OD를 알 수 없는 도시부 네트워크에서 GAMUC 모형의 적용력이 우수하였다. 또한 차종을 구분하지 않은 기존 모형은 실제 OD와는 전혀 다른 OD 구조를 도출할 수 있음을 보였으며, 단일 차종을 여러 차종으로 구분하여 OD를 추정하는 것이 더 양호한 추정력을 확보하는 것으로 나타났다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.371-380
• /
• 1997

A lot of efforts have been made to develop low-cost and reliable broadband optical subscriber loop systems. Here we propose a new loop system with shared ligh sources and remote modulation method. This system uses an external modulation method for both directions and all the light sources are maintained inside a central office. Moreover, the ligh source is not dedicated to each subsriber link but shared among many subscriber links. We expermentally demonstrated that one shared light source could accommodate about 2, 000 deownstream links(2.5 Gb/s per link), 500 upstream links(155 Mb/s per link).

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.708-714
• /
• 2006

The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.