• Journal of the Korea Convergence Society
• /
• v.10 no.6
• /
• pp.59-64
• /
• 2019

This study used the Google Trends site to analyze selection information that users expect from prominent Toothbrushes and Toothpastes through related search keywords that users wanted to obtain. From 2006 to 2018(sep), searches for Toothbrushes and Toothpastes were arranged in the order of popularity of related searched words. The total number of searches words exposed was each 25, total 325 collected. The analysis was conducted using two methods, first, by search function. second, by a word network using a Big Data program. The study has shown that toothbrushes there are high expectations for brands, toothpaste there are high expectations in the function. In order to increase the motivation for oral health education, it is recommended to use and provide knowledge about the brand of toothbrushes and Toothpastes by the function.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.1
• /
• pp.33-40
• /
• 2022

With the recent increase in the development of military drones, they are adopted and used as the combat system of battalion level or higher. However, it is difficult to use drones that can be used in battles below the platoon level due to the current conditions for the formation of units in the Korean military. In this paper, therefore, we developed a program drones equipped with a thermal imaging camera and LiDAR sensor for reconnaissance and exploration that can be applied in battles below the platoon level. Using these drones, we studied the possibility and feasibility of drones for small-scale combats that can find hidden enemies, search for an appropriate detour through image processing and conduct reconnaissance and search for battlefields, hiding and cover-up through image processing. In addition to the purpose of using the proposed drone to search for an enemies lying in ambush in the battlefield, it can be used as a function to check the optimal movement path when a combat unit is moving, or as a function to check the optimal place for cover-up or hiding. In particular, it is possible to check another route other than the route recommended by the program because the features of the terrain can be checked from various viewpoints through 3D modeling. We verified the possiblity of flying by designing and assembling in a form of adding LiDAR and thermal imaging camera module to a drone assembled based on racing drone parts, which are open source hardware, and developed autonomous flight and search functions which can be used even by non-professional drone operators based on open source software, and then installed them to verify their feasibility.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.91-98
• /
• 2010

Conventional path-finding has focused on finding short collision-free paths. However, as computer games become more sophisticated, it is required to take tactical information like ambush points or lines of enemy sight into account. One way to make this information have an effect on path-finding is to represent a heuristic function of a search algorithm as a weighted sum of tactics. In this paper we consider the problem of learning heuristic to optimize path-finding based on given tactical information. What is meant by learning is to produce a good weight vector for a heuristic function. Training examples for learning are given by a game level-designer and will be compared with search results in every search level to update weights. This paper proposes a learning algorithm integrated with search for tactical path-finding. The perceptron-like method for updating weights is described and a simulation tool for implementing these is presented. A level-designer can mark desired paths according to characters' properties in the heuristic learning tool and then it uses them as training examples to learn weights and shows traces of paths changing along with weight learning.

• Journal of the Korean Geotechnical Society
• /
• v.25 no.9
• /
• pp.93-100
• /
• 2009

A core procedure of the direct search method used in this study is optimizing a difference between objective function and real displacement and correcting unknown variables. Because the research procedure comes from back-analyzing of the unknown variable of each layer, back-analyzing results need an additional optimization to minimize interferential effects of unknown variables. Therefore, the direct search method Is used to obtain optimized solutions without a partial differentiation of an objective function. The object of this research is developing the back analysis technique for multi-unknown variables by modeling the soil including underground structure Into upper and lower layer. In order to minimize interferent errors, repeated back analysis is performed and applicability on the real tunnel is examined. Consequently, the multi-layer analysis model is more precise in describing the real behavior of underground structure. It shows the validity of back analysis far multi-layer model which is the understructure placed on multi-layer boundaries.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.1
• /
• pp.57-63
• /
• 1994

The logic function synthesis using ULM U$_h$ is constructed based on canonic Reed-Muller expansion coefficient for a given function. This paper proposes the fast synthesis algorithm using ULM U$_h$ for ternary function. By using circuit cost and synthesis method of proposed in this paper, order of control input variable minimum number of ULM U$_h$ can be decided in the synthesis of n-variable ternary function. Accordingly, this method enables to optimum circuit realization for ternary function synthesis using ULM ULM U$_h$ and can be applied to ternary function synthesis using ULM U$_h$. The complexity of search for select the order of all control input variables is (n+2)(n-1)/2.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Structural Engineering and Mechanics
• /
• v.50 no.3
• /
• pp.365-382
• /
• 2014

In this article, the force method and Charged System Search (CSS) algorithm are used for the analysis and optimal design of truss structures. The CSS algorithm is employed as the optimization tool and the force method is utilized for analysis. In this paper in addition to member's cross sections, redundant forces, geometry and topology variables are considered as the optimization variables. Minimum complementary energy principle is used directly to analyze the structure. In the presented method, redundant forces are calculated by the CSS in order to minimize the energy function. Combination of the CSS and force method leads to an efficient algorithm in comparison to some of the optimization algorithms.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.205-214
• /
• 2001

As the real time multimedia data service has become available due to the rapid progress of computer and Internet technology, the users can enjoy the newly developed service, which is called Video On-Dem-and(VOD). However, most of service providers have not paid their attention much on the software for various service modes on VOD, but they are only concentrating un the hardware to provide with the high resolution video display. Therefore, the service providers are recently to pay more attention on the software to cope with the various demands of users than hardware. So this paper has designed and implemented the VOD service system for those demands. Since the VOD service system suggested by this paper enable off-line search functions through E-mail, the users can possibly get the necessary information from off-line Search without connecting to the server while the current VOD service can prominently help users to save the time and effort to sea고 and select the Video contents by using periodical current awareness service supported by PUSH technology and user oriented information booking and feedback service supported by SDI service.

• Journal of Ocean Engineering and Technology
• /
• v.26 no.4
• /
• pp.8-14
• /
• 2012

Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.