• Journal of Korean Society of Steel Construction
• /
• 제27권2호
• /
• pp.131-142
• /
• 2015

In this paper, we present an optimization of truss structures subjected to stress, buckling, and natural frequency constraints. The main objective of the present study is to propose an efficient HA-SA algorithm for solving the truss optimization subject to multiple constraints. The procedure of hybrid HA-SA is a search method which a design values in harmony memory of harmony search are used as an initial value designs in simulated annealing search method. The efficient optimization of HA-SA is illustrated through several optimization examples. The examples of truss structures are used 10-Bar truss, 52-Bar truss (Dome), and 72-Bar truss for natural frequency constraints, and used 18-Bar truss and 47-Bar (Tower) truss for stress and buckling constraints. The optimum results are compared to those of different techniques. The numerical results are demonstrated the advantages of the HA-SA algorithm in truss optimization with multiple constraints.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• 제40권3호
• /
• pp.171-180
• /
• 2003

A content-based image retrieval(CBIR) system builds the image database using low-level features such as color, shape and texture and provides similar images that user wants to retrieve when the retrieval request occurs. What the user is interest in is a response time in consideration of the building time to build the index database and the response time to obtain the retrieval results from the query image. In a content-based image retrieval system, the similarity computing time comparing a query with images in database takes the most time in whole response time. In this paper, we propose the two-phase search method with the clustering technique of feature vector in order to minimize the similarity computing time. Experimental results show that this two-phase search method is 2-times faster than the conventional full-search method using original features of ail images in image database, while maintaining the same retrieval relevance as the conventional full-search method. And the proposed method is more effective as the number of images increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권7C호
• /
• pp.719-725
• /
• 2003

The content-based image retrieval system extracts features of color, shape and texture from raw images, and builds the database with those features in the indexing process. The search in the whole retrieval system is defined as a process which finds images that have large similarity to query image using the feature database. This paper proposes a new two-stage search method in the content-based image retrieval system. The method is that the features are condensed and stored by the property of Cauchy-Schwartz inequality in order to reduce the similarity computation time which takes a mostly response time from entering a query to getting retrieval results. By the extensive computer simulations, we have observed that the proposed two-stage search method successfully reduces the similarity computation time while maintaining the same retrieval relevance as the conventional exhaustive search method. We also have observed that the method is more effective as the number of images and dimensions of the feature space increase.

• Journal of KIISE:Databases
• /
• 제29권5호
• /
• pp.381-392
• /
• 2002

This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a given query sequence regardless of their actual element values. In this paper, we propose an effective and efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval based on the similarity model, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup up to around 66 times compared with the sequential scan method.

• BMB Reports
• /
• 제29권1호
• /
• pp.38-44
• /
• 1996

Taq DNA polymerase from Thermus aquaticus has been shown to be very useful in the polymerase chain reaction method, which is being used for amplifying DNA. Not only does Taq DNA polymerase have high commercial value commercial value for the polymerase chain reaction application, but it is also important in studying DNA replication, because it is apparently an homologue to E. coli DNA polymerase I, which has long been used for DNA replication study (Lawyer et ai., 1993). The crystal structure determination of Taq DNA polymerase was initiated. An X-ray diffraction pattern breaks down a crystal structure into discrete sine waves in a Fourier series. The original shape of a crystal object in terms of electron density may be represented as the sum of those sine waves with varying amplitudes and phases in three dimensions. The molecular replacement method was initially employed to provide phase information for the structure of Taq DNA polymerase. The rotation search using the program MERLOT resulted in a solution peak with 5.4 r.m.s. PC-refinement of the X-PLOR program verified the result and also optimized the orientation angles. Next, the translation search using the X-PLOR program resulted in a unique solution peak with 7.35 r.m.s. In addition, the translation search indicated $P3_121$ to be the true space group out of two possible ones. The phase information from the molecular replacement was useful in the MIR phasing experiment.

• Land and Housing Review
• /
• 제1권1호
• /
• pp.1-7
• /
• 2010

Case-based reasoning (CBR) method can make estimators understand the estimation process more clearly. Thus, CBR is widely used as a methodology for cost estimation. In CBR, the quality of case retrieval affects the relevance of retrieved cases and hence the overall quality of the reminding capability of CBR system. Thus, it is essential to retrieve relevant past cases for establishing a robust CBR system. Case retrieval needs the following tasks to obtain appropriate case(s); indexing, search, and matching (Aamodt and Plaza 1994). However, the previous CBR researches mostly deal with matching process that has limits such as accuracy and efficiency of case retrieval. In order to address this issue, this research presents a CBR cost model for building projects that has two-step retrieval process: decision tree and nearest neighbor methods. Specifically, the proposed cost model has indexing, search and matching modules. Features in the model are divided into shape-based and scale-based attributes. Based on these, decision tree is established for facilitating the search task and nearest neighbor method was utilized for matching task. In regard to applying nearest neighbor method, attribute weights are assigned using GA optimization and similarity is calculated using the principle of distance measuring. Thereafter, the proposed CBR cost model is developed using 174 cases and validated using 12 test cases.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제8권5호
• /
• pp.968-972
• /
• 2007

The importance of bumper system lies not only in the styling of vehicles, but also in the protection of vehicles and pedestrians from reasonable impact. In this study, we proceed to search a method for efficient bumper system without using the impact test and the computer simulation to analyze the bumper system. In the process of the research, we proposed the each method that is used to search the shape that satisfy each regulations in first, because bumper's dimensions to satisfy 'vehicle protection' regulations and form's dimensions to satisfy ‘pedestrian protection' regulations are difficult to exist together. After that we proposed the calculate method and design algorithm that is used to search a reasonable point satisfying the two regulations together.

• IEMEK Journal of Embedded Systems and Applications
• /
• 제16권6호
• /
• pp.323-330
• /
• 2021

Visual object tracking is a challenging area of study in the field of computer vision due to many difficult problems, including a fast variation of target shape, occlusion, and arbitrary ground truth object designation. In this paper, we focus on the reinforced feature of the dynamic search area to get better performance than conventional discriminative model prediction trackers on the condition when the accuracy deteriorates since low feature discrimination. We propose a reinforced input feature method shown like the spotlight effect on the dynamic search area of the target tracking. This method can be used to improve performances for deep learning based discriminative model prediction tracker, also various types of trackers which are used to infer the center of the target based on the visual object tracking. The proposed method shows the improved tracking performance than the baseline trackers, achieving a relative gain of 38% quantitative improvement from 0.433 to 0.601 F-score at the visual object tracking evaluation.

• The Journal of Korea Robotics Society
• /
• 제17권4호
• /
• pp.455-462
• /
• 2022

Since electric connectors such as power connectors have a small assembly tolerance and have a complex shape, the assembly process is performed manually by workers. Especially, it is difficult to overcome the assembly error, and the assembly takes a long time due to the error correction process, which makes it difficult to automate the assembly task. To deal with this problem, a reinforcement learning-based assembly strategy using contact states was proposed to quickly perform the assembly process in an unstructured environment. This method learns to generate a search trajectory to quickly find a hole based on the contact state obtained from the force/torque data. It can also learn the stiffness needed to avoid excessive contact forces during assembly. To verify this proposed method, power connector assembly process was performed 200 times, and it was shown to have an assembly success rate of 100% in a translation error within ±4 mm and a rotation error within ±3.5°. Furthermore, it was verified that the assembly time was about 2.3 sec, including the search time of about 1 sec, which is faster than the previous methods.

• Transactions of Materials Processing
• /
• 제16권2호
• /
• pp.138-143
• /
• 2007

Superplastic forming/diffusion bonding (SPF/DB) processes were analyzed using a 3-D rigid visco-plastic finite element method. A constant-triangular element based on membrane approximation and an incremental theory of plasticity are employed for the formulation. The coulomb friction law is used for interface friction between tool and material. Pressure-time relationship for a given optimal strain rate is calculated by stress and pressure values at the previous iteration step. In order to improve the contact searching, hierarchical search algorithm has been applied and implemented into the code. Various geometries including sandwich panel and 3 sheet shape for 3-D SPF/DB model are analyzed using the developed program. The validity fer the analysis is verified by comparison between analysis and results in the literature.