• Korean Journal of Computational Design and Engineering
• /
• v.11 no.4
• /
• pp.315-325
• /
• 2006

It is very often necessary to search for similar parts during designing a new product because its parts are often easily designed by modifying existing similar parts. In this way, the design time and cost can be reduced. Thus it would be nice to have an efficient similarity comparison algorithm that can be used anytime in the design process. There have been many approaches to compare shape similarity between two solids. In this paper, two parts represented in B-Rep is compared in two steps: one for overall appearances and the other for detail features. In the first step, geometric information is used in low level of detail for easy and fast pre-classification by the overall appearance. In the second step, feature information is used to compare the detail shape in high level of detail to find more similar design. To realize the idea above, a multi resolution algorithm is proposed so that a given solid is described by an overall appearance in a low resolution and by detail features in high resolution. Using this multi-resolution representation, parts can be compared based on the overall appearance first so that the number of parts to be compared in high resolution is reduced, and then detail features are investigated to retrieve the most similar part. In this way, computational time can be reduced by the fast classification in the first step while reliability can be preserved by detail comparison in the second step.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.469-476
• /
• 2018

In order to jointly utilize research infrastructure and to build efficient construction, which are essential in science and technology research and development process. Although various classification methods have been introduced for efficient utilization of registered information, functions that can be directly utilized such as similar research infrastructure search is not yet been implemented due to limitations of collection information. In this study, we analyzed the similar search technique so far, presented the methodology for the calculation of similarity of research infrastructure, and analyzed the learning result. Study suggested that a technique can be use to extract meaningful keywords from information and analyze the similarity between the research infrastructure.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.171-176
• /
• 2022

With the recent development of deep learning technology, the areas of recommendation systems have also diversified. This paper studied algorithms to improve the learning rate and studied the significance results according to words through comparison with the performance characteristics of the Word2Vec model. The problem recommendation algorithm was implemented with the values expressed through the reflection of meaning and similarity test between texts, which are characteristics of the Word2Vec model. Through Word2Vec's learning results, problem recommendations were conducted using text similarity values, and problems with high similarity can be recommended. In the experimental process, it was seen that the accuracy decreased with the quantitative amount of data, and it was confirmed that the larger the amount of data in the data set, the higher the accuracy.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.284-291
• /
• 2022

Historical data from comparable projects can serve as benchmarking data for an ongoing project's planning during the project scoping phase. As project owners typically store substantial amounts of data generated throughout project life cycles in digitized databases, they can capture appropriate data to support various project planning activities by accessing digital databases. One of the most important work tasks in this process is identifying one or more past projects comparable to a new project. The uniqueness and complexity of construction projects along with unorganized data, impede the reliable identification of comparable past projects. A project scope document provides the preliminary overview of a project in terms of the extent of the project and project requirements. However, narratives and free-formatted descriptions of project scopes are a significant and time-consuming barrier if a human needs to review them and determine similar projects. This study proposes an Artificial Intelligence-driven model for analyzing project scope descriptions and evaluating project similarity using natural language processing (NLP) techniques. The proposed algorithm can intelligently a) extract major work activities from unstructured descriptions held in a database and b) quantify similarities by considering the semantic features of texts representing work activities. The proposed model enhances historical comparable project identification by systematically analyzing project scopes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.3
• /
• pp.603-608
• /
• 2024

Recently, the frequency of computer engineering and technology interviews has increased in the process of hiring developers, and accordingly, the burden of technical interviews among interviewees has also increased. However, during computer engineering technical interview practice, it is difficult to judge whether one's answers are correct, and to measure the appropriate vocalization speed by oneself. In this paper, we propose a computer engineering technical interview support system using similarity measurement technology. The proposed system measures the technical accuracy of the interviewee's answers through a sentence similarity evaluation procedure using cosine similarity to measure the technical accuracy of the interviewee's answers. It also measures the speech rate and provides it to the interviewee.

• Journal of the Korea Convergence Society
• /
• v.8 no.3
• /
• pp.49-61
• /
• 2017

Recently, convenience and usability are increasing with the development and deployment of various mobile applications on the Android platform. However, important information stored in the smartphone is leaked to the outside without knowing the user since the malicious mobile application is continuously increasing. A variety of mobile vaccines have been developed for the Android platform to detect malicious apps. Recently discovered server-based polymorphic(SSP) malicious mobile apps include obfuscation techniques. Therefore, it is not easy to detect existing mobile vaccines because some other form of malicious app is newly created by using SSP mechanism. In this paper, we analyze the correlation between the similarity of the method in the DEX file constituting the core malicious code and the permission similarity measure through APK de-compiling process for the SSP malicious app. According to the analysis results of DEX method similarity and permission similarity, we could extract the characteristics of SSP malicious apps and found the difference that can be distinguished from the normal app.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.875-885
• /
• 2010

CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.10a
• /
• pp.221-221
• /
• 1994

• School Mathematics
• /
• v.9 no.1
• /
• pp.141-160
• /
• 2007

The purpose of this paper was to evaluate how students apply prior knowledge or experience in solving algebra word problems from the chain of signification-based perspective. Three middle school students were evaluated in this case study. The results showed that the subjects formed similarities in the process of applying knowledge needed for solving a problem. The student A and C used semi-open-end formulas and closed formulas as solutions. They then formed concrete shape for each solution using the chain of signification that was applied for solution by forming procedural similarity. At this time, the chain of signification could be the combination of numbers, words, and pictures (such as diagrams or graphs) or just numbers or words. On the other hand, the student C who recognized closed formulas and her own rule as a solution method could not formulate completely procedural similarity due to many errors arising from number information. Nonetheless, all of the subjects showed something in common in the process of coming up with a algorithm that was semi-open-end formula or closed formula.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.203-210
• /
• 2015

We consider fractional Brownian motion and FARIMA process with Gaussian innovations and show that the suitably scaled distributions of the FARIMA processes converge to fractional Brownian motion in the sense of finite dimensional distributions. We figure out ACF function and estimate the self-similarity parameter H of FARIMA(0, d, 0) by using R/S method. Finally, we display power spectrum density of FARIMA process.