• Journal of Haehwa Medicine
• /
• v.23 no.1
• /
• pp.115-124
• /
• 2014

Objectives : There are plenty of medical record of acupuncture & moxibustion in Traditional East Asian medicine(TEAM). We performed this study to find out the hidden criteria lies on this record to choose proper acupoints. Methods : "Zhenjiuzishengjing", ancient TEAM book was analysed using document clustering techniques. Corpus was made from this book. It contained 196 texts driven from each symptoms. Each texts converted to vector representing frequency of 349 acupoints. Distance of vectors calculated by weighted Euclidean distance method. According to this distances, hierarchical clustering of symptoms was builded. Results : The cluster consisted of five large groups. they had high corelation with body part; head and face, chest, abdomen, upper extremity, lower extremity, back. Conclusions : It assumes that body part of symptom is the most importance criteria of acupoints selecting. some high similar symptom vectors consolidated this result. the other criteria is cause and pathway of illness. some symptoms bound together which had common cause and pathway.

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.854-858
• /
• 1987

This paper considers impulsive noise which produce burst error in high speed(approx.160Kbps) data transmission like ISDN(Integrated Servise Digital Network) using PSTN(Public Switching Telephone Network). To begin with, we obtains the transfer function of subscriber line to calculate the variation of bandwidth when the gain of receiver is fixed and channel capacity of non-gaussian channel in upper-and lower bound, and evaluates the transmission capability. In this paper compares channel capacity bounds which obtains when probability density function of impulsive noise is Laplacian distribution function with impulsive noise generated by waveform synthesier.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2003.05a
• /
• pp.896-901
• /
• 2003

This paper describes a model on shear strength of RC columns strengthened with FRP sheets. In this study, we propose a confined concrete strength model of RC columns confined by transverse reinforcement as well as FRP sheet by introducing corresponding effective confinement coefficient for each confined concrete area. Then, a shear strength model of the confined RC columns is proposed by lower and upper bound limit analysis which are based on the truss-arch model theory and shear band failure theory, respectively. Along with shear test data obtained from strengthened column specimens, the developed analytical models are verified. The comparison shows that the proposed model can be used effectively for the prediction of both ultimate strength and required amount of strengthening in retrofit design for RC columns.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2383-2385
• /
• 2000

It is proposed a new algorithm for a neural network adaptive tracking control scheme to improve performance in this paper. In supervisory control scheme, the upper and lower bound of the parameters are directly estimated by using RBF neural network without their information, and the weighting parameters of the control input are adjusted on-line by adaptation laws. As a result, the proposed algorithm assured that the output errors go to zero without relation to existing minimum approximation errors and disturbances. The effectiveness of the proposed algorithm is demonstrated through the simulation of one-link rigid robotics manipulator.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.2
• /
• pp.3-10
• /
• 1997

Correlation immune functions can be used not only as filter functions or nonlinear combiners in stream ciphers but also as a primitive logic in block cipher. In this paper, we suggest a construction method of correlation immune functions. Using this method, we find lower and upper bound of the cardinality of the correlation immune functions. This result improves Mitchell's result and Yang-Guo's result.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.47-50
• /
• 2003

For large-scale systems which are composed of interconnections of many lower-dimensional subsystems, decentralized control is preferable since it can alleviate the computational burden, avoid communication between different subsystems, and make the control more feasible and simpler. A power system is such a large-scale system where generators are interconnected through transmission lines. Decentralized control is therefore considered for power systems. In this paper, a robust decentralized excitation control scheme for interactions is proposed to enhance the transient stability of multimachine power systems. First we employ a DFL(Direct Feedback Linearization) compensator to rancel most of the nonlinearities; however, the resulting model still contains nonlinear interconnections. Therefore, we design a robust controller in order to deal with Interconnection terms. In this procedure, an upper bound of interconnection terms is estimated by an estimator. The resulting adaptive scheme guarantees the uniform ultimate boundedness of the closed-loop dynamic systems in the presence of the uncertainties.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.283-294
• /
• 2007

By a near ${\lambda}$-lattice is meant an upper ${\lambda}$-semilattice where is defined a parti binary operation $x{\Lambda}y$ with respect to the induced order whenever $x$, $y$ has a common lower bound. Alternatively, a near ${\lambda}$-lattice can be described as an algebra with one ternary operation satisfying nine simple conditions. Hence, the class of near ${\lambda}$-lattices is a quasivariety. A ${\lambda}$-semilattice $\mathcal{A}=(A;{\vee})$ is said to have sectional (antitone) involutions if for each $a{\in}A$ there exists an (antitone) involution on [$a$, 1], where 1 is the greatest element of $\mathcal{A}$. If this antitone involution is a complementation, $\mathcal{A}$ is called an ortho ${\lambda}$-semilattice. We characterize these near ${\lambda}$-lattices by certain identities.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2992-3009
• /
• 2016

The performance of D-MIMO systems is not only affected by multipath fading but also from shadowing fading, as well as path loss. In this paper, we investigate the ergodic capacity of D-MIMO systems operating in non-correlated K fading (Rayleigh/Gamma) channels. With the aid of majorization and Minkowski theory, we derive analytical closed-form expressions of the upper and lower bounds on the ergodic capacity for D-MIMO systems over non-correlated K fading channels, which are quite general and applicable for arbitrary signal-to-noise ratio (SNR) and the number of transceiver antennas. To intuitively reveal the impacts of system and fading parameters on the ergodic capacity, we deduce asymptotic approximations in the high and low SNR regimes. Finally, we pursue the massive MIMO systems analysis for the lower bound and derive closed-form expressions when the number of antennas at BS grows large, and when the number of antennas at transceivers becomes large with a fixed and finite ratio. It is demonstrated that the proposed expressions on the ergodic capacity accurately match with the theoretical analysis.