• Journal of the Korean Society of Marine Environment & Safety
• /
• v.1 no.2
• /
• pp.69-82
• /
• 1995

This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.5
• /
• pp.1013-1017
• /
• 2008

Syndecan-3 is a cell-surface heparan sulfate proteoglycan, which performs a variety of functions during cell adhension process. It is also a coreceptor for growth factor, mediating cell-cell and cell-matrix interaction. Syndecan-3 contains a cytoplasmic domain potentially associated with the cytoskeleton. Syndecan-3 is specifically expressed in neuron cell and has related to neuron cell differentiation and development of actin filament in cell migration. Syndecans each have a unique, central, and variable (V) region in their cytoplasmic domains. And that region of syndecan-3 may modulate the interactions of the conserved C1 regions of the cytoplasmic domains by tyrosine phosphorylation. Cytoplasmic domain of syndecan-3 has been synthesized for NMR structural studies. The solution structure of syndecan-3 cytoplasmic domain has been determined by two-dimensional NMR spectroscopy and simulated-annealing calculation. The cytoplasmic domain of the syndecan proteins has a tendency to form a dimmer conformation with a central cavity, however, that of syndecan-3 demonstrated a monomer conformation with a flexible region near C-terminus. The structural information might add knowledge about the structure-function relationships among syndecan proteins.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.5
• /
• pp.428-434
• /
• 2016

A lot of drawings for pipe construction and installation are needed to construct plant process system on the offshore plant structures. Depending on their scale or complexity, the required number of drawings related pipes sometimes amounts to several hundreds of thousands. Most major shipyards, therefore, have their own system which can automatically depict pipes’ geometric, manufacturing, and BOM(Bill of Material) information on the drawings. However, as the complexity and absolute quantity in the isometric region on the drawings is increased, the information extraction from the customized DB and positioning at the typical locations does not get to be enough to avoid the overlap between geometric contours, labels, and symbols. For this reason, the novel methods to arrange additional annotations without overlaps are presented in the paper. This approach is expected to increase the readability and legibility of the drawing and prevent the human error, and finally decrease the time-consuming and tedious jobs which are unnecessarily required to designers.

• Journal of Integrative Natural Science
• /
• v.2 no.2
• /
• pp.55-58
• /
• 2009

A ligand-receptor docking program is an indispensible tool in modern pharmaceutical design. An accurate prediction of small molecular docking pose to a receptor is essential in drug design as well as molecular recognition. An effective docking program requires the ability to locate a correct binding pose in a surprisingly complex conformational space. However, there is an inherent difficulty to predict correct binding pose. The odds are more demanding than finding a needle in a haystack. This mainly comes from the flexibility of both ligand and receptor. Because the searching space to consider is so vast, receptor rigidity has been often applied in docking programs. Even nowadays the receptor may not be considered to be fully flexible although there have been some progress in search algorithm. Improving the efficiency of searching algorithm is still in great demand to explore other applications areas with inherently flexible ligand and/or receptor. In addition to classical search algorithms such as molecular dynamics, Monte Carlo, genetic algorithm and simulated annealing, rather recent algorithms such as tabu search, stochastic tunneling, particle swarm optimizations were also found to be effective. A good search algorithm would require a good balance between exploration and exploitation. It would be a good strategy to combine algorithms already developed. This composite algorithms can be more effective than an individual search algorithms.

• Journal of Integrative Natural Science
• /
• v.3 no.1
• /
• pp.49-53
• /
• 2010

Molecular docking is a critical event which mostly forms Van der waals complex in molecular recognition. Since the majority of developed drugs are small molecules, docking them into proteins has been a prime concern in drug discovery community. Since the binding pose space is too vast to cover completely, many search algorithms such as genetic algorithm, Monte Carlo, simulated annealing, distance geometry have been developed. Proper evaluation of the quality of binding is an essential problem. Scoring functions derived from force fields handle the ligand binding prediction with the use of potential energies and sometimes in combination with solvation and entropy contributions. Knowledge-based scoring functions are based on atom pair potentials derived from structural databases. Forces and potentials are collected from known protein-ligand complexes to get a score for their binding affinities (e.g. PME). Empirical scoring functions are derived from training sets of protein-ligand complexes with determined affinity data. Because non of any single scoring function performs generally better than others, some other approaches have been tried. Although numerous scoring functions have been developed to locate the correct binding poses, it still remains a major hurdle to derive an accurate scoring function for general targets. Recently, consensus scoring functions and target specific scoring functions have been studied to overcome the current limitations.

• Speech Sciences
• /
• v.10 no.4
• /
• pp.7-21
• /
• 2003

Sums-of-Products models were built for segment duration prediction of spoken Korean. An experiment for the modelling was carried out to apply the results to Korean text-to-speech synthesis systems. 670 read sentences were analyzed. trained and tested for the construction of the duration models. Traditional sequential rule systems were extended to simple additive, multiplicative and additive-multiplicative models based on Sums-of-Products modelling. The parameters used in the modelling include the properties of the target segment and its neighbors and the target segment's position in the prosodic structure. Two optimisation strategies were used: the downhill simplex method and the simulated annealing method. The performance of the models was measured by the correlation coefficient and the root mean squared prediction error (RMSE) between actual and predicted duration in the test data. The best performance was obtained when the data was trained and tested by ' additive-multiplicative models. ' The correlation for the vowel duration prediction was 0.69 and the RMSE. 31.80 ms. while the correlation for the consonant duration prediction was 0.54 and the RMSE. 29.02 ms. The results were not good enough to be applied to the real-time text-to-speech systems. Further investigation of feature interactions is required for the better performance of the Sums-of-Products models.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.417-424
• /
• 1995

This paper describes MFT(Mean Field Theory) neural network with continuous with continuous variables is applied to quantification analysis problem. A quantification analysis problem, one of the important problems in statistics, is NP complete and arises in the optimal location of objects in the design space according to the given similarities only. This paper presents a MFT neural network with continuous variables for the quantification problem. Starting with reformulation of the quantification problem to the penalty problem, this paper propose a "one-variable stochastic simulated annealing(one-variable SSA)" based on the mean field approximation. This makes it possible to evaluate of the spin average faster than real value calculating in the MFT neural network with continuous variables. Consequently, some experimental results show the feasibility of this approach to overcome the difficulties to evaluate the spin average value expressed by the integral in such models.ch models.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.241-248
• /
• 2000

Until now, all of the port goods are transported manually by container transporter in the port. Recently there are a lot of studies about unmanned vehicle driven automatically. In terms of the vehicle automation, the control of steering and velocity on vehicle systems is very important part in container transporter. In common sense, vehicle systems have lots of nonlinear parameters so we have many difficulties in designing the optimal controller of them. In this paper, we present a design of the TDOF PID controller using a hybrid schematic algorithm to control the steering system optimally. We used the single-track model to pre-test the designed controller before appling to AGV. We also used the ES(evolutionary strategy) and SA(simulated annealing) algorithms to construct the hybrid tuning algorithm for parameters of controller. Finally, we had the computer simulation to verify that our designed controller has better performance than the other one.

• Geomechanics and Engineering
• /
• v.1 no.1
• /
• pp.85-96
• /
• 2009

The radius and coordinate of sliding circle are taken as searching variables in slope stability analysis. Genetic algorithm is applied for searching for critical factor of safety. In order to search for critical factor of safety in slope stability analysis efficiently and in a robust manner, some improvements for simple genetic algorithm are proposed. Taking the advantages of efficiency of neighbor-search of the simulated annealing and the robustness of genetic algorithm, a hybrid optimization method is presented. The numerical computation shows that the procedure can determine the minimal factor of safety and be applied to slopes with any geometry, layering, pore pressure and external load distribution. The comparisons demonstrate that the genetic algorithm provides a same solution when compared with elasto-plastic finite element program.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.2
• /
• pp.48-55
• /
• 2010

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.