• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.88-90
• /
• 2003

라우터의 If 주소검색은 라우터에 도착한 If 패킷의 목적지 주소를 이용하여 적절한 다음-홉 주소를 검색하고 결정하는 것이다. IP 주소검색은 라우터 성능의 병목지정으로써 고속 백본망에 필요한 초고속 라우터 개발에 필수적인 부분이다. 현대적인 고속 라우터는 초당 수백 안개 이상의 IP 패킷을 처리할 수 있는 능력이 필요하다. 본 논문은 보통의 Pentium CPU에서 OC-48 링크 수준의 IP 주소검색을 실시할 수 있는 빠른 검색방법을 소개한다. 본 논문에서는 데이터 압축기법으로 사용되는 RLC(Run Length Coding)와 유사한 방법을 사용하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.98-99
• /
• 2020

최근 다양한 응용 분야에서 딥러닝을 적용한 사례가 나오고 있으며, 딥러닝 네트워크 경량화 또는 압축 기법을 적용해 정확도는 최대한 유지하면서 에너지 효율을 개선하려는 연구도 활발하게 이루어지고 있다. 이에 본 논문에서는 딥러닝 추론 과정에서 중간 데이터로 도출되는 활성화 데이터의 압축을 위해 연속 길이 부호화 방법을 적용해보고 압축률과 개선점에 대해 분석 한다.

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.7-18
• /
• 2000

KS-SIGNAL, a traffic signal optimization model for coordinated arterials, is an optimization model using the mixed integer linear Programming that minimizes total delay on arterials by optimizing left-turn Phase sequences. However, the Previous version of KS-SIGNAL had a difficulty in reducing computation speed because the related variables and constraints multiply rapidly in accordance with the increase of intersections. This study is designed to propose a new model, improving optimizing computation speed in KS-SIGMAl, and evaluate it. This Paper Puts forth three kinds of methodological approaches as to achieve the above goals. At the first step to reduce run-time in the proposed model objective function and a few constraints are Partially modified, which replaces variable in related to queue clearance time with constant, by using thru-movements at upstream intersection and the length of red time at downstream intersection. The result shows that the run-time can be reduced up to 70% at this step. The second step to load the library in LINDO for Windows, in order to solve mixed integer linear programming. The result suggests that run-time can be reduced obviously up to 99% of the first step result. The third step is to add constraints in related to left-turn Phase sequences. The proposed methodological approach, not optimizing all kinds of left-turn sequences, is more reasonable than that of previous model , only in the view of reducing run-tim. In conclusion, run-time could be reduced up to 30% compared with the second results. This Proposed model was tested by several optimization scenarios. The results in this study reveals that signal timing plan in KS-SIGNAL is closer to PASSER-II (bandwidth maximizing model) rather than to TRANSYT-7F(delay minimizing model).

• Journal of The Korean Astronomical Society
• /
• v.27 no.1
• /
• pp.13-29
• /
• 1994

We have constructed a 3-dim hydrodynamics code called BTSPH. The fluid dynamics part of the code is based on the smoothed particle hydrodynamics (SPH), and for its Poisson solver the binary tree (BT) scheme is employed. We let the smoothing length in the SPH algorithm vary with space and time, so that resolution of the calculation is considerably enhanced over the version of SPH with fixed smoothing length. The binary tree scheme calculates the gravitational force at a point by collecting the monopole forces from neighboring particles and the multipole forces from aggregates of distant particles. The BTSPH is free from geometric constraints, does not rely on grids, and needs arrays of moderate size. With the code we have run the following set of test calculations: one-dim shock tube, adiabatic collapse of an isothermal cloud, small oscillation of an equilibrium polytrope of index 3/2, and tidal encounter of the polytrope and a point mass perturber. Results of the tests confirmed the code performance.

• Journal of Welding and Joining
• /
• v.14 no.6
• /
• pp.48-57
• /
• 1996

The weldability of high purity aluminum-lithium binary alloys has been investigated using the Varestraint test. Autogenous GTAW (gas-tungsten-arc-welds) were run along specimens of different lithium concentration using three sets of welding parameters. Welding voltage was held constant at 10 volts. Welding current (70∼100 amps) and travel speed (23∼33 cm/min) were the parameter varied. Hot-tearing susceptibility varied with lithium content and exhibited a steep peak at 2.6 weight percent lithium. Depth of penetration increased with increasing heat input and lithium concentration. The susceptibility is influenced by the wettability of dendrites by the interdendritic eutectic liquid as well as the time available for back-Siting by eutectic liquid. The welding condition of welding current 70A and travel speed 23 cm/min was showed good resistance to cracking in aluminum-lithium alloys. Suggestions for improving weld cracking resistance are also provided.

• Korean Management Science Review
• /
• v.17 no.3
• /
• pp.73-95
• /
• 2000

In Korea, the distribution channel for agricultural products is notorious for its complexity and ineffectiveness. In this sense, the Agricultural Cooperative has tried to clarify the distribution channel and reduce its length. However, there still exist much room for improvements. The Internet shopping mall specific for agricultural product, therefore, is drawing much attention because it can reduce the length of distribution channel drastically and improve effectiveness from the distribution perspective. To test the validity of such Internet-driven shopping mall, we gathered questionnaire data from the Internet based Hannaro Shopping Mall which is run directly by the Agricultural Cooperative. We performed experiments respectively for the two groups of operating personnel and consumers. Experimental results showed that several important factors can be identified which are significant statistically and deemed to have meaningful relationship with performance variables. Our results also showed that the Internet shopping mall has a great potential for improving the effectiveness of the distribution channel of the agricultural products.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.308-317
• /
• 2008

This research investigates economic characteristics of 2 of 2 runs rules under the Shewhart $\bar{X}$ control chart scheme. A Markov chain approach is employed in order to calculate the in-control average run length (ARL) and the average length of analysis cycle. States of the process are defined according to the process conditions at sampling time and transition probabilities are derived from the state definitions. A steady state cost function is constructed based on the Lorezen and Vance(1986) model. Numerical examples show that 2 of 2 runs rules are economically superior to the Shewhart $\bar{X}$ chart in many cases.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.3
• /
• pp.115-122
• /
• 2008

Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem(FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.120-129
• /
• 1996

This paper presents an efficient block segmentation and classification using the edge information of the document image. We extract four prominent features form the edge gradient and orientaton, all of which, and thereby the block clssifications, are insensitive to the background noise and the brightness variation of of the image. Using these four features, we can efficiently classify a document image into the seven categrories of blocks of small-size letters, large-size letters, tables, equations, flow-charts, graphs, and photographs, the first five of which are text blocks which are character-recognizable, and the last two are non-character blocks. By introducing the clumn interval and text line intervals of the document in the determination of th erun length of CRLA (constrained run length algorithm), we can obtain an efficient block segmentation with reduced memory size. The simulation results show that the proposed algorithm can rigidly segment and classify the blocks of the documents into the above mentioned seven categories and classification performance is high enough for all the categories except for the graphs with too much variations.

• Journal of Korean Society for Quality Management
• /
• v.35 no.1
• /
• pp.24-34
• /
• 2007

This paper investigates the average run length (ARL) of a selectively moving average (S-MA) control chart. The S-U chart is designed to detect shifts in the process mean. The basic idea of the S-MA chart is to accumulate previous samples selectively in order to increase the sensitivity. The ARL of the S-MA chart was shown to be monotone decreasing with respect to the decision length in a previous research [3]. This paper derives the steady-state ARL in a closed-form and shows that the monotone property is resulted from head-start assumption. The steady-state ARL is shown to be a sum of head-start ARL and an additional term. The statistical design procedure for the S-MA chart is revised according to this result. Sensitivity study shorts that the steady-state ARL performance is still better than the CUSUM chart or the Exponentially Weighted Moving Average (EWMA) chart.