• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2009

In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.262-267
• /
• 2017

The number of shops needed for the fabrication of a sphere type cargo tank for an LNG carrier is proportional to the size of the tank to be constructed. Due to the limitations of facility investment, it is difficult to fabricate various size tanks with a perfectly spherical shape in the (factory). An efficient method of increasing the capacity of the cargo tank is to extend the conventional sphere type LNG tank vertically by inserting a cylindrical shell structure. In this study, equations for the dynamic pressure distribution due to horizontal acceleration are derived for a sphere type LNG tank with central extension. The derived equations can be easily applied to the design and structural assessment of a sphere type LNG tank with central extension. Furthermore, the results of this study can be combined with the static design loads previously reported by Shin & Ko [9], in order to establish a simplified analysis method which enables a precise initial estimate to be obtained, thereby obviating the need for a time consuming finite element analysis.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.161-170
• /
• 1998

기존에 건설된 교통시설의 운영효율을 극대화하기 위한 지능형 교통체계의 한 분야인 ATIS는 도로를 이용하는 통행자에게 편리성을 제공하는 동시에 도로를 효율적으로 운영할 수 있는 정보체계이다. ATIS 체계하에서 통행자에게 신뢰성 있는 정보를 제공하기 위해서는 교차로서의 회전에 의한 지체를 정확하게 반영함은 물론이고 실시간으로 변화하는 교통상황을 반영할 수 있는 동적인 최단경로 탐색 알고리즘이 요구된다. 하지만 기존에 발표된 동적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 탐색알고리즘 조차 회전에 대한 정보를 정확히 반영하지 못한다. 본 연구에서는 이러한 이유에서 알고리즘 내부에서 회전을 반영하기 위해 수정형 덩굴망 알고리즘의 표지기법을 이용하여 동적인 최단경로 탐색알고리즘을 개발하였다. 본 연구에서 개발한 동적 최단경로 탐색 알고리즘은 정적인 상태의 수정형 덩굴망 알고리즘에 시간에 따라 변화하는 교통상황을 반영하기 위해 시간에 대한 변수를 추가하였다. 이렇게 해서 알고리즘은 시간대별로 변화하는 통행시간을 고려하여 최단 경로를 탐색하게 되며 출발시점을 기준으로 표지를 설정하여 모든 앞선 시간에 대해 경로를 고려하도록 하였다. 매 단계에서 전 노드를 추적하여 회전에 관한 정보를 반영하도록 하였다. 따라서 본 연구에서 개발한 최단경로 탐색 알고리즘은 교차로에서의 회전에 대한 정보와 통행금지 등을 정확히 반영하며 실시간으로 변화하는 통행시간을 반영함으로써 신뢰성 있는 노선 정보를 ATIS를 이용하는 통행자들에게 제공하는데 활용될 수 있는 기법이다.적으로 세부적 차종분류로 접근한다.의 영향들을 고려함으로써 가로망 설계 과정에서 가로망의 상반된 역할인 이동성과 접근성의 비교가 가능한 보다 현실적인 가로망 설계 모형을 구축하고자 한다. 지금까지 소개된 가로망 설계모형들은 용량변화에 대한 설계변수의 형태에 따라 이산적 가로망 설계 모형과 연속적 가로망 설계모형으로 나뉘어지게 된다. 본 논문의 경우, 계산속도의 향상 측면에서는 연속적 가로망 설계 모형을 도입할 수 있지만, 이때 요구되는 도로용량이 이산적인 변수(차선 수)로 결정되어야만 신호제어 변수를 결정할 수 있기 때문에, 이산적 가로망 설계 모형이 사용된다. 하지만, 이산적 설계모형의 경우 조합최적화 문제이므로 정확한 최적해를 구하기 위해서는 상당한 시간이 소요되며, 경우에 따라서는 국부 최적해에 빠지게 된다. 이러한 문제를 극복하기 위해, 우선 이상적 모형의 근사화, 혹은 조합최적화문제를 위해 개발된 Simulated Annealing기법의 적용, 연속적 모형의 변수를 이산화하는 방법 등 다양한 모형들을 고려해 본 뒤, 적절한 모형을 적용할 것이다. 가로망 설계 모형에서 신호제어를 고려하기 위해서는 주어진 가로망에 대한 통행 배정과정에서 고려되는 통행시간을 링크통행시간과 교차로 지체시간을 동시에 고려해야 하는데, 이러한 문제의 해결을 위해서 최근 활발히 논의되고 있는 교차로에서의 신호제어에 대응하는 통행배정 모형을 도입하여 고려하고자 한다. 이를 위해서 지금까지 연구되어온 Global Solution Approach와 Iterative Approach를 비교, 검토한 뒤 모형에 보다 알맞은 방법을 선택한다. 차량의 교차로 통행을 고려하는 perf

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.3
• /
• pp.307-312
• /
• 2013

The interest in reducing the emissions and increasing the fuel economy of ICE vehicles has prompted research on hybrid vehicles, which come in the series, parallel, and power-split types. This study focuses on the series-type hybrid electric vehicle, which has a simple structure. Because each component of a series hybrid vehicle is larger than the corresponding component of the parallel type, the sizing of the vehicle is very important. This is because the performance may be greater or less than what is required. Thus, in this research, the optimal fuel economy was determined and simulated in a real-world system. The optimal sizing was achieved based on the motor, engine/generator, and battery for 13 cycles, where DP was used. The model was developed using ASCET or a Simulink-Amisim Co-simulation platform on the rapid controller prototype, ES-1000.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.19-26
• /
• 2016

In this paper, the dynamic buffering based smart OTT platform was proposed, and analyzed for adaptive bit-rate video delivery with the optimization of HLS (HTTP Live Streaming). This platform consists of the software platform between sever and client which detects the bandwidth capacity, and adjusts the quality of the streaming for multiple bit-rates resolutions. In order to apply adaptive buffering, two buffers are added to the basic HLS player, and each buffer is responsible for constantly buffering a previous and the next channels relative to the current channel. This adaptive transmitting with smart OTT platform is superior to delivering a static video file at a single buffering, because the video stream of adaptive double buffers can be switched streaming according to client's available network speed. As a result, this proposed smart OTT can be cooperated to the application of HLS server with segmented H.265 MPEG-2 TS video & m3u8 files with its information based on the optimized transmission channel state of live and VOD, and applied to PLC transmission, too.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.1
• /
• pp.50-61
• /
• 2014

Operating small cell with existing macro cell is of interest in wireless communication technology to enhance network capacity. Closed-access small cell allows the access of users registered in it and causes severe interference to nearby users connected to macrocell. We propose a dynamic channel allocation for small cells in the same building that first aim to minimize call-drop of the nearby macrocell users, and then want to reduce interferences between the small cells. Since the interference effect of small cells on the nearby macrocell users mainly depends on the small cells' position, the proposed algorithm includes a self-configuration to flexibly allocate frequency channels according to the variation of downlink quality of the macrocell users. Furthermore the algorithm is very simple and practical, which is main contribution of this paper. We observe that the proposed algorithm provides 82-94% of maximum achievable throughput.

• Applied Chemistry for Engineering
• /
• v.25 no.2
• /
• pp.167-173
• /
• 2014

The adsorption characteristics of the pellet-type adsorbent prepared from water treatment sludge for trimethylamine and ammonia were studied. The surface area and pore volume of the pellet-type adsorbent increased during calcination at $500^{\circ}C$. It was confirmed that the adsorbent prepared from water treatment sludge contained Br$\ddot{o}$nsted and Lewis acid sites. The breakthrough time of the adsorbent for both trimethylamine and ammonia was measured at different adsorbent weights and linear velocities while maintaining constant amounts of trimethylamine and ammonia. The kinetic saturation capacity and the adsorption rate constant for trimethylamine and ammonia were determined at different linear velocities by using the Wheeler equation. It was found that the kinetic saturation capacity and the adsorption rate constant were dependent on the linear velocity. An experimental equation could be derived to predict the breakthrough time of the adsorbent prepared from water treatment sludge for trimethylamine and ammonia at different adsorption conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.887-895
• /
• 2009

This paper proposes a cooperative power allocation with the use of partial channel information (e.g., the average signal-to-noise ratio (SNR) and transmit correlation) in multi-cell dual-hop multi-input single-output (MISO) relay systems. In a dual-hop MISO relay channel, it is desirable to allocate the transmit power between dual-hop links to maximize the end-to-end capacity. We consider the maximization of the end-to-end capacity of a dual-hop MISO relay channel under sum-power constraint. The proposed scheme adaptively allocates the transmit power considering the average channel gain of the target relay and the transmit correlation of the desired and inter-relay interference channel from adjacent relays. It is shown by means of upper-bound analysis that the end-to-end capacity can be maximized by making the angle difference of the principal eigenvectors of the desired and inter-relay interference channel orthogonal in highly-correlated channel environments. Finally, the performance of the proposed scheme is verified by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.528-535
• /
• 2012

This paper proposes silence drop first(SDF) active buffer management algorithm to increase the voice capacity when silence suppression is used. This algorithm finds and drops silence packet rather than voice packet in the queue for resolving buffer overflow of queue. Simulations with voice codec of G.729A and G.711 are performed. By using proposed SDF algorithm, the voice capacity is increased by 84.21% with G.729A and 38.46% with G.711. Further more, SDF algorithm reduces the required link capacity and loosens the silence packet inter-arrival time limit to provide target voice quality compared with that of conventional algorithms.