• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.3
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.317-333
• /
• 2024

For the classes of analytic functions f defined on the unit disk satisfying ${\frac{2zf'(z)}{f(z)-f(-z)}}{\prec}{\varphi}(z)$) and ${\frac{(2zf'(z))'}{(f(z)-f(-z))'}}{\prec}{\varphi}(z)$, denoted by S^*_s(𝜑) and C_s(𝜑), respectively, the sharp bound of the n^th Taylor coefficients are known for n = 2, 3 and 4. In this paper, we obtain the sharp bound of the fifth coefficient. Additionally, the sharp lower and upper estimates of the third order Hermitian Toeplitz determinant for the functions belonging to these classes are determined. The applications of our results lead to the establishment of certain new and previously known results.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1998-2004
• /
• 1997

In this paper, we have analyzed the bit error performance ofthe chip-spreading OCDM system proposed in the previous papaer and compared the results, through computer simulations, with those of conventional DS/CDMA system which employs the maximal ration combining method. WE have shown, analytically, that the BER upper bound of the OCDM system coincides with that of the conventional DS/CDMA system and the lower bound exhibits much improved results. From the simulation results, we have confirmed that the BER curves of proposed OCDM system actually lie between the two theoretical bounds and its performance is superior to that of the DS/CDMA system.

• Journal of Korean Society of Steel Construction
• /
• v.25 no.2
• /
• pp.187-196
• /
• 2013

CFT structures require a diaphragm to prevent buckling of steel at connections. An outer diaphragm has better concrete filling than a through diaphragm due to a large bore, but due to the larger size than the through diaphragm, it has poorer constructability and cooperation with building equipment. The building structure has a floor slab that was unified with the upper diaphragm, so the outer diaphragm was placed at the upper bound. Moreover, the through diaphragmwas placed at the lower connection to avoid obstruction of the building equipment. The CFT structure with the improved concrete filling showed the same structural behavior as the CFT structure with the use of the same type of diaphragms at the upper and lower connections.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2007

In this paper we show that for each finite frame for a Hilbert space there are two orthonormal elements related to the optimal lower and upper bounds of the frame. Based on this we show that an orthonormal basis is naturally associated with every finite frame. We then analyze the relationship between such an orthonormal basis and the given finite frame.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1999.10a
• /
• pp.137-146
• /
• 1999

The SSI(Soil-Structure Interaction) analyses are being performed for the KNGR(Korean Next Generation Reactor) design because the KNGR is developed as a standard nuclear power plant concept enveloping various soil conditions. the SASSI program which adopts the flexible volume method is used for the SSI analyses. The soil curves used in the three dimensional SSI analyses of KNGR Nuclear Island(NI) structures are based on the upper bound shear modulus curve and lower bound damping degradation on SSI response the average shear modulus curve with average damping curve was used for two soil cases. This study presents the results of the variances by using different soil nonlinearity parameters based on the paametric SSI analyses. The results include the maximum member forces(shear and axial force) at the base of the NI structures and the 5% damping Floor Response Spectra (FRS) at some representative locations at the top of the NI superstructures. They are also compared together with the enveloped SSI results for eight soil cases and fixed-base analysis for rock case by using two control motions.

• Journal of Korean Society for Quality Management
• /
• v.26 no.3
• /
• pp.71-81
• /
• 1998

In reliability analysis, the time difference between the expected next failure time and the current failure time or the Mean Time Between Failure(MTBF) is of significant interest. Until recently, in reliability growth studies, the reciprocal of the intensity function at current failure time has been used as being equal to MTBE($t_n$)at the n-th failure time $t_n$. That is MTBF($t_n$)=l/$\lambda (t_n)$. However, such a relationship is only true for Homogeneous Poisson Process(HPP). Tsokos(1995) obtained the upper bound and lower bound for the MTBF($t_n$) and proposed an estimator for the MTBF($t_n$) as the mean of the two bounds. In this paper, we provide the estimator for the MTBF($t_n$) which does not depend on the value of the shape parameter. The result of the Monte Carlo simulation shows that the proposed estimator has better efficiency than Tsokos's estimator.