• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.1
• /
• pp.11-16
• /
• 1982

A method is described for the solution of a linearly constrained program with parametric nonlinear objective function. The algorithm proposed in this paper may be regarded as an extension of the simplex method for parametric linear programming. Namely, it specifies the basis at each stage such that feasibility ana optimality of the original problem are satisfied by the optimal solution of the reduced parametric problem involving only nonbasic variables. It is shown that under appropriate assumptions the algorithm is finite. Parametric procedures are also indicated for solving each reduced parametric problem by maintaining the Kuhn-Tucker conditions as the parameter value varies.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.1
• /
• pp.81-87
• /
• 2008

This study is about the back analysis to optimize the uncertain parameters of geotechnical properties used in stability analysis of cut and cover tunnel. The Simplex algorithm, Powell algorithm, Rosenbrock algorithm, and Levenberg-Marquardt algorithm are applied for artificial problems of ground excavation. Furthermore, results are compared in the matter of the reliability of optimal solutions with a certain accuracy and the computation speed for evaluations of variables. As shown in results of numerical analysis, all of four algorithms are converged to exact solution satisfying the allowable criteria. And Levenberg-Marquardt's and Rosenbrock's algorithms are identified to be the more efficient methods in the evaluations of functions. After the back analysis for Poisson ratio and Young's modulus for cut and cover tunnel has been performed, design parameters have been correctly estimated and computation time has been improved while the number of measure points is increased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2158-2165
• /
• 2007

In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

• Journal of Mechanical Science and Technology
• /
• v.20 no.4
• /
• pp.437-446
• /
• 2006

Laser vision inspection systems are becoming popular for automated inspection of manufactured components. The performance of such systems can be enhanced by improving accuracy of the hardware and robustness of the software used in the system. This paper presents a new approach for enhancing the capability of a laser vision system by applying hardware compensation and using efficient analysis software. A 3D geometrical model is developed to study and compensate for possible distortions in installation of gantry robot on which the vision system is mounted. Appropriate compensation is applied to the inspection data obtained from the laser vision system based on the parameters in 3D model. The present laser vision system is used for dimensional inspection of car chassis sub frame and lower arm assembly module. An algorithm based on simplex search techniques is used for analyzing the compensated inspection data. The details of 3D model, parameters used for compensation and the measurement data obtained from the system are presented in this paper. The details of search algorithm used for analyzing the measurement data and the results obtained are also presented in the paper. It is observed from the results that, by applying compensation and using appropriate algorithms for analyzing, the error in evaluation of the inspection data can be significantly minimized, thus reducing the risk of rejecting good parts.

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

• Journal of the Society of Naval Architects of Korea
• /
• v.40 no.5
• /
• pp.26-35
• /
• 2003

Propellers operating in a given nonuniform ship wake generate unsteady loads leading to undesirable stern vibration problems. The skew is known to be the most proper and effective geometric parameter to control or reduce the fluctuating forces on the shaft. This paper assumes the skew profile as either a quadratic or a cubic function of the radius and determines the coefficients of the polynomial function by applying the simplex method. The method uses the converted unconstrained algorithm to solve the constrained minimization problem of 6-component shaft excitation forces. The propeller excitation was computed either by applying the two-dimensional gust theory for quick estimation or by the fully three-dimensional unsteady lifting surface theory in time domain for an accurate solution. A sample result demonstrates that the shaft forces can be further reduced through optimization from the original design.

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

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.67-75
• /
• 2002

This paper deals with the visualization method of solutions of the linear programming Problem. We used the revised simplex method for the LP algorithm. To represent the solutions at each iteration, we need the informations of feasible legion and animated effect of solutions. For the visualization in high dimension space, we used the method of Projection to the three dimensions if the decision variable vector is over three dimensions, and we studied the technique of preserving original Polyhedral information such as the number of vertices. In addtion, we studied the method of visualizing unbounded feasible region and the adjacency relationship of the vortices welch is Indispensable to cisualize feasible legion.

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