• ETRI Journal
• /
• 제30권1호
• /
• pp.21-32
• /
• 2008

Cognitive radio (CR) has been proposed as an effective technology for flexible use of the radio spectrum. The interference between primary users and CR users, however, becomes a critical problem when they are using adjacent frequency channels with different transmission power levels. In this paper, a robust CR orthogonal frequency division multiplexing (OFDM) architecture, which can effectively suppress interference to nearby primary users and overcome adjacent channel interference (ACI) to the CR user, is proposed. This new approach is characterized by adaptive data repetition for subcarriers under heavy ACI, and adaptive time spreading for subcarriers near the borders of the CR user's spectrum. The data repetition scheme provides extra power gain against the ACI coming from primary users. Time spreading guarantees an acceptable interference level to nearby primary users. By computer simulation, we demonstrate that, under a CR environment, the proposed CR OFDM architecture outperforms conventional OFDM systems in terms of throughput and BER performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2131-2136
• /
• 2003

Since the number of user-requests increases dramatically on the Internet, the servers and networks can be swamped unexpectedly without any prior notice. Therefore, the end-users are waiting or refused for the responses of the contents from the originating servers. To solve this problem, it has been considered that a distributed web caching system efficiently utilizes structural elements of the network. Because a distributed web caching system uses the caches that are close to end-users on the network, it transmits the contents to users faster than the original network system. This paper proposes a simple client-based distributed web caching system(2HRCS) that client can directly perform object allocation and load balancing without an additional DNS for load balancing in CARP (Cache Array Routing Protocol) and GHS (Global Hosting System) that are the recent distributed web caching system protocol. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system. The system has clients with consistent hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to consistent hashing system. Because this system can keep performance of the existing system and reduce costs, it has the advantage of constructing medium or small scale CDN (Contents Delivery Network).

• 한국인터넷방송통신학회논문지
• /
• 제11권2호
• /
• pp.63-72
• /
• 2011

방송 기반의 데이터 전파는 모바일 컴퓨팅 환경에서 보편적으로 받아들여지는 통신 방식이다. 그러나 많은 데이터를 방송해야 할 경우에 방송 채널의 순차성으로 인하여 원하는 데이터를 수신하기까지의 예상 지연시간이 증가한다. 이 대기시간을 줄이기 위하여 본 논문은 다중 채널을 통하여 데이터를 방송하는 문제를 연구한다. 기존의 기법들은 각 채널의 평형 방송을 가정하고 데이터들을 액세스 확률에 근거하여 분할하고 다중 채널에 할당한다. 만일 동일 채널에 할당된 데이터들도 그들의 액세스 확률에 근거하여 방송빈도를 다르게 한다면 성능은 더 향상될 것이다. 이와 같은 관점에서 본 논문은 동일 채널에 할당된 데이터들의 액세스 확률의 차이를 방송 스케줄에 반영할 수 있는 두 단계 동적프로그래밍 기법으로 명명된 새로운 방송 스케줄링 기법을 제안한다.

• 한국컴퓨터정보학회논문지
• /
• 제22권4호
• /
• pp.25-32
• /
• 2017

Recently, the use of NAND flash memory is being increased as a secondary device to displace conventional magnetic disk. NAND flash memory, as one among non-volatile memories, has many advantages such as low power, high reliability, low access latency, and so on. However, NAND flash memory has disadvantages such as erase-before-write, unbalanced operation speed, and limited P/E cycles, unlike conventional magnetic disk. To solve these problems, NAND flash memory mainly adopted FTL (Flash Translation Layer). In particular, garbage collection technique in FTL tried to improve the system lifetime. However, previous garbage collection techniques have a sensitive property of the system lifetime according to write pattern. To solve this problem, we propose BSGC (Balanced Selection-based Garbage Collection) technique. BSGC efficiently selects a victim block using all intervals from the past information to the current information. In this work, SFL (Search First linked List), as the proposed block allocation policy, prolongs the system lifetime additionally. In our experiments, SFL and BSGC prolonged the system lifetime about 12.85% on average and reduced page migrations about 22.12% on average. Moreover, SFL and BSGC reduced the average response time of 16.88% on average.

• 대한간호학회지
• /
• 제10권2호
• /
• pp.87-94
• /
• 1980

According to the provious study. it was suggested a need for improvement of nursing care through application of nursing process in Ewha Womans University Hospital With those data. it has been applied to the nursing care at maternity ward by nurses. This study was undertaken to determine the evaluation of the application of the nursing process which is an orderly. systemic min of deforming the patient's/client's nursing problems. This study involved 191 cases with patient chart and was carried out from Feb. 1979 to Feb. 1980 is Ewha Womans University Hospital. The results were as follows : 1. Actual performance of“Assessment”stage was 59%, and 45 ％ for the nursing diagnosis. 2. It was achieved with specific planning of nursing care for 71.6% and the plan was safely and effective implemented (97.9% ). 3. Afer“Implement”stage it was made of evaluation and feedback process (39%). 4. Nurses in Eha womans University hospital. they showed the Positive attitude toward the application of nursing process. but they saggested that there were lack of manpower and the consideration of time allocation. Recommandation are as follows : 1. All nursing staff must participate in continious education program for nursing process. 2. The results suggest a need for modification for the nursing history formeat and SOAPIER. 3. A need for improvement of physical condition for interview and effective utilization of nursing staff. 4. It will more effective when Dr's medical record replace by problem ariented aedical record( POMR).

• 산업공학
• /
• 제22권1호
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• 한국전자파학회논문지
• /
• 제19권6호
• /
• pp.669-676
• /
• 2008

MIMO-OFDMA 시스템에서 자원 할당의 최적화 문제가 거론되고 있다. 본 논문은 SFC 방식 아래 채널에 대한 정보를 가지고 적응 변조 및 부호 기법과 전력 제어 기법을 적용하여 전체 시스템 처리량의 최대화에 목표를 두었다. 첫 번째로 수신 받은 채널에 대한 정보를 기반으로 각 서브 채널의 전력 레벨이 결정된다. 그 다음으로는 변조 타입에 맞게 서브캐리어가 할당되어진다. 시뮬레이션 결과는 실제로 전송되어진 데이터 용량 측면에서 기존의 알고리즘보다 제안한 알고리즘이 더 나은 성능을 보인다.

• Journal of Biosystems Engineering
• /
• 제36권6호
• /
• pp.461-466
• /
• 2011

The purpose of this study is basically for the use of simulations to enhance productivity. In this paper, the optimal number of allocation in a small and medium industry which produces eleutherococcus senticosus sap, is performed using simulations. The simulation model was developed under considerations of production layout, process & operation, process time, total work time, work in process (WIP), utilization, failure rate, and operation efficient as inputs, and was validated with careful comparisons between real behaviors and outputs of the production line. Therefore, we can evaluate effects and changes in productivity when some strategies and/or crucial factors are changed. Although too many workers and machines could decrease productivity, the eleutherococcus senticosus sap production line in this paper has been maintained many machines. To solve this problem, we determined the optimal number of workers and machines that could not cause any interrupt in productions using simulations. This simulation model considers diverse input variables which could influence productivity, and it is very useful not only for the production line of Eleutherococcus Senticosus Sap, but also for other production lines with various purposes, especially, in the small and medium industries.

• International Journal of Aeronautical and Space Sciences
• /
• 제11권3호
• /
• pp.167-174
• /
• 2010

The design, dynamics, and control allocation of tri-rotor unmanned aerial vehicles (UAVs) are introduced in this paper. A trirotor UAV has three rotor axes that are equidistant from its center of gravity. Two designs of tri-rotor UAV are introduced in this paper. The single tri-rotor UAV has a servo-motor that is installed on one of the three rotors, which enables rapid control of its motion and its various attitude changes-unlike a quad-rotor UAV that depends only on the angular velocities of four rotors for control. The other design is called 'coaxial tri-rotor UAV,' which has two rotors installed on each rotor axis. Since the tri-rotor type of UAV has the yawing problem induced from an unpaired rotor's reaction torque, it is necessary to derive accurate dynamic and design control logic for both single and coaxial tri-rotors. For that reason, a control strategy is proposed for each type of tri-rotor, and nonlinear simulations of the altitude, Euler angle, and angular velocity responses are conducted by using a classical proportional-integral-derivative controller. Simulation results show that the proposed control strategies are appropriate for the control of single and coaxial tri-rotor UAVs.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.