• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.9
• /
• pp.33-44
• /
• 2006

As many scientific phenomena are now investigated using complex computer models, the effective use of Kriging on physical problems has been expanded to provide global approximations for optimization problems. This paper is focused on the two types of strategies to improve efficiency and accuracy of approximate optimization models using Kriging. These methods are performed by the stochastic process, stochastic-localization method(SLM), as the criterion to move the local domains and the design of experiments(DOE), the classical design and space-filling design. The proposed methodology is applied to the designs of 3-bar truss, Sandgren's pressure vessel, and honeycomb upper platform of a satellite structure.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1362-1365
• /
• 2003

On this study. we improved the efficiency applying algorithm that is repeatedly using orthogonal array in discrete design space and filling a defect of gradient method in continuous design space. we showed optimal ply angle that maximized buckling strength of CFRP laminated composite plate without a hole and with a hole by each aspect ratio. In the case of CFRP laminated composite plate without a hole, we confirmed the reliance and efficiency of algorithm in comparison with the result optimization achievement repeatedly using statistical orthogonal array of experimental design.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.6
• /
• pp.423-429
• /
• 2003

On this study. we improved the efficiency applying algorithm that is repeatedly using table of orthogonal array in discrete design space and filling a defect of gradient method in continuous design space. we showed optimal ply angle that maximized 1st natural frequency of CFRP laminated composite plate without a hole and with a hole by each aspect ratio. In the case of CFRP laminated composite plate without a hole, we confirmed the reliance and efficiency of algorithm in comparison with the result of optimization achievement repeatedly using statistical table of orthogonal array of experimental design and the BFGS optimal design method.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.11
• /
• pp.1760-1767
• /
• 2004

Sequential sampling approaches of a metamodel that sampling points are updated sequentially become a significant consideration in metamodeling technique. Sequential sampling design is more effective than classical space filling design of all-at-once sampling because sequential sampling design is to add new sampling points by means of distance between sampling points or precdiction error obtained from metamodel. However, though the extremum points can strongly reflect the behaviors of responses, the existing sequential sampling designs are inefficient to approximate extremum points of original model. In this research, new sequential sampling approach using the sensitivity of Kriging model is proposed, so that new approach reflects the behaviors of response sequentially. Various sequential sampling designs are reviewed and the performances of the proposed approach are compared with those of existing sequential sampling approaches by using mean squared error. The accuracy of the proposed approach is investigated against optimization results of test problems so that superiority of the sensitivity approach is verified.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.

• Journal of Biomedical Engineering Research
• /
• v.38 no.3
• /
• pp.116-122
• /
• 2017

Physical breast phantoms would be useful for the development of a dedicated breast computed tomography (BCT) system and its optimization. While the conventional breast phantoms are available in compressed forms, which are appropriate for the mammography and digital tomosynthesis, however, the BCT requires phantoms in uncompressed forms. Although simple cylindrical plastic phantoms can be used for the development of the BCT system, they will not replace the roles of uncompressed phantoms describing breast anatomies for a better study of the BCT. In this study, we have designed a numerical voxel breast phantom accounting for the random nature of breast anatomies and applied it to the 3D printer to fabricate the uncompressed anthropomorphic breast phantom. The numerical voxel phantom mainly consists of the external skin and internal anatomies, including the ductal networks, the glandular tissues, the Cooper's ligaments, and the adipose tissues. The voxel phantom is then converted into a surface data in the STL file format by using the marching cube algorithm. Using the STL file, we obtain the skin and the glandular tissue from the 3D printer, and then assemble them. The uncompressed breast phantom is completed by filling the remaining space with oil, which mimics the adipose tissues. Since the breast phantom developed in this study is completely software-generated, we can create readily anthropomorphic phantoms accounting for diverse human breast anatomies.