• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.175-176
• /
• 2020

본 논문에서는 가상 현실 기기를 이용하여 스택, 큐, 트리 등과 같은 복잡한 자료구조에 대한 학습을 도와주는 학습 지원 시스템을 제안한다. 컴퓨터 프로그래밍에서 적절한 자료구조를 선택함으로써 보다 효율적인 알고리즘을 구현할 수 있으며 프로그램 실행시간, 메모리 용량과 같은 컴퓨팅 자원을 효율적으로 사용할 수 있다. 본 논문에서 제안하는 EZ 학습 시스템은 비전공자의 자료구조 학습에 도움을 주며 특히, 스마트 폰 기반의 가상 현실 기기를 사용하여 학습자의 흥미를 유발하고자 한다. 학습자는 가상공간을 통해 정보를 보다 쉽게 받아들이고, 게임적인 요소를 통해 학습에 대한 집중도를 높일 수 있을 것으로 기대된다. EZ 학습 시스템은 스택 자료형에 대한 개념 설명, 스택 연산자 학습, 미로 탐색을 통한 스택 응용 사례를 제공한다.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.35 no.2
• /
• pp.119-124
• /
• 2015

In this study, we sought to evaluate the growth characteristics and seed productivities of domestic tall fescue that were cultivated with differing combinations of drill widths and nitrogen-application rates in early spring; the examination was conducted at the National Institute of Animal Science, RDA, from 2013 to 2014. The main plots were three widths of 15 cm, 30 cm, and 45 cm, and the subplots were subject to nitrogen-application rates in early spring of 45 kg/ha, 90 kg/ha, 135 kg/ha, and 180 kg/ha. The growth and development characteristics did not vary by treatment in terms of drill width and early-spring nitrogen application. Tall fescue Purumi showed a stable seed productivity of two tons or greater when the drill width was set at 15 cm and 90 kg/ha of nitrogen was applied in early spring. The narrower the drill width, the greater the numbers of both the ears and seeds, while the length of the ear was longer when the drill width was wider. Regarding the influence of the drill width and early-spring nitrogen application on the productivity of seed-producing straw, the dry matter productivity was higher when the drill width was narrower; however, no particular trend was observed with respect to different amounts of fertilizer. The average production amount of the first round of straw after seed gathering was 6,920 kg/ha. The second round produced an average 8,134 kg/ha of dry matter.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.3-11
• /
• 2000

This paper considers the performance of a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme. Loss-sensitive and delay-sensitive traffics are applied to a system with a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Loss-sensitive and delay-sensitive traffics represent sound and data, respectively. Under the TBPJ scheme, the first packet of the loss-sensitive traffic buffer goes into the delay-sensitive traffic buffer with Bernoulli probability p according to system states which 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. TBPJ scheme shows also better performance than that of HOL scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1490-1500
• /
• 1996

One of the important issues for multimedia communications over ATM netowrks is efficient use of net-work resources since transmitting video at low cost requires high utilization of channel bandwidth. In this paper, we propose an effective bandwidth estimation scheme for MPEG sources in ATM networks. It has been known difficult to allocate effective transmission bandwidth to MPEG sources due to its bursty charactersitics. The MPEG traffic stream can bemodeled using five traffic parameters:service rate, burst load ratio, interburst load ratio, burst period, and interburst period. Using these parameters, a transmission bandwidth for each source can be estimated, and the estimated bandwidth is applied synchronously to reduce the queue size in a buffer. For a simple network modelof a high speed link that multiplexes a number of virtual-circuit connections, simulations on adaptive bandwidth allocation were performed, and the results show that the queueing delay is significantly reduced, when compared to a fixed bandwidth allocation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.703-717
• /
• 2002

This paper illustrates the implementation of a scalable shared buffer asynchronous transfer mode (ATM) switch. The designed shared buffer ATM switch has a shared buffet of a pipelined memory which has the access time of 4 ns. The high-speed buffer access time supports a possibility of the implementation of a shared buffer ATM switch which has a large switching capacity. The designed switch architecture provides flexible switching performance and port size scalability with the independence of queue address control from buffer memory control. The switch size and the buffer size of the designed ATM switch can be reconfigured without serious circuit redesign. The designed prototype chip has a shared buffer of 128-cell and 4 ${\times}$ 4 switch size. It is integrated in 0.6um, double-metal, and single-poly CMOS technology. It has 80MHz operating frequency and supports 640Mbps per port.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.12
• /
• pp.437-444
• /
• 2022

Recently, research on mobile edge services has been conducted to handle computationally intensive and latency-sensitive tasks occurring in wireless networks. However, MEC, which is fixed on the ground, cannot flexibly cope with situations where task processing requests increase sharply, such as commuting time. To solve this problem, a technology that provides edge services using UAVs (Unmanned Aerial Vehicles) has emerged. Unlike ground MEC servers, UAVs have limited battery capacity, so it is necessary to optimize energy efficiency through load balancing between UAV MEC servers. Therefore, in this paper, we propose a load balancing technique with consideration of the energy state of UAVs and the mobility of vehicles. The proposed technique is composed of task offloading scheme using genetic algorithm and task migration scheme using Q-learning. To evaluate the performance of the proposed technique, experiments were conducted with varying mobility speed and number of vehicles, and performance was analyzed in terms of load variance, energy consumption, communication overhead, and delay constraint satisfaction rate.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.11-16
• /
• 2009

The queuing theory was adopted by Erlang to predict the availability of telephone lines in 1917 and had not been used for computer system performance analysis until late 1960s when Scherr published a performance analysis of time-shared computer system. In 2000s, the explosive Internet usage and the development of IT technology made the business environment speed-centric and analysts should react swiftly to the ever-changing situation to satisfy the user requirement. It's tempting to solve the performance problem by purchasing new devices because the price of computers and peripherals are rapidly decreasing along with their increasing performance. But this scheme not only makes it difficult to understand the overall performance of the system but also wastes money. A coarse performance model that is gotten quickly is sometimes preferred to a complex and precise one that takes longer time to get. This paper examines an analytic model suggested by Menasce based on the measured data and suggests a simulation model using ARENA that takes a short time to build.