• Journal of the military operations research society of Korea
• /
• v.35 no.2
• /
• pp.1-14
• /
• 2009

During wartime, the Air Force have to plan where, and how much, and what need to be distributed to surrounding local area from a chosen central bases. Each base, which has surplus more than needed amount of a certain material collected from near area of the base, is expected to distribute such surplus to other bases in shortage of it. By sending such surplus to other bases in shortage of the material, every base may get sufficient amount of all kinds of materials needed for each base during wartime. Because number of items of materials needed in each military bases during wartime are usually quite large and the frequencies of delivery from a place to other place are also pretty large if each item is delivered from a surplus place to other places in shortage, the Head Quarter of Air Force or the Logistics Command will face to difficulty to decide a reasonable delivery plan between bases for efficient and fast allocation of all materials needed to all bases during wartime. Therefore, this study suggests a solving algorithm with an established TC (transfer center: collecting and distributing center for all materials) to solve such a distribution and transportation problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.76-83
• /
• 2009

In this paper, we provide opportunistic scheduling schemes for elastic services in OFDMA systems with fairness constraints for each user. We adopt the network utility maximization framework in which a utility function is defined for each user to represent its level of satisfaction to the service. Since we consider elastic services whose degree of satisfaction depends on its average data rate, we define the utility function of each user as a function of its average data rate. In addition, for fair resource allocation among users, we define fairness requirements of each user by using utility functions. We first formulate an optimization problem for each fairness requirement that aim at maximizing network utility, which is defined as the sum of utilities of users. We then develop an opportunistic scheduling scheme for each fairness requirement by solving the problem using a dual approach and a stochastic sub-gradient algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.267-273
• /
• 2021

Non-orthogonal multiple access is the promised candidates in the next generation wireless networks to improve the spectral efficiency by superposing multiple signals. In general, the superposition coding is performed using the difference in channel gain between users based on the user's power allocation. However, when user pairs have the similar channel gain problem, NOMA can not be allowed in the scenario. To overcome this problem, phase rotation based NOMA is presented to increase minimum distance between superposed signals in the constellation point. This paper proposed a novel non-orthogonal multiple access based index modulation using phase rotation. The additional bits can transfer using the index bits that is allocated according to the activated state of the phase rotation. Simulation results are shown that bit error rate and achievable sum rate are better than conventional NOMA.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.1-7
• /
• 2015

The industry has rapidly growth and energy supply technology advanced are become main factor which to contribute of the harmonic losses. This problem is one aspect that may affect the capability of the transmission line and also to the efficiency of electricity. This paper proposes a new scheme to allocate the cost pertaining to transmission loss due to harmonics. The proposed method, called as Generalized Harmonic Distribution Factor, uses the principle of proportional sharing method to allocate the losses among the transmission users especially for industry consumers. The IEEE 14- and 30 bus test system is used to compare the proposed method with existing method. The results showed that the proposed method provided a scheme better in allocating the cost of transmission loss, which could encourage the users to minimize the losses.

• ETRI Journal
• /
• v.30 no.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.10a
• /
• 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).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.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.

• Journal of Korean Academy of Nursing
• /
• v.10 no.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).

• IE interfaces
• /
• v.22 no.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.