• Title/Summary/Keyword: approximate similarity

Search Result 61, Processing Time 0.023 seconds

A NOTE ON APPROXIMATE SIMILARITY

  • Hadwin, Don
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.6
    • /
    • pp.1157-1166
    • /
    • 2001
  • This paper answers some old questions about approximate similarity and raises new ones. We provide positive evidence and a technique for finding negative evidence on the question of whether approximate similarity is the equivalence relation generated by approximate equivalence and similarity.

  • PDF

Prediction of the Forming Load of Non-Axisymmetric Isothermal Forging using Approximate Similarity Theory (근사 상사 이론을 이용한 비축대칭 등온 단조의 가공하중 예측)

  • 최철현
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1999.03b
    • /
    • pp.71-75
    • /
    • 1999
  • An approximate similarity theory has been applied to predict the forming load of non-axisymmetric forging of aluminum alloys through model material tests. The approximate similarity theory is applicable when strain rate sensitivity geometrical size and die velocity of model materials are different from those of real materials. Actually the forming load of yoke which is an automobile part made of aluminum alloys(Al-6061) is predicted by using this approximate similarity theory. Firstly upset forging tests are have been carried out to determine the flow curves of three model materials and aluminum alloy(Al-6061) and a suitable model material is selected for model material test of Al-6061 And then and forging tests of aluminum yokes have been performed to verify the forming load predicted from the model material which has been selected from above upset forging tests, The forming loads of aluminum yoke forging predicted by this approximate similarity theory are in good agreement with the experimental results of Al-6061 and the results of finite element analysis using DEFORM-3D.

  • PDF

Prediction of the Forming Load of Non-Axisymmetric Isothermal Forging using Approximate Similarity Theory (근사 상사 이론을 이용한 비축대칭 등온 단조의 가공하중 예측)

  • 한정영;최철현;배원병;김영호;이종헌
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.1
    • /
    • pp.204-208
    • /
    • 2000
  • An approximate similarity theory has been applied to predict the forming load of non-axisymmetric forging of aluminum alloys through model material tests. The approximate similarity theory is applicable when strain rate sensitivity, geometrical size, and die velocity of model materials are different from those of real materials. Actually, the forming load of yoke, which is an automobile part made of aluminum alloys(Al-6061), is predicted by using this approximate similarity theory. Firstly, upset forging tests are have been carried out to determine the flow curves of three model materials and aluminum alloy(Al-6061), and a suitable model material is selected for model material test of Al-6061. And then hot forging tests of aluminum yokes have been performed to verify the forming load predicted from the model material, which has been selected from above upset forging tests. The forming loads of aluminum yoke forging predicted by this approximate similarity theory are in good agreement with the experimental results of Al-6061 and the results of finite element analysis using DEFORM-3D.

  • PDF

Similarity and Approximate Solutions of Laminar Film Condensation on a Flat Plate

  • Lee, Sung-Hong;Lee, Euk-Soo
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.9
    • /
    • pp.1339-1345
    • /
    • 2001
  • Laminar film condensation of a saturated pure vapor in forced flow over a flat plate is analyzed as boundary layer solutions. Similarity solutions for some real fluids are presented as a function of modified Jakob number (C$\_$pι/ ΔΤ/Prh$\_$fg/) with property ratio (No Abstract.see full/text) and Pγ as parameters and compared with approximate solutions which were obtained from energy and momentum equations without convection and inertia terms in liquid flow. Approximate solutions agree well with the similarity solutions when the values of modified Jakob number are less then 0.1 near 1 atmospheric pressure.

  • PDF

A Study on Preprocessing Method for Effective Semantic-based Similarity Measures using Approximate Matching Algorithm (의미적 유사성의 효과적 탐지를 위한 데이터 전처리 연구)

  • Kang, Hari;Jeong, Doowon;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.3
    • /
    • pp.595-602
    • /
    • 2015
  • One of the challenges of the digital forensics is how to handle certain amounts of data efficiently. Although reliable and various approximate matching algorithms have been presented to quickly identify similarities between digital objects, its practical effectiveness to identify the semantic similarity is low because of frequent false positives. To solve this problem, we suggest adding a pre-processing of the approximate matching target dataset to increase matching accuracy while maintaining the reliability of the approximate matching algorithm. To verify the effectiveness, we experimented with two datasets of eml and hwp using sdhash in order to identify the semantic similarity.

Approximate Top-k Labeled Subgraph Matching Scheme Based on Word Embedding (워드 임베딩 기반 근사 Top-k 레이블 서브그래프 매칭 기법)

  • Choi, Do-Jin;Oh, Young-Ho;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.8
    • /
    • pp.33-43
    • /
    • 2022
  • Labeled graphs are used to represent entities, their relationships, and their structures in real data such as knowledge graphs and protein interactions. With the rapid development of IT and the explosive increase in data, there has been a need for a subgraph matching technology to provide information that the user is interested in. In this paper, we propose an approximate Top-k labeled subgraph matching scheme that considers the semantic similarity of labels and the difference in graph structure. The proposed scheme utilizes a learning model using FastText in order to consider the semantic similarity of a label. In addition, the label similarity graph(LSG) is used for approximate subgraph matching by calculating similarity values between labels in advance. Through the LSG, we can resolve the limitations of the existing schemes that subgraph expansion is possible only if the labels match exactly. It supports structural similarity for a query graph by performing searches up to 2-hop. Based on the similarity value, we provide k subgraph matching results. We conduct various performance evaluations in order to show the superiority of the proposed scheme.

Some new similarity based approaches in approximate reasoning and their applications to pattern recognition

  • Swapan Raha;Nikhil R. Pal;Ray, Kumar-Sankar
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.719-724
    • /
    • 1998
  • This paper presents a systematic developement of a formal approach to inference in approximate reasoning. We introduce some measures of similarity and discuss their properties. Using the concept of similarity index we formulate two methods for inferring from vague knowledge. In order to illustrate the effectiveness of the proposed technique we use it to develop a vowel recognition system.

  • PDF

A Multiple-Valued Fuzzy Approximate Analogical-Reasoning System

  • Turksen, I.B.;Guo, L.Z.;Smith, K.C.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1274-1276
    • /
    • 1993
  • We have designed a multiple-valued fuzzy Approximate Analogical-Reseaning system (AARS). The system uses a similarity measure of fuzzy sets and a threshold of similarity ST to determine whether a rule should be fired, with a Modification Function inferred from the Similarity Measure to deduce a consequent. Multiple-valued basic fuzzy blocks are used to construct the system. A description of the system is presented to illustrate the operation of the schema. The results of simulations show that the system can perform about 3.5 x 106 inferences per second. Finally, we compare the system with Yamakawa's chip which is based on the Compositional Rule of Inference (CRI) with Mamdani's implication.

  • PDF

A bidirectional fuzy inference network for interval valued decision making systems (구간 결정값을 갖는 의사결정시스템의 양방향 퍼지 추론망)

  • 전명근
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.10
    • /
    • pp.98-105
    • /
    • 1997
  • In this work, we proesent a bidirectional approximate reasoning method and fuzzy inference network for interval valued decision making systems. For this, we propose a new type of similarity measure between two fuzzy vectors based on the Ordered Weighted Averaging (OWA) operator. Since the proposed similarity measure has a structure to give the extreme values by choosing a suitable weighting vector of the OWA operator, it can render an interval valued similarity value. From this property, we derive a bidirectional approximate reasoning method based on the similarity measure and show its fuzzy inference network implementation for the decision making systems requiring the interval valued decisions.

  • PDF

AN APPROXIMATE GREEDY ALGORITHM FOR TAGSNP SELECTION USING LINKAGE DISEQUILIBRIUM CRITERIA

  • Wang, Ying;Feng, Enmin;Wang, Ruisheng
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.493-500
    • /
    • 2008
  • In this paper, we first construct a mathematical model for tagSNP selection based on LD measure $r^2$, then aiming at this kind of model, we develop an efficient algorithm, which is called approximate greedy algorithm. This algorithm is able to make up the disadvantage of the greedy algorithm for tagSNP selection. The key improvement of our approximate algorithm over greedy algorithm lies in that it adds local replacement(or local search) into the greedy search, tagSNP is replaced with the other SNP having greater similarity degree with it, and the local replacement is performed several times for a tagSNP so that it can improve the tagSNP set of the local precinct, thereby improve tagSNP set of whole precinct. The computational results prove that our approximate greedy algorithm can always find more efficient solutions than greedy algorithm, and improve the tagSNP set of whole precinct indeed.

  • PDF