• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.2
• /
• pp.267-275
• /
• 2023

As aged infrastructures have been increased, the importance of accurate maintenance costs and proper budget allocation for infrastructure become prominent under limited resources. This study proposed a mapping algorithm between representative defects, repair methods, and the estimated maintenance costs for concrete bridges. In this regard, using BMS (Bridge Management System) data analysis, bridge repair methods were classified and matched with defects according to their locations, types, and sizes. In addition, the maintenance costs were estimated based on the amount of work-load and quantity per unit using CSPR (Cost Standard Production Rate). As a result, the level of accuracy was an average of 85.1 % compared with the actual bill of quantity for Seoul bridge maintenance. The accuracy of maintenance costs is expected to be enhanced by considering the various site conditions such as pier height, extra charge conditions, additional equipment, etc.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.400-402
• /
• 2003

Ad­hoc Network는 Mobile Node들 간에 Multi­hop 무선 링크로 구성되는 Network을 일컫는 말이며, 동시에 Network를 통제하는 Infrastructure없이 Node들 간의 상호 통신에 의해서 Network이 구성되기도 하고, Node들이 이동하거나 환경적인 장애에 의해서 일시적으로 Network이 구성되지 않기도 한다. 이 논문에서는 대표적인 On­demand Routing Algorithm인 DSR를 이용하여, 두 개의 경로를 유지하여 Primary Path에 문제가 발생하는 경우, Secondary Path가 Primary Path로 전환되어 Data를 전송하고, 이 전 Primary Path에 대하여 지역적으로 복구(Repair)를 수행하고, 설정된 Secondary Path에 대해서도 특정한 조건에서 복구작업을 수행함으로써 Ad­hoc Network에서 경로를 찾고 설정하는데 필요한 Routing Overhead를 줄이고 Ad­hoc Network의 특성상 반드시 보완하여야 하는 전송 Route에 대한 Robustness를 강화하는 방법이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.328-335
• /
• 2005

bIn this paper, built-in self-repair(BISR) is proposed for semiconductor memories. BISR is consisted of BIST(Buit-in self-test) and BIRU(Built-In Remapping Uint). BIST circuits are required not oがy to detect the presence of faults but also to specify their locations for repair. The memory rows are virtually divided into row blocks and reconfiguration is performed at the row block level instead of the traditional row level. According to the experimental result, we can verify algorithm for replacement of faulty cell.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2745-2750
• /
• 2015

Abstract should be placed here In this study, we propose an algorithm of the method of recovering quickly find the location of the error encountered during separate operations in the functional structure of complex digital circuits by mimicking the self-healing function of the cell. By the digital circuit was divided by 9 function block unit of function, proposes a method that It can quickly detect and recover the error position. It was the detection and recovery algorithms for the error location in the digital circuit of a complicated structure and could extended the number of function block for the $3{\times}3$ matrix structure on the dital circuit.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.17-24
• /
• 2013

Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical precedence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.144-148
• /
• 2005

The sensor network consists of sensor nodes which communicate wirelessly. It requires energy-efficient routing protocols. We measure requirements in routing protocols by using simulation techniques. In this paper, we propose a random routing algorithm and evaluate it by simulation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.2
• /
• pp.104-113
• /
• 2019

The road management institute needs lots of cost to repair road surface damage. These damages are inevitable due to natural factors and aging, but maintenance technologies for efficient repair of the broken road are needed. Various technologies have been developed and applied to cope with such a demand. Recently, maintenance technology for road surface damage repair is being developed using image information collected in the form of a black box installed in a vehicle. There are various methods to extract the damaged region, however, we will discuss the image recognition technology of the deep neural network structure that is actively studied recently. In this paper, we introduce a new neural network which can estimate the road damage and its location in the image by region-based convolution neural network algorithm. In order to develop the algorithm, about 600 images were collected through actual driving. Then, learning was carried out and compared with the existing model, we developed a neural network with 10.67% accuracy.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.178-186
• /
• 2007

Recently, The importance of Ubiquitous network that can be supported useful information to MANET mobile device user through wired internet network in anywhere, anytime is growing rapidly. This proposed algorithm is the research on the algorithm, minimizing network overhead by preventing unnecessary network overhead previously and adapting Local repair mechanism to efficient data transmission when route error happens in network, in GMAHN environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.842-846
• /
• 2015

In this study, we propose an algorithm of the method of recovering quickly find the location of the error encountered during separate operations in the functional structure of complex digital circuits by mimicking the self-healing function of the cell. By the digital circuit was divided by 9 function block unit of function, proposes a method that It can quickly detect and recover the error position. It was the detection and recovery algorithms for the error location in the digital circuit of a complicated structure and could extended the number of function block for the $3{\times}3$ matrix structure on the digital circuit.