• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.857-867
• /
• 2019

Suppose that G = (V, E) is a connected locally finite graph with the vertex set V and the edge set E. Let ${\Omega}{\subset}V$ be a bounded domain. Consider the following quasilinear elliptic equation on graph G $$\{-{\Delta}_{pu}={\lambda}K(x){\mid}u{\mid}^{p-2}u+f(x,u),\;x{\in}{\Omega}^{\circ},\\u=0,\;x{\in}{\partial}{\Omega},$$ where ${\Omega}^{\circ}$ and ${\partial}{\Omega}$ denote the interior and the boundary of ${\Omega}$, respectively, ${\Delta}_p$ is the discrete p-Laplacian, K(x) is a given function which may change sign, ${\lambda}$ is the eigenvalue parameter and f(x, u) has exponential growth. We prove the existence and monotonicity of the principal eigenvalue of the corresponding eigenvalue problem. Furthermore, we also obtain the existence of a positive solution by using variational methods.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.6
• /
• pp.939-945
• /
• 2006

The physiological characteristics and function of the exopolysaccharide (EPS) produced by Lactobacillus rhamnosus ATCC 9595 were determined. The total quantity of EPS was rapidly increased to 496$\pm$20 mg/l during the exponential phase, and then maintained steadily during the stationary phase. During the exponential phase (18 h), the total EPS consisted of 61% cell-bound EPS (cb-EPS) and 39% released EPS (r-EPS), whereas the relative proportion of EPS during the stationary phase (48 h) was convered to 23% cb-EPS and 77% r-EPS. On gel permeation chromatography, cb-EPS was fractionated as a single peak of 8.6$\times10^6$ Da, whereas r-EPS was fractionated as two peaks with average molecular weights of 4.3$\times$10$^4$ and 8.6$\times10^6$ Da. Interestingly, both EPS species exhibited anticancer properties and cholera toxin-binding activities. Our results suggest that the EPS generated by L. rhamnosus ATCC 9595 might be suitable for use as a functional food or food supplement.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.113-117
• /
• 1998

We propose a way to show the inherent learning complexity for the multilayer perceptron. We display the solution space and the error surfaces on the input space of a single neuron with two inputs. The evolution of its weights will follow one of the two error surfaces. We observe that when we use the back-propagation(BP) learning algorithm (1), the wight cam not jump to the lower error surface due to the implicit continuity constraint on the changes of weight. The self-relaxation approach is to explicity find out the best combination of all neurons' two error surfaces. The time complexity of training a multilayer perceptron by self-relaxationis exponential to the number of neurons.

• Journal of the Korean Mathematical Society
• /
• v.48 no.2
• /
• pp.267-288
• /
• 2011

In this paper, we construct eight infinite families of ternary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the special orthogonal group $SO^-$(2n, q). Here q is a power of three. Then we obtain four infinite families of recursive formulas for power moments of Kloosterman sums with square arguments and four infinite families of recursive formulas for even power moments of those in terms of the frequencies of weights in the codes. This is done via Pless power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of "Gauss sums" for the orthogonal groups $O^-$(2n, q).

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.585-602
• /
• 2020

In this paper, we construct four infinite families of binary linear codes associated with double cosets with respect to a certain maximal parabolic subgroup of the orthogonal group O⁺(2n, 2^r). And we obtain two infinite families of recursive formulas for the power moments of Kloosterman sums and those of 2-dimensional Kloosterman sums in terms of the frequencies of weights in the codes. This is done via Pless' power moment identity and by utilizing the explicit expressions of exponential sums over those double cosets related to the evaluations of "Gauss sums" for the orthogonal groups O⁺(2n, 2^r).

• Journal of Distribution Science
• /
• v.14 no.11
• /
• pp.83-90
• /
• 2016

Purpose - During the last two years, convenient stores (CS) are emerging as one of the most fast-growing retail trades in Korea. The goal of this work is to forecast and to analyze sales at CS using ARIMA-Intervention model (IM) and exponential smoothing method (ESM), together with sales at supermarkets in South Korea. Considering that two retail trades above are homogeneous and comparable in size and purchasing items on off-line distribution channel, individual behavior and characteristic can be detected and also relative superiority of future growth can be forecasted. In particular, the rapid growth of sales at CS is regarded as an everlasting external event, or step intervention, so that IM with season variation can be examined. At the same time, Winters ESM can be investigated as an alternative to seasonal ARIMA-IM, on the assumption that the underlying series shows exponentially decreasing weights over time. In case of sales at supermarkets, the marked intervention could not be found over the underlying periods, so that only Winters ESM is considered. Research Design, Data, and Methodology - The dataset of this research is obtained from Korean Statistical Information Service (1/2010~7/2016) and Survey of Service Trend of Korea Statistics Administration. This work is exploited time series analyses such as IM, ESM and model-fitting statistics by using TSPLOT, TSMODEL, EXSMOOTH, ARIMA and MODELFIT procedures in SPSS 23.0. Results - By applying seasonal ARIMA-Intervention model to sales at CS, the steep and persisting increase can be expected over the next one year. On the other hand, we expect the rate of sales growth of supermarkets to be lagging and tied up constantly in the next 2016 year. Conclusions - Based on 2017 one-year sales forecasts for CS and supermarkets, we can yield the useful information for the development of CS and also for all retail trades. Future study is needed to analyze sales of popular items individually such as tobacco, banana milk, soju and so on and to get segmented results. Furthermore, we can expand sales forecasts to other retail trades such as department stores, hypermarkets, non-store retailing, so that comprehensive diagnostics can be delivered in the future.

• The Korean Journal of Applied Statistics
• /
• v.30 no.6
• /
• pp.993-1004
• /
• 2017

A stratified sampling method is generally used with a sample selected using the same sample weight in each stratum in order to improve the accuracy of the sampling survey estimation. However, the weight should be adjusted to reflect the response rate if the response rate is affected by the value of the variable of interest. It may be also more effective to adjust the weights by subdividing the stratum rather than using the same weight if the variable of interest has a linear relationship with the continuous auxiliary variables. In this study, we propose a method to increase the accuracy of estimation using an informative sampling design technique when the response rate is an exponential function of the variable of interest and the variable of interest has a linear relationship with the auxiliary variable. Simulation results show the superiority of the proposed method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.2
• /
• pp.179-186
• /
• 2015

In the indoor location estimation system, which has recently been actively studied, the received signal strength indicator contains a high level of noise when measuring the signal strength in the range between two nodes consisting of a receiver and a transceiver. To minimize the noise level, this paper proposes an improved adaptive smoothing filter that provides different exponential weights to the current value and previous averaged one of the data that were obtained from the nodes, because the characteristic signal attenuation of the received signal strength indicator generally has a log distribution. The proposed method can effectively decrease the noise level by using a feedback filter that can provide different weights according to the noise level of the obtained data and thus increase the accuracy in the distance and location without an additional filter such as the link quality indicator, which can verify the communication quality state to decrease the range errors in the indoor location recognition using ZigBee based on IEEE 802.15.4. For verifying the performance of the proposed improved adaptive smoothing filter, actual experiments are conducted in three indoor locations of different spatial sections. From the experimental results, it is verified that the proposed technique is superior to other techniques in range measurement.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.76-85
• /
• 1999

The intuitive understanding of the dynamic pattern generation in asymmetric networks may be useful for developing models of dynamic information processing. In this paper, dynamic behavior of the cyclic connection neural network, in which each neuron is connected only to its nearest neurons with binary synaptic weights of $\pm$ 1, has been investigated. Simulation results show that dynamic behavior of the network can be classified into only three categories: fixed points, limit cycles with basin and limit cycles with no basin. Furthermore, the number and the type of limit cycles generated by the networks have been derived through analytical method. The sufficient conditions for a state vector of $n$-neuron network to produce a limit cycle of $n$- or 2$n$-period are also given. The results show that the estimated number of limit cycles is an exponential function of $n$. On the basis of this study, cyclic connection neural network may be capable of storing a large number of dynamic information.