• Title/Summary/Keyword: vector optimization

Search Result 473, Processing Time 0.025 seconds

Unbound Protein-Protein Docking Using Conformational Space Annealing

  • Lee, Kyoung-Rim;Joo, Kee-Hyoung;Lee, Joo-Young
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.294-299
    • /
    • 2005
  • We have studied unbound docking for 12 protein-protein complexes using conformational space annealing (CSA) combined along with statistical pair potentials. The CSA, a powerful global optimization tool, is used to search the conformational space represented by a translational vector and three Euler amgles between two proteins. The energy function consists of three statistical pair-wise energy terms; one from the distance-scaled finite ideal-gas reference state (DFIRE) approach by Zhou and the other two derived from residue-residue contacts. The residue-residue contact terms describe both attractive and repulsive interactions between two residues in contact. The performance of the CSA docking is compared with that of ZDOCK, a well-established protein-protein docking method. The results show that the application of CSA to the protein-protein docking is quite successful, indicating that the CSA combined with a good scoring function is a promising method for the study of protein-protein interaction.

  • PDF

Development of Stamping Process Optimization System: Integration of Optimal Blank Design and Optimal Nesting (스템핑 공정 최적화 시스템의 개발 : 최적블랭크 설계와 최적배치의 일체화)

  • 심현보;이상헌;박종규;김흥업
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2003.05a
    • /
    • pp.283-287
    • /
    • 2003
  • In recent years, design of an optimal blank shape is very important for sheet metal forming process in the automobile industry because the raw material cost rate is significant part in the automobile industry. With the design of an optimal blank shape, the engineer can protect a blank from an excessive holding force to improve the quality and reduce the ratio of material scrap. Therefore design of an optimal blank shape is inevitable in sheet metal forming process. However, if it causes a complicated shape of blank, it may be difficult to do the blank layout optimally. In this study, we developed software of optimal blank layout connected with the software of optimal blank shape design which was created in the past by the present authors. And by using these softwares, we would like to present the method in order to get optimal utilization ratio easily and precisely within short time for the sequence of works from design to blank layout.

  • PDF

Firing Order Optimization of Medium Speed Diesel Engine Considering Structure and Shaft Vibration (구조 및 축 진동을 고려한 중속 디젤엔진의 착화순서 최적화)

  • Lee, Soo-Mok;Kim, Won-Hyun;Jung, Kun-Hwa
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.840-843
    • /
    • 2006
  • The determination of firing order is very significant procedure in initial stage of design for medium speed diesel engine. Generally, the selection of firing order has been accomplished in view of minimum excitation forces condition. In this paper all possible firing orders under the given number of cylinder were considered to decide the optimum. Meanwhile torsional vibration characteristics using the phase vector sum method and minimum excitation force concept were applied. From these results, some superior cases were selected. And then, the torsional vibration response analysis and the resonance characteristics of engine structure were investigated for the final decision.

  • PDF

Global Path Planning for Autonomous Underwater Vehicles in Current Field with Obstacles (조류와 장애물을 고려한 자율무인잠수정의 전역경로계획)

  • Lee, Ki-Young;Kim, Su-Bum;Song, Chan-Hee
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.4
    • /
    • pp.1-7
    • /
    • 2012
  • This paper deals with the global path planning problem for AUVs (autonomous underwater vehicles) in a tidal current field. The previous researches in the field were unsuccessful at simultaneously addressing the two issues of obstacle avoidance and tidal current-based optimization. The use of a genetic algorithm is proposed in this paper to move past this limitation and solve both issues at once. Simulation results showed that the genetic algorithm could be applied to generate an optimal path in the field of a tidal current with multiple obstacles.

A Multi-Objective TRIBES/OC-SVM Approach for the Extraction of Areas of Interest from Satellite Images

  • Benhabib, Wafaa;Fizazi, Hadria
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.321-339
    • /
    • 2017
  • In this work, we are interested in the extraction of areas of interest from satellite images by introducing a MO-TRIBES/OC-SVM approach. The One-Class Support Vector Machine (OC-SVM) is based on the estimation of a support that includes training data. It identifies areas of interest without including other classes from the scene. We propose generating optimal training data using the Multi-Objective TRIBES (MO-TRIBES) to improve the performances of the OC-SVM. The MO-TRIBES is a parameter-free optimization technique that manages the search space in tribes composed of agents. It makes different behavioral and structural adaptations to minimize the false positive and false negative rates of the OC-SVM. We have applied our proposed approach for the extraction of earthquakes and urban areas. The experimental results and comparisons with different state-of-the-art classifiers confirm the efficiency and the robustness of the proposed approach.

On Parallel Implementation of Lagrangean Approximation Procedure (Lagrangean 근사과정의 병렬계산)

  • 이호창
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.3
    • /
    • pp.13-34
    • /
    • 1993
  • By operating on many part of a software system concurrently, the parallel processing computers may provide several orders of magnitude more computing power than traditional serial computers. If the Lagrangean approximation procedure is applied to a large scale manufacturing problem which is decomposable into many subproblems, the procedure is a perfect candidate for parallel processing. By distributing Lagrangean subproblems for given multiplier to multiple processors, concurrently running processors and modifying Lagrangean multipliers at the end of each iteration of a subgradient method,a parallel processing of a Lagrangean approximation procedure may provide a significant speedup. This purpose of this research is to investigate the potential of the parallelized Lagrangean approximation procedure (PLAP) for certain combinational optimization problems in manufacturing systems. The framework of a Plap is proposed for some combinatorial manufacturing problems which are decomposable into well-structured subproblems. The synchronous PLAP for the multistage dynamic lot-sizing problem is implemented on a parallel computer Alliant FX/4 and its computational experience is reported as a promising application of vector-concurrent computing.

  • PDF

Direct Search Methods for Nonlinear Optimization Problem used ART Theory

  • Son, Jun-Hyeok;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.1830-1831
    • /
    • 2006
  • In this paper, the search is conducted along each of the coordinate directions for finding the minimum. If $e_i$ is the unit vector along the coordinate direction i, we determine the value a, minimizing f(a)= $f(x+ae_i)$, where a is a real number. A move is made to the new point $x+a_ie_i$ at the end of the search along the direction i. In an n dimensional problem, we define the search along all the directions as one stage. The function value at the end of the stage is compared to the value at the beginning of the stage in establishing the convergence. The gradient appears to be zero at point. We can safeguard this by introducing an acceleration step of one additional step along the pattern direction developed by moves along the coordinate directions.

  • PDF

The shortest path finding algorithm using neural network

  • Hong, Sung-Gi;Ohm, Taeduck;Jeong, Il-Kwon;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.434-439
    • /
    • 1994
  • Recently neural networks leave been proposed as new computational tools for solving constrained optimization problems because of its computational power. In this paper, the shortest path finding algorithm is proposed by rising a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defined at first. To obtain this energy function, the concept of a vector-represented network is introduced to describe the connected path. Through computer simulations, it will be shown that the proposed algorithm works very well in many cases. The local minima problem of a Hopfield type neural network is discussed.

  • PDF

Optimization of the Mixing Flow in an Agitated Tank

  • Yoo, Dal-Hyun;Yang, Si-Young;Choi, Youn-Kyu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.151-157
    • /
    • 2005
  • In the chemical, mineral and electronics industries, mechanically stirred tanks are widely used for complex liquid and particle mixing processes. In order to understand the complex phenomena that occur in such tanks, it is necessary to investigate flow field in the vessel. Most difficulty on the numerical analysis of stirred tank flow field focused particularly on free surface analysis. In order to decrease the dead zone and improve the flow efficiency of a system with free surface, this paper presents a new method that overcomes free surface effects by properly combining the benefits of using experiment and 3-D CFD. This method is applied to study the mixing flow in an agitated tank. From the results of experimental studies using the PIV (particle image velocimetry) system, the distribution of mixing flow including free surface are obtained. And these values that are expressed as a velocity vector field have been patched for simulating the free surface. The results of velocity distribution obtained by 3-D CFD are compared with those of experimental results. The experimental data and the simulation results are in good agreement.

  • PDF

Design Optimization and Fabrication of an Advanced High Gradient Magnetic Separator

  • Park, E.B;Choi, S.D;Yang, C.J
    • Journal of Magnetics
    • /
    • v.5 no.2
    • /
    • pp.59-64
    • /
    • 2000
  • A drum type of high gradient magnetic separator was designed and optimized by computer simulations. The magnetic separator consists of high performance rare earth $(Nd_2Fe_14B)$ permanent magnets and magnetic yokes of extremely low carbon steel interconnecting the permanent magnets. Magnetic circuits of the separator were simulated for the aim of the least cost, highest magnetic strength and most efficient function by using specialized S/W (Vector Field Program) employing the Finite Element Method. The magnetic flux density was provided to be strong enough to collect the invisible fine metal particles from the surface of hot rolled steel plate with the efficiency of almost 95%.

  • PDF