• Journal of Mechanical Science and Technology
• /
• v.16 no.4
• /
• pp.454-467
• /
• 2002

It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. Toidentifythelocation and depth of a crack in a structure, a method is presented in this paper which uses neuro-fuzzy-evolutionary technique, that is, Adaptive-Network-based Fuzzy Inference System (ANFIS) solved via hybrid learning algorithm (the back-propagation gradient descent and the least-squares method) and Continuous Evolutionary Algorithms (CEAs) solving sir ale objective optimization problems with a continuous function and continuous search space efficiently are unified. With this ANFIS and CEAs, it is possible to formulate the inverse problem. ANFIS is used to obtain the input(the location and depth of a crack) - output(the structural Eigenfrequencies) relation of the structural system. CEAs are used to identify the crack location and depth by minimizing the difference from the measured frequencies. We have tried this new idea on beam structures and the results are promising.

• Journal of Wellbeing Management and Applied Psychology
• /
• v.6 no.1
• /
• pp.23-31
• /
• 2023

Purpose: The purpose of this study is a preliminary study to develop a comprehensive information avoidance scale that includes various search contexts. Research design, data and methodology: This study is a part of exploratory sequential design of mixed method for the development of information avoidance scale. Based on the themes derived from the analysis of the in-depth interview data collected in the qualitative research of the first stage of the study, 45 preliminary items on information search and avoidance were constructed. The factors related to information searching included information recognition, information seeking purpose, and information search expectations. Individual, information, time, and system factors were related to information avoidance. Pearson's correlation analysis was performed for the correlation between factor items, and Cronbach's alpha analysis was performed for the reliability analysis of the items. Exploratory factor analysis was applied to examine the construct validity of 35 items of information avoidance. Results: Among the information avoidance items, one of the less relevant among information purpose items, two information factor items, and one time factor item were excluded. Conclusions: A secondary survey should be conducted to confirm the validity and reliability of the scale composed of adjusted items (35) based on the results of exploratory factor analysis. The strength of this preliminary scale is that it was developed based on vivid qualitative data of ordinary people who had experiences of search and avoidance in various search contexts.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.4
• /
• pp.437-444
• /
• 2024

Bistatic sonar performance varies significantly depending on the ocean environment, the location (latitude, longitude) and water depth of the source and receiver. Therefore, research on optimal deployment of bistatic sonar considering ocean environment is necessary. In this study, we suggest an algorithm to optimize the location and water depth of source and receiver when operating monostatic and bistatic sonar on two spatially separated surface ships in the Ulleung Basin in the East Sea. A particle swarm optimization algorithm was used to search the location and water depth of the source and receiver to maximize the detectable area within the search area. As a result of performing bistatic sonar deployment using the algorithm proposed in this study, the detectable area increased as the number of model iterations increased. Additionally, it was confirmed that the source and receiver on the two surface ships converged to the optimal location and water depth.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• Journal of Microbiology and Biotechnology
• /
• v.25 no.5
• /
• pp.732-737
• /
• 2015

We present here an in silico search of fungal sterol-esterase/lipase and bacterial depolymerase sequences from environmental metagenomes. Both enzyme types contain the α/β-hydrolase protein fold. Analysis of DNA conserved motifs, protein homology search, phylogenetic analysis, and protein 3D modeling have been used, and the efficiency of these screening strategies is discussed. The presence of bacterial genes in the metagenomes was higher than those from fungi, and the sequencing depth of the metagenomes seemed to be crucial to allow finding enough diversity of enzyme sequences. As a result, a novel putative PHA-depolymerase is described.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.2
• /
• pp.19-29
• /
• 2015

The purpose of this study is to suggest the grid search method for selecting an optimal decision tree model. It chooses optimal values for the maximum depth of tree and the minimum number of observations that must exist in a node in order for a split to be attempted. Therefore, the grid search method guarantees building a decision tree model that shows more precise and stable classifying performance. Through empirical analysis using data of job satisfaction of workplace reserve force commanders, we show that the grid search method helps us generate an optimal decision tree model that gives us hints for the improvement direction of labor conditions of Korean workplace reserve force commanders.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.676-683
• /
• 2012

Motion estimation in video coding greatly affects implementation complexity. In this paper, a reducing method of the complexity in motion estimation is proposed by using both the depth and color cameras. We obtain object information with video sequence from distance information calculated by depth camera, then perform labeling for grouping pixels within similar distances as the same object. Three search regions (background, inside-object, boundary) are determined adaptively for each of motion estimation blocks within current and reference pictures. If a current block is the inside-object region, then motion is searched within the inside-object region of reference picture. Also if a current block is the background region, then motion is searched within the background region of reference picture. From simulation results, we can see that the proposed method compared to the full search method remains the almost same as the motion estimated difference signal and significantly reduces the searching complexity.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.9
• /
• pp.639-646
• /
• 2022

Landing site searching algorithms are developed for a quadrotor using a depth map in unknown environment. Guidance and control system of Unmanned Aerial Vehicle (UAV) consists of a trajectory planner, a position and an attitude controller. Landing site is selected based on the information of the depth map which is acquired by a stereo vision sensor attached on the gimbal system pointing downwards. Flatness information is obtained by the maximum depth difference of a predefined depth map region, and the distance from the UAV is also considered. This study proposes three landing methods and compares their performance using various indices such as UAV travel distance, map accuracy, obstacle response time etc.

• Journal of Korean Library and Information Science Society
• /
• v.42 no.2
• /
• pp.257-276
• /
• 2011

The purpose of this study is to compare and analyze the functions and characteristics of search interfaces of Korean Old and Rare Collection Information System(KORCIS) and Korean History Online. The checklist of OPAC functionalities proposed by Breeding was used to examine eleven functions of these systems. Both system provide the following functions: Search by keywords; Boolean operators in queries; Order results chronologically; Modify search without re-keying the initial terms ; Search within result sets ; and Ability to limit results to an individual library or education. They do not provide such functions as Browse by author, title, subject and View and recall the search history for the current session. Adoption of standard OPAC and next-generation catalog functionalities, in-depth understanding of user needs and information seeking behaviors, and the improvement of subject access to these systems are suggested in this study.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.321-338
• /
• 2008

This paper presents a Modified Multiple Depth First Search algorithm for the exploration of the indoor environments occupied with obstacles in random distribution. The proposed algorithm was designed and implemented to employ one or a team of Khepera II mini robots for the exploration process. In case of multi-robots, the BlueCore2 External Bluetooth module was used to establish wireless networks with one master robot and one up to three slaves. Messages are sent and received via the module's Universal Asynchronous Receiver/Transmitter (UART) interface. Real exploration experiments were performed using locally developed teleworkbench with various autonomy features. In addition, computer simulation tool was also developed to simulate the exploration experiments with one master robot and one up to ten slaves. Computer simulations were in good agreement with the real experiments for the considered cases of one to one up to three networks. Results of the MMDFS for single robot exhibited 46% reduction in the needed number of steps for exploring environments with obstacles in comparison with other algorithms, namely the Ants algorithm and the original MDFS algorithm. This reduction reaches 71% whenever exploring open areas. Finally, results performed using multi-robots exhibited more reduction in the needed number of exploration steps.