• Journal of the Korean Institute of Landscape Architecture
• /
• v.28 no.1
• /
• pp.19-28
• /
• 2000

The purposes of this study are two folds: a) to introduce conjoint choice model to research the choice behavior of theme park users, and b) to suggest the strategies to strengthen the competitiveness of theme parks. The major four theme parks in Seoul metropolitan areas were selected as study areas. A leading polling agency was employed to select 432 respondents by probability sampling and to conduct face-to-face interview. Both alternative generating and choice set generating fractional factorial design were conducted simultaneously to meet the necessary and sufficient conditions for calibration of the conjoint choice model. Dummy coding was used to represent the attribute levels, and the alternative-specific model was calibrated. The goodness-of-fit of the model was quite satisfactory($\rho$$^2$=0.47950), and most parameters values had to expected sign and magnitude. Car was preferred transport mode to shuttle bus for visiting theme parks ; however the most ideal attribute levels only were estimated significantly. Most attribute levels of shuttle bus were estimated significantly except the Dream Land, which is the least attractive park among study areas. Simulation results showed that the shuttle bus was a mode worth providing to switch the current car dominant visiting pattern of theme parks, which will be one the effective strategies to attract more patrons, especially for potential users adjacent to parks. Several ideals were suggested for future researches, in terms of utilization of more general utility function and new base alternative, and inclusion of more salient attributes such as constraints in the model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3016-3033
• /
• 2014

The downlink performance of distributed antenna systems (DAS) with antennas selection is investigated in Rayleigh fading multicell environment, and the corresponding system capacity and bit error rate (BER) analysis are presented. Based on the moment generating function, the probability density function (PDF) and cumulative distribution function (CDF) of the effective signal to interference plus noise ratio (SINR) of the system are first derived, respectively. Then, with the available CDF and PDF, the accurate closed-form expressions of average channel capacity and average BER are further derived for exact performance evaluation. To simplify the expression, a simple closed-form approximate expression of average channel capacity is obtained by means of Taylor series expansion, with the performance results close to the accurate expression. Besides, the system outage capacity is analyzed, and an accurate closed-form expression of outage capacity probability is derived. These theoretical expressions can provide good performance evaluation for DAS downlink. It can be shown by simulation that the theoretical analysis and simulation are consistent, and DAS with antenna selection outperforms that with conventional blanket transmission. Moreover, the system performance can be effectively improved as the number of receive antennas increases.

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.111-117
• /
• 1999

Using a method recently reported in the literature for analyzing the bit error probability (BEP) performance of noncoherent Mary orthogonal signals with square-law combining in the presence of independent and identically distributed Nakagami-m faded paths, we are able to reformulate this method so as to apply to a generalized fading channel in which the fading in each path need not be identically distributed nor even distributed ac-cording to the same family of distribution. The method leads to exact expressions for the BEP in the form of a finite-range integral whose integrand involves the moment generating function of the combined signal-to-noise ratio and which can therefore be readily evaluated numerically. The mathematical formalism is illustrated by applying the method to some selected numerical examples of interest showing the impact of the multipath intensity profile (MIP) as well as the fading correlation profile (FCP) on the BEP performance of M-ary orthogonal signal over Nakagami-m fading channels. Thses numerical results show that both MIP and FCP induce a non-negligible degradition in the BEP and have therefore to be taken into account for the accurate prediction of the performance of such systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.100-106
• /
• 2006

We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.

• Korean Journal of Mathematics
• /
• v.30 no.1
• /
• pp.67-72
• /
• 2022

For a locus with two alleles (I^A and I^B), the frequencies of the alleles are represented by $$p=f(I^A)={\frac{2N_{AA}+N_{AB}}{2N},\;q=f(I^B)={\frac{2N_{BB}+N_{AB}}{2N}$$ where N_AA, N_AB and N_BB are the numbers of I^AI^A, I^AI^B and I^BI^B respectively and N is the total number of populations. The frequencies of the genotypes expected are calculated by using p², 2pq and q². Choi showed the method of whether some genotypes is in these probabalities. Also he calculate the probability generating function for offspring number of genotype under a diploid model( [1]). In this paper, let x(t, p) be the probability that I^A become fixed in the population by time t-th generation, given that its initial frequency at time t = 0 is p. We find adapted equations for x using the mean change of frequence of alleles and fitness of genotype. Also we apply this adapted equations to several diploid model and it also will apply to actual examples.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.239-245
• /
• 2017

Probabilistic grammar is used in natural language processing, and the parse result of the grammar has to preserve the probability of the original grammar. As for the representative parsing method, LL parsing and LR parsing, the former preserves the probability information of the original grammar, but the latter does not. A characteristic of a probabilistic parsing automaton has been studied; but, currently, the generating model of probabilistic parsing automata has not been known. The paper provides a model of probabilistic parsing automata based on the single state parsing automata. The generated automaton preserves the probability of the original grammar, so it is not necessary to test whether or not the automaton is probabilistic parsing automaton; defining a probability function for the automaton is not required. Additionally, an efficient automaton can be constructed by choosing an appropriate parameter.

• Journal of Korean Institute of Industrial Engineers
• /
• v.8 no.2
• /
• pp.15-21
• /
• 1982

This paper offers an alternative to the common probability generating function approach to the solution of steady state equations when a Markovian queue has a multivariate state space. Identifying states and substates and grouping them into vectors appropriately, we formulate a two - dimensional Markovian queue as a Markov chain. Solving the resulting matrix equations the transition point steady state probabilities (SSPs) are obtained. These are then converted into arbitrary time SSPs. The procedure uses only probabilistic arguments and thus avoids a large and cumbersome state space which often poses difficulties in the solution of steady state equations. For the purpose of numerical illustration of the approach we solve a Markovian queue with one server and two classes of customers.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.81-95
• /
• 2008

In this paper, the negative Polya-Eggenberger distribution has been introduced by compounding negative binomial distribution with beta distribution of I-kind which generates a number of univariate contagious or compound (or mixture of) distributions as its particular cases. The distribution is unimode, over dispersed and all of its positive and negative integer moments exist. The difference equation of the proposed model shows that it is a member of the Ord's family of distribution. Some of its interesting properties have been explored besides different methods of estimation been discussed. Finally, the parameters of the proposed model have been estimated by using a computer programme in R-software. Application of the proposed model to some data, available in the literature, has been given and its goodness of fit demonstrated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.1
• /
• pp.1-4
• /
• 2015

This paper presents a heuristic approach to derive the Laplace-Stieltjes transform (LST) and the probability generating function (PGF) of the waiting time distributions of a continuous- and a discrete-time GI/G/1 queue, respectively. This is a new idea to derive the well-known results, the waiting time distribution of GI/G/1 queue, in a different way.

• Structural Engineering and Mechanics
• /
• v.62 no.3
• /
• pp.259-272
• /
• 2017

In this study, recently developed swarm intelligence algorithm called Social Spider Optimization (SSO) approach and its enhanced version of SSO algorithm with spider jump techniques is used to develop a structural optimization technique for steel space structures. The improved version of SSO uses adaptive randomness probability in generating new solutions. The objective function of the design optimization problem is taken as the weight of a steel space structure. Constraints' functions are implemented from American Institute of Steel Construction-Load Resistance factor design (AISC-LRFD) and Ad Hoc Committee report and practice which cover strength, serviceability and geometric requirements. Three steel space structures are optimized using both standard SSO and SSO with spider jump (SSO_SJ) algorithms and the results are compared with those available in the literature in order to investigate the performance of the proposed algorithms.