• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.69-81
• /
• 2006

In this paper, an adaptive algorithm is proposed in streaming MPEG-4 contents with fluctuating resource amount such as throughput of network conditions. In the area of adaptive streaming issue, a lot of researches have been made on how to represent encoded media(such as video) bitstream in scalable way. By contrast, MPEG-4 supports object-based multimedia content which is composed of various types of media streams such as audio, video, image and other graphical elements. Thus, it can be more effective to provide individual media streams in scalable way for streaming object-based content to heterogeneous environment. The proposed method provides the multiple media streams corresponding to an object with different qualities and bit rate in order to support object based scalability to the MPEG-4 content. In addition, an optimal selection of the multiple streams for each object to meet a given constraint is proposed. The selection process is adopted a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different scalability levels. The proposed algorithm enforces the optimal selection process to maintain the perceptual qualities of more important objects at the best effort. The experimental results show that the set of selected media stream for presenting objects meets a current transmission condition with more high perceptual quality.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.7
• /
• pp.815-822
• /
• 2010

Two-way relaying scheme based on relay selection can not only achieve higher rate but also get the selection diversity gain according to the number of relays. However the scheme can not achieve combining gain because it does not consider the direct link between users. In this paper, we propose, with multiple relays, opportunistic cooperative two-way relaying scheme and incremental cooperative two-way relaying scheme which can achieve both selection diversity gain and combining gain. Simulation results show that proposed scheme outperform the conventional scheme by achieving both combining gain and selection diversity gain according to the number of relays.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2696-2705
• /
• 1997

An exact experssion for the average symbol error rate(SER) of L-order selection diversity for MPSK signals in a frequency-nonselective slowy m-distributed Nakagami fading and additive white Gaussian noise(AWGN) is determs of finite sums is obtained. To derive the SER of MPSK signals with selection combining, the new expression of pdf is introduced and many other mathmatical methods are used. When fading index m is 1, the derived exppression lead to those of MPSK with selection combining in Rayleight fading channels. The results show that the error probability decreases as the order of diversity increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3133-3151
• /
• 2012

The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

• Journal of Astronomy and Space Sciences
• /
• v.36 no.2
• /
• pp.97-103
• /
• 2019

An automated signal-acquisition method for the NASA's space geodesy satellite laser ranging (SGSLR) system is described as a selection of two system parameters with specified probabilities. These parameters are the correlation parameter: the minimum received pulse number for a signal-acquisition and the frame time: the minimum time for the correlation parameter. The probabilities specified are the signal-detection and false-acquisition probabilities to distinguish signals from background noise. The steps of parameter selection are finding the minimum set of values by fitting a curve and performing a graph-domain approximation. However, this selection method is inefficient, not only because of repetition of the entire process if any performance values change, such as the signal and noise count rate, but also because this method is dependent upon system specifications and environmental conditions. Moreover, computation is complicated and graph-domain approximation can introduce inaccuracy. In this study, a new method is proposed to select the parameters via a conditional equation derived from characteristics of the signal-detection and false-acquisition probabilities. The results show that this method yields better efficiency and robustness against changing performance values with simplicity and accuracy and can be easily applied to other satellite laser ranging (SLR) systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.511-520
• /
• 2011

In this paper, we introduce a multiuser (MU) scheduling method for multiuser amplify-and-forward relay systems, which selects both the transmission mode, i.e., either one- or two-hop transmission, and the desired user via two steps. A closed-form expression for the average achievable rate of the proposed scheduling is derived under two transmission modes with MU scheduling, and its asymptotic solution is also analyzed in the limit of large number of mobile stations. Based on the analysis, we perform our two-step scheduling algorithm: the transmission mode selection followed by the user selection that needs partial feedback for instantaneous signal-to-noise ratios (SNRs) to the base station. We also analyze the average SNR condition such that the MU diversity gain is fully exploited. In addition, it is examined how to further reduce a quantity of feedback under certain conditions. The proposed algorithm shows the comparable achievable rate to that of the optimal one using full feedback information, while its required feedback overhead is reduced below half of the optimal one.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.6
• /
• pp.638-644
• /
• 2018

Relay systems have recently gained attentions because of its capability of cell coverage extension and the power gain as the one of key technologies for 5G. Relays can be exploited for small-cell base stations and the autonomous network, where communication devices communicate with each other cooperatively. Therefore, the relay technology is expected to enable the low power and large capacity communication. In order to maximize the benefits of using a limited number of relays, the efficient relay selection method is required. Especially, when two nodes exchange their data with each other via relay, the relay selection can maximize the average data rate by the spatial location of the relay. For this purpose, the average data rate is analyzed first according to the relay selection. In this paper, we analyzed the average data rate when two nodes exchange their data via dual-hop decode and forward relaying considering the interference by the concurrent transmission under Nakagami-m fading channel. The correctness of the analysis is verified by the Monte Carlo simulation. The results show that the concurrent transmission is superior to the non-concurrent transmission in the high required data rate region rather than in the low required data rate region.

• Korean Journal of Poultry Science
• /
• v.9 no.1
• /
• pp.1-16
• /
• 1982

Excessive fat deposition, particularly in the abdominal region, has become a problem in broiler production. When the caloric intake exceeds the body demands for energy, excess food is stored as fat in broilers. Researchers have shown that fat deposition varies with breed, strain, sex age, nutrition, exercise, ambient temperature and rearing systems. These factors affect fat deposition through their effects on the size or the number of adipose cells or a combination of both. In some measurements on live birds to predict body fat, the wet weight and percentage fat of skin in pectoral feather tract are significantly correlated with percentage abdominal fat. But these correlation coefficients are not so high. Therefore, correlation coefficients indicate that these measurements on live birds ate not useful for estimating body fat weight and percentage. Most reports show that an increase in the proportion of carcass fat, when measured at a given age, is correlated with selection for increased body weight. On the other hand some research results show that selection for body$.$weight gain dose not lead to an alteration in the proportion carcass fat when measured at a given body weight. Besides, selection for improved food conversion efficiency alone resulted in a decrease in carcass fat and an increase in protein and water when measured at either a given age or body weight, Thus eventhough it is uncertain whether carcass fat is increasing as a result of body-weight selection in broilers: however it is clear that selection for improved food conversion efficiency, either alone or in combination with growth rate, should result in leaner carcasses than selection for growth rate alone.

• Asian-Australasian Journal of Animal Sciences
• /
• v.25 no.3
• /
• pp.299-303
• /
• 2012

Inbreeding is the mating of relatives that produce progeny having more homozygous alleles than non-inbred animals. Inbreeding increases numbers of recessive alleles, which is often associated with decreased performance known as inbreeding depression. The magnitude of inbreeding depression depends on the level of inbreeding in the animal. Level of inbreeding is expressed by the inbreeding coefficient. One breeding goal in livestock is uniform productivity while maintaining acceptable inbreeding levels, especially keeping inbreeding less than 20%. However, in closed herds without the introduction of new genetic sources high levels of inbreeding over time are unavoidable. One method that increases selection response and minimizes inbreeding is selection of individuals by weighting estimated breeding values with average relationships among individuals. Optimum genetic contribution theory (OGC) uses relationships among individuals as weighting factors. The algorithm is as follows: i) Identify the individual having the best EBV; ii) Calculate average relationships ($\bar{r_j}$) between selected and candidates; iii) Select the individual having the best EBV adjusted for average relationships using the weighting factor k, $EBV^*=EBV_j(1-k\bar{{r}_j})$ Repeat process until the number of individuals selected equals number required. The objective of this study was to compare simulated results based on OGC selection under different conditions over 30 generations. Individuals (n = 110) were generated for the base population with pseudo random numbers of N~ (0, 3), ten were assumed male, and the remainder female. Each male was mated to ten females, and every female was assumed to have 5 progeny resulting in 500 individuals in the following generation. Results showed the OGC algorithm effectively controlled inbreeding and maintained consistent increases in selection response. Difference in breeding values between selection with OGC algorithm and by EBV only was 8%, however, rate of inbreeding was controlled by 47% after 20 generation. These results indicate that the OGC algorithm can be used effectively in long-term selection programs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.