• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.283-289
• /
• 2003

This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.8 no.2
• /
• pp.138-150
• /
• 2000

This study is concerned with computerized multi-level substructuring methods and stress analysis of coil springs. The purpose of substructuring methods is to reduce computing time and capacity of computer memory by multiple level reduction of the degrees of freedom in large size problems which are modeled by three dimensional continuum finite elements. In this paper, a super element has been developed for stress analysis of coil springs. The spring super element developed has been examined with tension and torsion simulation of cylindrical bars for demonstrating its validity. The result shows that the super element enhances the computing efficiency while it does not affect the accuracy of the results and it is ready for application to the coil spring analysis.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.141-147
• /
• 1992

This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6 ${\leq}$ n ${\leq}$ 4). Medium sized random problems (10 ${\leq}$ n ${\leq}$ 30) are also generated and examined. The computational results are compared and discussed for the three heuristics.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.7 no.2
• /
• pp.21-26
• /
• 1989

This module to input Korean Level Data has 4 capacities of inputing, deleting, referencing and saving. Data file of level line consists of sorted list of node on the basis of “ABSTRACT”. For easy work, interactive method was employed. As the result of removing the boring routine by applying the characteristics of level data, working efficiency was increased. This program was written in C-language and runs on a minimum hardware configuration of IBM PC/XT with 640KB memory, In the future, these unit modules combine to form Generalized Level Information System.

• Structural Engineering and Mechanics
• /
• v.22 no.1
• /
• pp.33-52
• /
• 2006

Three-dimensional description of building structure taking into consideration soil-structure interaction is a very complex problem and solution of this problem is often obtained by using finite element method. However, this method takes a significant amount of computational time and memory. Therefore, an efficient computational model based on subdivision of the structure into building elements such as wall and floor slab elements, plane and three-dimensional joints and lintels, that could provide accurate results with significantly reduced computational time, is proposed in this study for the analysis three-dimensional structures subjected to dynamic load. The examples prove the efficiency and the computing possibilities of the model.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.88-92
• /
• 2021

A method and a mathematical algorithm for finding a quasi-optimal assignment plan with rectangular efficiency matrices are proposed. The developed algorithm can significantly reduce the time and computer memory consumption for its implementation in comparison with optimal methods.

• Journal of Sensor Science and Technology
• /
• v.30 no.4
• /
• pp.223-228
• /
• 2021

This work presents a low-power CMOS image sensor (CIS) with a multi-column-parallel (MCP) readout structure while focusing on improving its performance compared to previous works. A delta readout scheme that utilizes the image characteristics is optimized for the MCP readout structure. By simply alternating the MCP readout direction for each row selection, additional memory for the row-to-row delta readout is not required, resulting in a reduced area of occupation compared to the previous work. In addition, the bias current of a pre-amplifier in a successive approximate register (SAR) analog-to-digital converter (ADC) changes according to the operating period to improve the power efficiency. The prototype CIS chip was fabricated using a 0.18-㎛ CMOS process. A 160 × 120 pixel array with 4.4 ㎛ pitch was implemented with a 10-bit SAR ADC. The prototype CIS demonstrated a frame rate of 120 fps with a total power consumption of 1.92 mW.

• Smart Structures and Systems
• /
• v.30 no.2
• /
• pp.209-219
• /
• 2022

The determination for bearing capacity of precast nodular piles is conventionally time-consuming and high-cost by using numerous experiments and empirical methods. This study proposes an intelligent method to evaluate the bearing capacity and shaft resistance of the nodular piles with high efficiency based on long short-term memory (LSTM) approach. A series of field tests are first designed to measure the axial force, shaft resistance and displacement of the combined nodular piles under different loadings, in comparison with the single pre-stressed high-strength concrete piles. The test results confirm that the combined nodular piles could provide larger ultimate bearing capacity (more than 100%) than the single pre-stressed high-strength concrete piles. Both the LSTM-based method and empirical methods are used to calculate the shift resistance of the combined nodular piles. The results show that the LSTM-based method has a high-precision estimation on shaft resistance, not only for the ultimate load but also for the working load.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.64-71
• /
• 1995

The objective of this paper is to realize an analysis system that is capable of controlling the quality of an entire cutting process by including a 3 coordinate measuring machine in the process line. Fuzzy reasoning networks based on fuzzy associative memories has been intro- duced in the measuring process, the control limits for the control process have been obtained, and the efficiency and reliability of the system have been determined by examining the simu- lated reasoning control values.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.189-202
• /
• 2023

In the era marked by information inundation, social network analysis is the most important part of big data analysis, with clique detection being a key technology in social network mining. Also, detecting maximal balance clique in signed networks with positive and negative relationships is essential. In this paper, we present two algorithms. The first one is an algorithm, MCDA1, that detects the maximal balance clique using the improved three-way concept lattice algorithm and object-induced three-way concept lattice (OE-concept). The second one is an improved formal concept analysis algorithm, MCDA2, that improves the efficiency of memory. Additionally, we tested the execution time of our proposed method with four real-world datasets.