• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.7
• /
• pp.779-784
• /
• 2005

This paper presents the theory of similarity transformations applied to the momentum and energy equations for laminar, forced, external boundary layer flow over a horizontal flat plate which leads to a set of non-linear, ordinary differential equations of phase change material slurry(PCM Slurry). The momentum and energy equation set numerically to obtain the non-dimensional velocity and temperature profiles in a laminar boundary layer are solved. The heat transfer characteristics of PCM slurry was numerically investigated with similar method. It is clarified that the similar solution method of Newtonian fluid can be used reasonably this type of PCM slurry which has low concentration. The data of local wall heat flux and convective heat transfer coefficient of PCM slurry are higher than those of water more than 150$\~$200$\%$, approximately.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3991-4010
• /
• 2021

The Question Similarity Measurement of Chinese Crop Diseases and Insect Pests (QSM-CCD&IP) aims to judge the user's tendency to ask questions regarding input problems. The measurement is the basis of the Agricultural Knowledge Question and Answering (Q & A) system, information retrieval, and other tasks. However, the corpus and measurement methods available in this field have some deficiencies. In addition, error propagation may occur when the word boundary features and local context information are ignored when the general method embeds sentences. Hence, these factors make the task challenging. To solve the above problems and tackle the Question Similarity Measurement task in this work, a corpus on Chinese crop diseases and insect pests(CCDIP), which contains 13 categories, was established. Then, taking the CCDIP as the research object, this study proposes a Chinese agricultural text similarity matching model, namely, the AgrCQS. This model is based on mixed information extraction. Specifically, the hybrid embedding layer can enrich character information and improve the recognition ability of the model on the word boundary. The multi-scale local information can be extracted by multi-core convolutional neural network based on multi-weight (MM-CNN). The self-attention mechanism can enhance the fusion ability of the model on global information. In this research, the performance of the AgrCQS on the CCDIP is verified, and three benchmark datasets, namely, AFQMC, LCQMC, and BQ, are used. The accuracy rates are 93.92%, 74.42%, 86.35%, and 83.05%, respectively, which are higher than that of baseline systems without using any external knowledge. Additionally, the proposed method module can be extracted separately and applied to other models, thus providing reference for related research.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.769-783
• /
• 2000

In this paper, in order to disambiguate Korean noun word sense, we define a local context and explain how to extract it from a raw corpus. Following the intuition that two different nouns are likely to have similar meanings if they occur in the same local context, we use, as a clue, the word that occurs in the same local context where the target noun occurs. This method increases the usability of extracted knowledge and makes it possible to disambiguate the sense of infrequent words. And we can overcome the data sparseness problem by extending the verbs in a local context. The sense of a target noun is decided by the maximum similarity to the clues learned previously. The similarity between two words is computed by their concept distance in the sense hierarchy borrowed from WordNet. By reducing the multiplicity of clues gradually in the process of computing maximum similarity, we can speed up for next time calculation. When a target noun has more than two local contexts, we assign a weight according to the type of each local context to implement the differences according to the strength of semantic restriction of local contexts. As another knowledge source, we get a co-occurrence information from dictionary definitions and example sentences about the target noun. This is used to support local contexts and helps to select the most appropriate sense of the target noun. Through experiments using the proposed method, we discovered that the applicability of local contexts is very high and the co-occurrence information can supplement the local context for the precision. In spite of the high multiplicity of the target nouns used in our experiments, we can achieve higher performance (89.8%) than the supervised methods which use a sense-tagged corpus.

• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.775-784
• /
• 2019

Image stitching is a technique for solving the problem of narrow field of view of a camera by composing multiple images. Recently, as the use of content such as Panorama, Super Resolution, and 360 VR increases, the need for faster and more accurate image stitching technology is increasing. So far, many algorithms have been proposed to satisfy the required performance, but the objective evaluation method for measuring the accuracy has not been standardized. In this paper, we present the problems of PSNR and SSIM(Structural similarity index method) measurement methods and propose a Local Differential Pixel Mean method. The LDPM evaluation method that includes geometric similarity and brightness measurement information is proved through a test, and the advantages of the evaluation method are revealed through comparison with SSIM.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.60-83
• /
• 2014

This paper aims to propose a research framework of analyzing voting activities of a national assembly on the basis of member-level voting similarity and provides a case study in the $18^{th}$ national assembly in South Korea. First, we propose a bill contentiousness measure that gives a higher score to bills for which ayes and noes are more diversified in both conservative and progressive parties. Based on the bill contentiousness measure, the top 5%, 10%, and 20% bills were identified and used for further analyses. Moreover, we propose a member-level voting similarity measure that compensates for the lower frequency of noes, and evaluate the pair-wise voting similarities for all lawmakers. Then, voting similarity differences to the affiliated/non-affiliated parties were analyzed for the members in the two major parties according to some internal/external key factors. Finally, similar voting groups were identified and their affiliations were investigated based on the multi-dimensional scaling (MDS) and network analysis techniques. A case study on the $18^{th}$ national assembly of South Korea showed that the cohesion of the members in the 'Hanara' party becomes higher than that of the 'Minju' party as the bill contentiousness increases, whereas the number of elected, local constituency versus proportional representation, and the competition intensity in a local constituency were found to be partially influential to the voting activities of lawmakers. In addition, MDS and network analysis showed that there is a distinctive difference between two parties when all bills are analyzed, whereas the diversity of parties increases in the same group as the bill contentiousness increases.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.410-415
• /
• 2005

Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits at a wide range of scales - Self-similarity. Self-similarity is expressed by long term dependency, this is contradictory concept with Poisson model that have relativity short term dependency. Therefore, first of all for design and dimensioning of next generation communication network, traffic model that are reflected burstness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, when different many data traffic being integrated under various environments is arrived to communication network, Hurst Parameter's change is analyzed and compared with simulation results.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.146-149
• /
• 2003

As the information that can collect from the web to local database is increasing, we propose a system that can suggest related local documents when new document arrives. We also propose for constructing an association dictionary using web search engines for similarity calculation. The prototype system is also developed, which is described in detail.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.71-78
• /
• 2009

An element of a ring R with identity is called strongly clean if it is the sum of an idempotent and a unit that commute, and R is called strongly clean if every element of R is strongly clean. Let R be a noncommutative local ring, a criterion in terms of solvability of a simple quadratic equation in R is obtained for $M_2$(R) to be strongly clean.