• Journal of Computing Science and Engineering
• /
• v.10 no.1
• /
• pp.21-31
• /
• 2016

With the application and development of biomedical techniques such as next-generation sequencing, mass spectrometry, and medical imaging, the amount of biomedical data have been growing explosively. In terms of processing such data, we face the problems surrounding big data, highly intensive computation, and high dimensionality data. Fortunately, cloud computing represents significant advantages of resource allocation, data storage, computation, and sharing and offers a solution to solve big data problems of biomedical research. In order to improve the efficiency of resource management in cloud computing, this paper proposes a clustering method and adopts Radial Basis Function in order to compress comprehensive data sets found in biology and medicine in high quality, and stores these data with resource management in cloud computing. Experiments have validated that with such a data-compression-based resource management in cloud computing, one can store large data sets from biology and medicine in fewer capacities. Furthermore, with reverse operation of the Radial Basis Function, these compressed data can be reconstructed with high accuracy.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.253-256
• /
• 2001

This paper describes a high speed MAC(Media Access Control) function chip for IEEE 802.11 MAC layer protocol. The MAC chip has control registers and interrupt scheme for interface with CPU and deals with transmission/reception of data as a unit of frame. The developed MAC chip is composed of protocol control block, transmission block, and reception block which supports the BCF function in IEEE 802.11 specification. The test suite which is adopted in order to verify operation of the MAC chip includes various functions, such as RTS-CTS frame exchange procedure, correct IFS(Inter Frame Space)timing, access procedure, random backoff procedure, retransmission procedure, fragmented frame transmission/reception procedure, duplicate reception frame detection, NAV(Network Allocation Vector), reception error processing, broadcast frame transmission/reception procedure, beacon frame transmission/reception procedure, and transmission/reception FIEO operation. By using this technique, it is possible to reduce the load of CPU and firmware size in high speed wireless LAN system.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.13 no.1
• /
• pp.45-52
• /
• 2007

The purpose of this study is to suggest the design by using digital media the general hospital. The important result and advantage of the study are as follows; At first, applicability and maintenance of form and function design are enhanced and the digital media could be used for development of better and economical design. Secondly, the 3D CAD system useful for communication media and instructional tool for hospital planners and designers. Thirdly, fast and economical evaluation are obtained through the study of experimental simulation. Finally as a new tool in architectural field, the system helps to enhance the relationship between digital media and human. New concept and tools of hospital design are being developed in terms of its function, environment, and psychology. The computational design system should be improved for user friendly in the future.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.1-13
• /
• 2006

In this paper we consider a design problem of a cyclic queueing network with two stages, each with a local buffer of limited capacity. Based on the theory of reversibility and product-form solution, we derive the throughput function of the network as a key performance measure to maximize. Two cases are considered. In case each stage consists of a single server, an optimal allocation policy of a given buffer capacity and work load between stages as well as the optimal number of customers is identified by exploiting the properties of the throughput function. In case each stage consists of multiple servers, the optimal policy developed for the single server case doesn't hold any more and an algorithm is developed to allocate with a small number of computations a given number of servers, buffer capacity as well as total work load and the total number of customers. The differences of the optimal policies between two cases and the implications of the results are also discussed. The results can be applied to support the design of certain manufacturing and computer/communication systems.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.592-601
• /
• 2007

In the conventional double auction approaches, two basic assumptions are usually applied - (1) each trader has a linear or quasi-linear utility function of price and quantity, (2) buyers as well as sellers have identical utility functions. However, in practice, these assumptions are unrealisitc. Therefore, a flexible and integrated double auction mechanism that can integrate all traders' diverse utility functions is necessary. We propose a double auction mechanism with resource allocation based on nonlinear utility functions, namely a flexible synchronous double auction system where each participant can express a diverse utility function on the price and quantity. In order to optimize the total market utility consists of multiple complex utility functions of traders, our study proposes a genetic algorithm (GA) We show the viability of the proposed mechanism through several simulation experiments.

• Water for future
• /
• v.18 no.2
• /
• pp.163-174
• /
• 1985

This study aims at the development of a technique for the optimal water allocation by applying Dynamic Programming Model for the effective usage and rational allocation of water resources, in case of which limited water resources in river basin should be used in several stages. In analytical procedure the possible allocable area was firstly zoned into the four areas: Pohang area ($C_1$), Yeungcheon area ($C_2$), Gyeungsan area ($C_3$), Daegu area ($C_4$), which are located between the Yeongcheon dam and the confluence of the lower Kumho river and the main course of the Nakdong river. Secondly, a return function was determined on the basis of the correlation between the GRP in each area and the amount of water used to it. A DP Model, finally, was applied to the allocation of the water resources according to both their usage and the areas. As a result, the fact has been found that when allocating by the area, $C_1$ could be possibly supplied only with the water resources avaiable from the Yeungchon dam, and the maximum units supplied to $C_1$ should be 240 units ($1unit=10^3㎥$ per day), beyond which we ought to develop an alternative water resources. Also, the return from the allocation by the usage exceeded the one from it by the area. At the same time it was more profitable to limit the water supply to $C_1$ into 217 units. In the allocation by the area 240 units and 80 units, if only the water resources available from the Yeungcheon dam used, and 360 units and 80 units if the Doil dam used additionally, could be supplied to $C_1$ and the lower region respectively. In the allocation by the usage 103 units for industrial water with 33 units for both domestic and commercial water and 183 units, if only the water resources available from the Yeungcheon dam used, and 103 units with 33 units and 304 units, if the Doil dam taken into consideration additionally, could be supplied to $C_1$ and the lower region respectively. Therefore, much more water could be allocated to the region of lower Kumho river if the method of water allocation by the usage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2530-2547
• /
• 2015

In the recent years, femtocell technology has received a considerable attention due to the ability to provide an efficient indoor wireless coverage as well as enhanced capacity. However, under the spectrum sharing between femtocell user equipment (FUEs) and the owner of spectrum macrocell user equipment (MUEs), both may experience higher uplink interference to each other. This paper proposes a novel distributed power control algorithm for the interference management in two-tier femtocell networks. Due to the assignment of licensed radio frequency to the outdoor macrocell users, the access priority of MUEs should be higher than FUEs. In addition, the quality of service (QoS) of MUEs that is expressed in the target signal-to-interference-plus-noise ratio (SINR) must always be achieved. On the other hand, we consider an efficient QoS provisioning cost function for the low-tier FUEs. The proposed algorithm requires only local information and converges even in cases where the frontiers of available power serve the target SINRs impossible. The advantage of the algorithm is the ability to implement in a distributed manner. Simulation results show that the proposed algorithm based on our cost function provides effective resource allocation and substantial power saving as compared to the traditional algorithms.

• Journal of Digital Convergence
• /
• v.18 no.10
• /
• pp.225-232
• /
• 2020

The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• Journal of Advanced Navigation Technology
• /
• v.10 no.3
• /
• pp.275-281
• /
• 2006

Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources for relaying at each relay is limited due to either its available power which is much smaller than base station (BS) power or the overhead required for exchanging feedback information. The performance of SRARA schemes is evaluated with schedulers such as proportional fair (PF) and TGS at 64kbps and 128kbps user throughput requirements when total MS power is set to 500mW or 1 W. For 64kbps throughput requirement level, more improvement comes from relay than scheduler design. For 128kbps case, it comse from scheduler design than relay due to the fact that simple relay can't help using strictly limited amount of resources for relaying function.