• Computational Structural Engineering
• /
• v.9 no.4
• /
• pp.141-154
• /
• 1996

Delaunay triangulation is a very powerful method of mesh generation for its versatility such as handling complex geometries, element density control, and local/global remeshing capability, The limit of generating simplex elements(3-node elements in 2-D) only is resolved by adding generation module of 6-node quadratic elements. Since proposed adjacency does not change from 3-node element mesh to 6-node mesh, generation module can utilize the original simplex element generator. Therefore, versatility of the Delaunay triangulation is preserved. A simple upsetting problem is employed to show the possibility of the algorithm.

• YAKHAK HOEJI
• /
• v.38 no.3
• /
• pp.345-350
• /
• 1994

Fourteen melandrin derivatives(I-XIV) were investigated on analgesic, anti-inflammatory and antiviral activities . Compound I [N-(p-hydroxybenzoyl)-5-hydroxyanthranilic acid methvl ester], Xll [N-(2-phenoxypropionyl)-5-hydroxy anthranilic acid propyl ester and XIV [N-(2-phenoxypropionyl)-5-hydroxyanthranilic acid exhibited analgesic activity in tail pressure and Randall-Selitto method. But no anti-inflammatory activity was shown. Compound I exhibited weak antiviral activity on Herpes simplex virus type I F strain by virus-induced cytopathic effect(CPE) assay and it's selectivity index(Sl) was 8.17.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Journal of Astronomy and Space Sciences
• /
• v.13 no.1
• /
• pp.48-54
• /
• 1996

The generalized linear impulsive correction problem is applied to make a linear programming problem for optimizing trajectory of an orbiting spacecraft. Numerical application for the stationkeeping maneuver problem of geostationary satellite shows that this problem can efficiently find the optimal solution of the stationkeeping parameters, such as velocity changes, and the points of impulse by using the revised simplex method.

• Korean Management Science Review
• /
• v.6 no.2
• /
• pp.97-104
• /
• 1989

본 논문에서는 선형계획법에 비제약 변수가 포함될 경우 발생되는 제반 이론을 정리하고, 이를 이용하여 원문제를 소거법이나 치환법을 사용하지 않고 해를 구하는 변형된 수정단체법을 제시하려고 한다.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.398-403
• /
• 2008

Data broadcasting is a mechanism to transmit information to clients in simplex transmission environments. In this mechanism, server transmits to repeat all information to all users and users use a necessary data when the data is transmitted. Therefore users are waiting the necessary data until the data is transmitted. It is important to reduce user's waiting time. Server schedules the data to reduce waiting time. In this paper, we study efficient data scheduling algorithm. The result shows that the performance of the proposed method is increased 13 percent compared to the method considering only request frequency.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.10
• /
• pp.1203-1210
• /
• 2007

The multibeam surveillance radar is a state-of-art of 3D radar technology. It applies the stacked beam-on-received realized by a digital beamformer. In this paper, a method of a low target altitude extraction for multibeam surveillance radar in multipath environmental condition is proposed and investigated. The model of multipath propagation and radar generation produced from the low altitude target in multibeam surveillance radar and the nelder-mead simplex multipath reduction(NMSMR) method which enables a reliable low altitude target extraction in specular reflection situations are described. The proposed algorithm is simulated to confirm the effectiveness of proposed algorithm in accordance with a various of target altitudes and radar frequencies.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.12 no.5
• /
• pp.380-388
• /
• 2002

This paper describes the optimum design for low-pressure steam turbine rotor of 1,000 MW nuclear power plant by using a combined genetic algorithm, which uses both a genetic algorithm and a local concentrate search algorithm (e.g. simplex method). This algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The objective is to minimize the resonance response (Q factor) and total weight of the shaft, and to separate the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables. The results show that the proposed algorithm can improve the Q factor and reduce the weight of the shaft and the 1st critical speed.

• Tunnel and Underground Space
• /
• v.15 no.5 s.58
• /
• pp.344-351
• /
• 2005

Direct back analysis software is coded based on Simplex method using FLAC as a subroutine. For the verification of the software, 12 different cases are assumed combining various displacements in different measuring locations around a tunnel. The number of displacements for cases varies from 3 to 240. It is verified that the exact elasticity and the primary stress state of rock around a tunnel could be found through iterative calculation regardless of the locations and number of displacements and initial values needed for the direct back analysis.