• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1368-1375
• /
• 1993

This paper deals with the decentralized robust adaptive controller design for large-scale interconnected systems. We consider an arbitrary interconnection of subsystems with unkown parameters and bounded disturbances. When the disturbance and uncertain interconnections are present, the stability of the controlled large scale system is ensured if there exists a positive definite M-matrix which is related to the bound of the interconnections. The possible bound of the interconnections is assumed to be known Pth order polynomials for the decentralized adaptive controller. A modified adaptive law is proposed guaranteeing the existence of a region of attraction from which all signals converge to a residual set Do, which contains the equilibrium.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1329-1335
• /
• 2001

부호화 시스템의 성능 분석은 일반적으로 BER(Bit Error Rate)을 이용하여 이루어지는데, 많은 시간을 요하는 정확한 BER을 구하는 대신 근사치인 상한값(upper bound)을 이용하는 경우도 많다. 그러므로 실제 값과 가까운 BER 상한값을 구하는 것은 중요한 일이다. 터보부호의 경우 테일 비트(tail bit)에 의한 영향이 무시되는 블록 길이가 긴 경우[1]에 BER 상한값이 보고되었다. 그러나 테일 달기(tail terminating) 기법을 사용하면서 블록 길이가 짧을 경우 추가되는 테일 비트가 BER 상한값에 미치는 영향은 무시할 수 없게 된다. 따라서 본 논문에서는 테일비트를 고려한 터보부호의 BER 상한값 계산 방법을 제시한다. 그리고 테일 달기 기법보다 복잡하지만 테일 비트가 없으므로 블록 길이가 짧은 경우 효율적으로 사용될 수 있는 테일 물기(tail-biting) 기법을 이용하느 터보부호의 BER 상한값 계산 방법도 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.522-527
• /
• 2012

In this paper, union upper bound on convolutional coded bit error rates (BER) is derived for downlink orthogonal frequency division multiple access (OFDMA) networks. According to the numerical results, for the small network loads, the BER performance with Laplacian decoding metric outperforms the BER performance with Gaussian decoding metric under downlink OFDMA networks with Viterbi decoder.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.650-653
• /
• 2005

In this paper, adaptive high-order neural network controller(AHONNC) is adopted to control an induction servomotor. A algorithm is developed by combining compensation control and high-order neural networks. Moreover, an adaptive bound estimation algorithm was proposed to estimate the bound of approximation error. The weight of the high-order neural network can be online tuned in the sense of the Lyapunov stability theorem; thus, the stability of the closed-loop system can be guaranteed. Simulation results for induction servomotor drive system are shown to confirm the validity of the proposed controller.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.443-449
• /
• 2002

In this paper, we propose a programmable method that can connect the control network with the Internet by using an ordinary PC, which is operated by GNU/LINUX. We make a physical connection between an ordinary PC and control network. Then, a PC can be bound with a particular control network. Moreover, numerous PCs that are bound with particular control networks have addresses of there own on the Internet. So, these PCs are connected each other very well. Consequently, all control networks can be observed and controlled with data transfer between these PCs.

• Journal of Pharmaceutical Investigation
• /
• v.19 no.1
• /
• pp.15-20
• /
• 1989

The displacement of protein bound sulfonamides (sulfisoxazole, sulfamethoxazole, sulfisomidine) by furosemide was investigated in bovine serum albumin by equilibrium dialysis method. Furosemide $(2{\times}10^{-4}M)$ in bovine serum albumin ($7.24{\times}10^{-5}$, $1.45{\times}10^{-4}$, $2.89{\times}10^{-4}M$). Sulfisoxa캐1e and furosemide were bound reversibly to bovine serum albumin and competitive for the same binding sites when administered together. Consequently, dosage regimen of sulfisoxazole should be adjusted carefully when sulfisoxazole is administered along with furosemide.

• Management Science and Financial Engineering
• /
• v.11 no.1
• /
• pp.49-61
• /
• 2005

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.91-106
• /
• 1994

In mixed model assembly lines, products are assembled seqeuntially that have different combination of options specified by customers. In just in time (JIT) environment, production smoothing becomes an important issue for sub-lines which supply the necessary parts to each workstation of the assembly line. Another important issue is to avoid line stopping caused by work overload in workstations. To find a sequence which minimizes the costs associated with line stoppage and the option parts inventory level, a nonlinear mixed integer programming is formulated. Recognizing the limit of the Branch and Bound technique in large sized problems, a heuristic solution procedure is proposed. The performance of the heuristic is compared with the Branch and Bound technique through randomly generated test problems. The computational results indicate that on the average the heuristic solutions deviate approximately 3.6% from the optimal solutions.