• Journal of Korean Society of Environmental Engineers
• /
• v.29 no.9
• /
• pp.980-985
• /
• 2007

• Proceedings of the Korean Nuclear Society Conference
• /
• 2001.05a
• /
• pp.131.1-131
• /
• 2001

• Journal of Embryo Transfer
• /
• v.10 no.1
• /
• pp.33-44
• /
• 1995

Genetic changes from improving female's reproductive rate through in vitro fertilization of large number of oocytes were studied. The breeding scheme employed was multiple ovulation and embryo transfer of juveniles and adults. Both balanced and unbalanced matings were examined for the four closed progeny population sizes, 10$^3$, 10$^4$, 105, 106. In balanced matings, all selected sires and dams were mated to each other(cross-classified mating) while unbalanced matings allowed selected dams and sires mated partially, eg. unbalanced matings allowed averages of .5 and .25 progeny per each mating. Various numbers of selected sires and dams were also examined in both balanced and unbalanced matings. In all mating schemes, selection of males and females was restricted to he one from each fullsib family to reduce the rate of inbreeding. The model calculations were deterministic and accounted for the effects of selection and inbreeding on loss of the genetic variation in succeeding generations. Balanced rectangular mating schemes, where more donors were selected than sires, resulted in larger selection responses than balanced square mating schemes, where equal numbers of sires and donors were selected, and unbalanced rectangular mating. The first round selection responses from the balanced rectangular matings of juvenile MOET, eg. number of progeny per mating equals 2 with 10 sires selected, were 1.192, 1.406, 1.580 and 1.735 times larger than the first round selection responses from the balanced square mating schemes for the given four progeny population sizes, 10$^3$, 10$^4$, 105 and 106, respectively. Similar results were obtained in adult MOET breeding schemes. However, balanced square matings gave greater selection responses than the unbalanced rectangular matings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4819-4834
• /
• 2015

The spectral efficiency of cellular networks can be improved when proximate users engage in device-to-device (D2D) communications to communicate directly without going through a base station. However, D2D communications that are not properly designed may generate interference with existing cellular networks. In this paper, we study resource allocation and power control to minimize the probability of an outage and maximize the overall network throughput. We investigate three power control-based schemes: the Partial Co-channel based Overlap Resource Power Control (PC.OVER), Fractional Frequency Reuse based Overlap Resource Power Control (FFR.OVER) and Fractional Frequency Reuse based Adaptive Power Control (FFR.APC) and also compare their performance. In PC.OVER, a certain portion of the total bandwidth is dedicated to the D2D. The FFR.OVER and FFR.APC schemes combine the FFR techniques and the power control mechanism. In FFR, the entire frequency band is partitioned into two parts, including a central and edge sub-bands. Macrocell users (mUEs) transmit using uniform power in the inner and outer regions of the cell, and in all three schemes, the D2D receivers (D2DRs) transmit with low power when more than one D2DRs share a resource block (RB) with the macrocells. For PC.OVER and FFR.OVER, the power of the D2DRs is reduced to its minimum, and for the FFR.APC scheme, the transmission power of the D2DRs is iteratively adjusted to satisfy the signal to interference ratio (SIR) threshold. The three schemes exhibit a significant improvement in the overall system capacity as well as in the probability of a user outage when compared to a conventional scheme.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.316-328
• /
• 2003

In this paper, we propose and analyze two adaptive channel allocation schemes for supporting multimedia traffics in hierarchical cellular systems. It is guaranteed to satisfy the required quality of service of multimedia traffics according to their characteristics such as a mobile velocity for voice calls and a delay tolerance for multimedia calls. In the scheme 1, only slow-speed voice calls are allowed to overflow from macrocell to microcell and only adaptive multimedia calls can overflow from microcell to macrocell after reducing its bandwidth to the minimum channel bandwidth. In the scheme II, in addition to the first scheme, non-adaptive multimedia calls can occupy the required channel bandwidth through reducing the channel bandwidth of adaptive multimedia calls. The proposed scheme I is analyzed using 2-dimensional Markov model. Through computer simulations, the analysis model and the proposed schemes are compared with the fixed system and two previous studies. In the simulation result, it is shown that the proposed schemes yield a significant improvement in terms of the forced termination probability of handoff calls and the efficiency of channel usage.

• Journal of Korean Society of Rural Planning
• /
• v.14 no.2
• /
• pp.85-97
• /
• 2008

The purpose of this paper is to review current state of farm household's debt which is considered as one of the biggest problem in the rural community, to analyze the cause of farm household debt rising in Jeju province, and to make improvement schemes on how this problem of farm household debt could be alleviated. In order to achieve these objectives, raw data are collected from the interviews with 400 farming households in Jeju region. The results of the study are as follows; An average amount of total farm households debt was 42,000 thousand won in 2005, but an average of farm households debt excluding no debt farm households was increased by 10,000 thousand to 51,750 thousand won. But the debt properties are variable according to the farm type. Non-citrus farmers, younger farmers, rural area resident farmers hold more debt problems than other type. Among total farm households, 30 percent showed over 40 percent leverage ratio(debt/total assets), which is considered as risky or heavily indebted. Therefore, I designed a workout program and a program of land liquidation for heavily indebted farm households in Korea.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1239-1244
• /
• 2003

In this paper, we analyzed cell loss rate performance for random traffic sources in wireless ATM(Asynchronous Transfer Mode) access architecture, which consists of access node and wireless channel. Applying queueing model to cell level at access node and considering burst error characteristics in wireless channel, we derived a formula about the cell loss rate of the random traffic in the wireless ATM access architecture. We also applied FEC(Forward Error Correction) schemes to improve the cell loss rate of random traffic. When we applied FEC schemes in the wireless ATM access architecture, we confirmed that the concatenated code provides the most superior performance compared to any other codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1256-1265
• /
• 1996

Soft-decision detectors are used in many FEC and ARQ schemes to enhance the bit-error-probability and system throughput. Also, the hybrid-ARQ protocol is a very efficient schemeto achieve overall performance improvement. In this paper, we propose a new hybrid-ARQ protocol based on the first-order Reed-Muller codes employing soft-decision detectors. The Reed-Muller codes have the virtue of being able to use the fast Green machine decoder that is simple to implement. As the performance measures, the bit-error-probability and system throughput are evaluted for the proposed hybrid-ARQ procol, and compared with those of other hybrid-ARQ schemes. It is shown that the use of the proposed hybrid-ARQ protocol results in significant performance improvement without causing much loss in view of system complexity.