• Korean Journal of Construction Engineering and Management
• /
• v.21 no.6
• /
• pp.125-134
• /
• 2020

Natural language encountered in construction documents largely deviates from those that are recommended by the authorities. Such practice that is lacking in coherence will discourage integrated research with automation, and it will hurt the productivity in the industry for the long run. This research aims to compare multiple string similarity (string matching) algorithms to compare each algorithm's performance in recognizing the same task name written in multiple different ways. We also aim to start a debate on how prevalent the aforementioned deviation is. Finally, we composed a small dataset that associates construction task names found in practice with the corresponding task names that are less cluttered w.r.t their formatting. We expect that this dataset can be used to validate future natural language processing approaches.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.11-16
• /
• 2020

As a plan for oil spill accidents, research to collect and analyze optimal equipment assignments is essential. However, studies that have diversified and analyzed the optimal equipment assignments for responding to oil spill accidents have not been preceded. In response to the need for analyzing optimal equipment assignments study, we devised a genetic algorithm for optimal equipment assignments. The designed genetic algorithm yielded 10,000 optimal equipment assignments. We clustered using the k-means algorithm. As a result, the two clusters of Yeosu, Daesan, and Ulsan, which are expected to be the largest spills, were clearly identified. We also projected 16-dimensional data in two dimensions via Sammon's mapping. The projected data were analyzed for distribution. We confirmed that results of the simulation were better than those of optimal equipment assignments included in the cluster.In the future, it will be possible to implement an approximate model with excellent performance based on this study.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.4 s.37
• /
• pp.657-666
• /
• 1998

This study presents an effective dual algorithm for the optimal design of steel structures with displacement constraints. The dual method can replace a primary optimization problem with a sequence of approximate explicit subproblems with a simple algebraic structure. Since being convex and separable, each subproblem can be solved efficiently by the dual method. Specifically, this study uses the principle of virtual work to obtain the displacement constraint equations with an explicit form and adds the linear regression equation expressing the relationships between the cross-section properties to the dual algorithm to reduce the number of design variables. Furthermore, this study deals with the discrete optimization problem to select members with the standard steel sections. Through numerical analyses, the proposed method will be compared with the conventional optimality criteria method.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.1-8
• /
• 2008

In this paper, an algorithm to compensate the inter-view mismatch in the multi-view video according to the different characteristics of cameras is presented. Interview mismatches make it difficult to merge the multi-view images and decrease the coding performance. So, a preprocessing operation to compensate the mismatches is requisite in the multi-view video coding. It is shown that the mismatch in the outputs of multi-view cameras with different electro-optical transfer functions can be approximated with a linear model of a gain and an offset. In addition, a new algorithm for estimating and compensating the inter-view mismatch based on the detection of the overlapped region is presented. Experimental results using various rectified stereo images show that the proposed method compensates inter-view mismatches more accurately compared to the conventional approach.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.785-794
• /
• 2002

Automatic stock trading systems should be able to solve various kinds of optimization problems such as market trend prediction, stock selection, and trading strategies, in a unified framework. But most of the previous trading systems based on supervised learning have a limit in the ultimate performance, because they are not mainly concerned in the integration of those subproblems. This paper proposes a stock trading system, called R-Trader, based on reinforcement teaming, regarding the process of stock price changes as Markov decision process (MDP). Reinforcement learning is suitable for Joint optimization of predictions and trading strategies. R-Trader adopts two popular reinforcement learning algorithms, temporal-difference (TD) and Q, for selecting stocks and optimizing other trading parameters respectively. Technical analysis is also adopted to devise the input features of the system and value functions are approximated by feedforward neural networks. Experimental results on the Korea stock market show that the proposed system outperforms the market average and also a simple trading system trained by supervised learning both in profit and risk management.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.654-662
• /
• 2016

As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.77-85
• /
• 1997

Researches in the field of Computer Graphics and Geographical Information Systems(GIS) have extensively studied the method of photo-realistic landscape modelling, because it have become a commom requirement in applications such as flight simulators, mission rehearsal, and construction planning. A common approach to the display of terrain uses a Digital Elevation Model(DEM). DEM is an evenly spaced array of the terrain elevation data and can be obtained from stereo satellite data. With the DEM data, the process of 3D terrain modelling consists of three steps. The first step is to extract the meaningful data (such as peak, pit, passes...) from DEM data based on LOD(Level Of Detail) criteria. The second is to construct the 3D surface by TIN, which represents a surface as a set of non-overlapping continuous triangular facets of irregular size and shape. The third is a rendering of 3D terrain model. The goal of this research is a construction of 3D terrain with TIN. To do this, we are going to app]y Radial Sweep Algorithm. Radial Sweep Algorithm for generating TIN works quickly and efficiently. However, it does not solve the problem caused by the approximated nature of triangulated surface. To solve this problem, this research derive improved radial sweep algorithms with the optimal triangle definition.