• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.1
• /
• pp.1-12
• /
• 2021

In this paper, a new algorithm is proposed to estimate the damage location in the composite panel by extracting the elastic wave signal reflected from the damaged area. The guided elastic wave is generated by a piezoelectric actuator and sensed by a piezoelectric sensor. The proposed algorithm adopts a diagnostic approach. It compares the non-damaged signal with the damaged signal, and extract damage information along with sensor network and lamb wave group velocity estimated by signal correlation. However, it is difficult to clearly distinguish the damage location due to the nonlinear properties of lamb wave and complex information composed of various signals. To overcome this difficulty, the cumulative summation feature vector algorithm(CSFV) and a visualization technique are newly proposed in this paper. CSFV algorithm finds the center position of the damage by converting the signals reflected from the damage to the area of distance at which signals reach, and visualization technique is applied that expresses feature vectors by multiplying damage indexes. Experiments are performed for a composite panel and comparative study with the existing algorithms is carried out. From the results, it is confirmed that the damage location can be detected by the proposed algorithm with more reliable accuracy.

• Journal of Digital Convergence
• /
• v.15 no.6
• /
• pp.229-236
• /
• 2017

An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called "CAWFP-Growth" that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.643-652
• /
• 2002

This paper proposes an efficient hybrid fixed-point (FP) algorithm for improving performances of the independent component analysis (ICA) based on neural networks. The proposed algorithm is the FP algorithm based on secant method and momentum for ICA. Secant method is applied to improve the separation performance by simplifying the computation process for estimating the root of objective function, which is to minimize the mutual informations of the independent components. The momentum is applied for high-speed convergence by restraining the oscillation if the process of converging to the optimal solution. It can simultaneously achieve a superior properties of the secant method and the momentum. The proposed algorithm has been applied to the composite fingerprints and the images generated by random mixing matrix in the 8 fingerprints of $256\times{256}$-pixel and the 10 images of $512\times{512}$-pixel, respectively. The simulation results show that the proposed algorithm has better performances of the separation speed and rate than those using the FP algorithm based on Newton and secant method. Especially, the secant FP algorithm can be solved the separating performances depending on initial points settings and the nonrealistic learning time for separating the large size images by using the Newton FP algorithm.

• Composites Research
• /
• v.16 no.4
• /
• pp.36-43
• /
• 2003

In this research, the optimization of composite structures was performed using metamodels. The optimization of composite structures requires a lot of time when optimizing the result of the time-consuming analysis. Thus, metamodels are used to replace the time-consuming analysis with simple models. RSM, kriging and neural networks are widely used metamodels. RSM and kriging were used in this study. The ultimate failure load analysis of the composite structure was approximated by metamodels. The optimizations of the composite plate were performed to maximize ultimate failure load using genetic algorithm and metamodels.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.13-21
• /
• 2013

Super high-rise buildings of combined use such as large shopping malls and multiplex etc. have larger parking facilities than general buildings and are characteristic of an increase in the number of the entrance and the exit connecting internal external space of the parking lot. These features cause a congestion of internal traffic by increasing car driving distance in the parking lot, and vehicle idling increases by drivers wander the parking lot in order to find parking space. In addition, they make drivers suffer from lots of difficulties due to parking including increasing their walking line after parking. Therefore, in this study, we developed individual parking information provision algorithm to specify the optimal parking place for drivers according to the purpose of visiting a building and the drivers' moving path, and selected new construction site for the second lotte world in order to evaluate the algorithm developed and performed evaluation. As a result of the evaluation, it was analyzed that in the case of applying the individual parking information provision algorithm compared to the existing parking information provision algorithm, moving distance in the parking lot decreases around 7.43~83.4%, and that in the case of $CO_2$ emission, it decreased about 47.7% on average, which indicates that the efficiency resulted from application of the individual parking information provision algorithm is very high as the application effects are tested.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.74-79
• /
• 2019

Traditional compound noun decomposition algorithms often face challenges of decomposing compound nouns into separated nouns when unregistered unit noun is included. It is very difficult for those traditional approach to handle such issues because it is impossible to register all existing unit nouns into the dictionary such as proper nouns, coined words, and foreign words in advance. In this paper, in order to solve this problem, compound noun decomposition problem is defined as tag sequence labeling problem and compound noun decomposition method to use syllable unit embedding and deep learning technique is proposed. To recognize unregistered unit nouns without constructing unit noun dictionary, compound nouns are decomposed into unit nouns by using LSTM and linear-chain CRF expressing each syllable that constitutes a compound noun in the continuous vector space.

• Journal of Korean Society of Transportation
• /
• v.19 no.2
• /
• pp.53-60
• /
• 2001

본 논문의 목적은 대중교통 노선배정 시에 여러 수단간의 환승을 고려함으로써 다수단 대중교통망 내에서 수단선택과 노선선택을 동시에 수행할 수 있도록 확률적인 통행배분(traffic assignment) 모형의 하나인 다이알 알고리즘을 응용할 것을 제시하고 그 알고리즘의 속성을 정확하게 규명하는데 있다 승용차의 확률적 통행배분모형으로 잘 알려져 있는 Dial 알고리즘은 로짓모형에 기초한 것이므로 다수단간의 대중교통 수단선택과 노선선택과 같은 선택 행태를 동시에 설명할 수 있는 모형적 특성을 기본적으로 내재하고 있다. 본 연구에서 제시한 대중교통 노선선택에 적용될 수 있도록 수정된 다이알 알고리즘은 기존의 결정적 대중교 통 노선배정 모형들의 단점을 극복할 수 있는 특성을 갖고 있다. 즉 결정적 대중교통 노선배정모형은 기종점간 최단경로에 교통량을 전랑배분(All-or-Nothing)하여 통행자들의 행태적 속성을 제대로 반영하지 못하고 있으며, 다수단 대중교통망 내에서 환승을 포함한 복합 대중교통수단의 선택을 효용극대화 이론에 기초하지 않고 최소비용노선에 전량배분하는 모형의 한계점을 갖고 있다. 이러한 결정적 대중교통 노선배정모형의 단점을 수정된 다이알 알고리즘은 개선할 수가 있다. 본 연구에서는 알고리즘의 특성을 파악하기 위한 모의실험으로 Sioux Falls 형태의 대중교통 네트워크를 이용하여 기존의 알고리즘과 비교 분석하였다. 분석의 탄력성을 갖고 있는 수정된 대중교통 다이알 알고리즘이 현실적 대중교통 통행패턴을 기존 모형보다 합리적으로 설명할 수 있을 것으로 보이며, 특히 다수단 대중교통망이 형성된 대도시의 대중교통 정책분석에 적합한 기법이 될 수 있을 것으로 고려된다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.1-7
• /
• 2006

This paper consider a code-division multiple-access(CDMA) wireless ad-hoc network in low-SINR regime. In previous research [6], there has been proposed a algorithm for achieving global optimum at high SINR regime, but has not been fully investigated at low-SINR regime. In this paper, we focus on a case where SINR is much smaller than 1, and propose a algorithm that is suitable for low-SINR regime.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.2
• /
• pp.94-103
• /
• 1998

Recently, many researches are carried for high-speed and light craft. In this study, the optimum structural design procedure and the computer program are developed to minimize the hull weight of SES(Surface Effect Ship) built of composite materials. Three types of composite materials-Sandwich, Single Skin and Hybrid type- are considered and the efficiency of each type is investigated. In design process, the optimum design of main members is performed at first considering longitudinal strength. And then, the transverse member design is performed considering torsional strength SSDP(Structural Synthesis Design program) of U.S. Navy is adopted for design algorithm and DnV classification nile for design loads and strength criteria. For optimum structural design, ES 1+1 optimization technique is used.