• Title/Summary/Keyword: Singular point

Search Result 213, Processing Time 0.03 seconds

Analysis of Three-Dimensional Cracks in Inhomogeneous Materials Using Fuzzy Theory

  • Lee, Yang-Chang;Lee, Joon-Seong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.2
    • /
    • pp.119-123
    • /
    • 2005
  • This paper describes a fuzzy-based system for analyzing the stress intensity factors (SIFs) of three-dimensional (3D) cracks. 3D finite element method(FEM) was used to obtain the SIF for subsurface cracks and surface cracks existing in inhomogeneous materials. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy theory. Nodes are generated by the bucketing method, and ten-noded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The singular elements such that the mid-point nodes near crack front are shifted at the quarter-points, and these are automatically placed along the 3D crack front. The complete FE model is generated, and a stress analysis is performed. The SIFs are calculated using the displacement extrapolation method. The results were compared with those surface cracks in homogeneous materials. Also, this system is applied to analyze cladding effect of surface cracks in inhomogeneous materials.

Identifying Top K Persuaders Using Singular Value Decomposition

  • Min, Yun-Hong;Chung, Ye-Rim
    • Journal of Distribution Science
    • /
    • v.14 no.9
    • /
    • pp.25-29
    • /
    • 2016
  • Purpose - Finding top K persuaders in consumer network is an important problem in marketing. Recently, a new method of computing persuasion scores, interpreted as fixed point or stable distribution for given persuasion probabilities, was proposed. Top K persuaders are chosen according to the computed scores. This research proposed a new definition of persuasion scores relaxing some conditions on the matrix of probabilities, and a method to identify top K persuaders based on the defined scores. Research design, data, and methodology - A new method of computing top K persuaders is computed by singular value decomposition (SVD) of the matrix which represents persuasion probabilities between entities. Results - By testing a randomly generated instance, it turns out that the proposed method is essentially different from the previous study sharing a similar idea. Conclusions - The proposed method is shown to be valid with respect to both theoretical analysis and empirical test. However, this method is limited to the category of persuasion scores relying on the matrix-form of persuasion probabilities. In addition, the strength of the method should be evaluated via additional experiments, e.g., using real instances, different benchmark methods, efficient numerical methods for SVD, and other decomposition methods such as NMF.

Onset of Slugging Criterion Based on Singular Point and Stability Analyses of Transient One-Dimensional Two-Phase Flow Equations of Two-Fluid Model

  • Sung, Chang-Kyung;Chun, Moon-Hyun
    • Nuclear Engineering and Technology
    • /
    • v.28 no.3
    • /
    • pp.299-310
    • /
    • 1996
  • A two-step approach has been used to obtain a new criterion for the onset of slug formation : (1) In the first step, a more general expression than the existing models for the onset of slug flow criterion has been derived from the analysis of singular points and neutral stability conditions of the transient one-dimensional two-phase flow equations of two-fluid model. (2) In the second step, introducing simplifications and incorporating a parameter into the general expression obtained in the first step to satisfy a number of physical conditions a priori specified, a new simple criterion for the onset of slug flow has been derived. Comparisons of the present model with existing models and experimental data show that the present model agrees very closely with Taitel & Dukler's model and experimental data in horizontal pipes. In an inclined pipe ($\theta$ =50$^{\circ}$), however, the difference between the predictions of the present model and those of existing models is appreciably large and the present model gives the best agreement with Ohnuki et al.'s data.

  • PDF

A Study of optimal algorithm for high-speed process of image signal (영상신호의 고속처리를 위한 최적화 알고리즘에 대한 연구)

  • 권기홍
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.2001-2013
    • /
    • 1994
  • In this paper, the method of processing a blurred noisy image has been researched. The conventional method of processing signal has faluts which are slow convergence speed and long time-consuming process at the singular point and or in the ill condition. There is the process, the Gauss Seidel's method to remove these faults, but it takes too much time because it processed singnal repeatedly. For overcoming the faults, this paper shows a image restoration method which takes shorter than the Gauss-Seidel's by comparing the Gauss Seidel's with proposed alogorithm and accelerating convergence speed at the singular point and/or in the ill condition. In this paper, the conventional process method(Gauss-Seidel) and proposed optimal algorithm were used to get a standard image($256{\times}56{\times}bits$). and then the results are simulated and compared each other in order to examine the variance of MSE(Mean Square Error) by the acceleration parameter in the proposed image restoration. The result of the signal process and the process time was measured at all change of acceleration parameter in order to verify the effectveness of the proposed algorithm.

  • PDF

An Efficient Fingerprint Classification using Gabor Filter (Gabor 필터를 이용한 효율적인 지문분류)

  • Shim, Hyun-Bo;Park, Young-Bae
    • The KIPS Transactions:PartB
    • /
    • v.9B no.1
    • /
    • pp.29-34
    • /
    • 2002
  • Fingerprint recognition technology was studied by classification and matching. In general, there are five different classifications left loop, right loop, whore, arch, and tented-arch. These classifications are used to determine which class an individual's fingerprint belong to, thereby identifying the individual's fingerprint pattern. The result of this classification, which is sent to the large fingerprint database as an index, helps reduce the matching time and enhance the accuracy of fingerprint matching. The existing fingerprint classification method relies on the number and location of cores and delta points called singular points. The drawback of this method is the lack of accuracy stemming from the classification difficulty involving unclear and/or partially-erased fingerprints. The current paper presents an efficient classification method to rectify the problem associated with identifying Singular points from unclear fingerprints. This method, which is based on Gabor filter's unique characteristics for magnifying directional patterns and frequency range selections, improves fingerprint classification accuracy significantly. In this paper, this method is described and its test result is presented for verification.

Study on Reducing Processing Time for Restoration Method (영상신호 복원의 처리 시간단축을 위한 알고리즘에 대한 연구)

  • 권기홍
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.6
    • /
    • pp.817-826
    • /
    • 2001
  • In this paper, the method of processing a blurred noisy signal has been researched. The conventional method of processing signal has faults which are slow-convergence speed and long time-consuming process at the singular point and in the ill condition. There is the process, the Gauss-Seidel's method to remove these faults, but it takes too much time because it processes signal repeatedly. For overcoming the faults, this paper shows a signal process method which takes shorter than the Tikhnov-Miller's by comparing the Tikhnov-Miller's with proposed algorithm and accelerating convergence speed at the singular point in the ill condition. In this paper, the conventional process method and proposed optimal algorithm were used to get a standard image (256 * 256 * 8bits),and then the results are simulated and compared each other in order to examine the variance of MSE ( Mean-Square Error ) by the acceleration parameter in the proposed two dimensional signal procedures. The result of the signal process and the processing time was measured at all change of acceleration parameter in order to verify the effectiveness of the proposed algorithm.

  • PDF

A HIGH-RESOLUTION NUMERICAL ANALYSIS OF SHOCK FOCUSING IN CONCAVE REFLECTORS (반사경 내부 유동의 초점 형성에 관한 고해상도 수치 해석)

  • Jung, Y.G.;Chang, K.S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2009.04a
    • /
    • pp.170-175
    • /
    • 2009
  • Shock focusing is related with explosive release of shock wave energy on a narrow spot in a short duration of time triggering a spontaneous high pressure near the focal point. It is well known that reflection of planar incident shock wave from the metallic concave mirror such as ellipsoidal, paraboloidal or hemispherical cavities will focus on a focal point. We intend to improve the computational results using a wave propagation algorithm and to resolve the mushroom-like structure. For computation of the concave cavity flow, it is not easy to use a single-block mesh because of the many singular points in geometry and coordinates. We have employed a uniform Cartesian-grid method for the wave propagation algorithm.

  • PDF

INTERACTIVE FEATURE EXTRACTION FOR IMAGE REGISTRATION

  • Kim Jun-chul;Lee Young-ran;Shin Sung-woong;Kim Kyung-ok
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.641-644
    • /
    • 2005
  • This paper introduces an Interactive Feature Extraction (!FE) approach for the registration of satellite imagery by matching extracted point and line features. !FE method contains both point extraction by cross-correlation matching of singular points and line extraction by Hough transform. The purpose of this study is to minimize user's intervention in feature extraction and easily apply the extracted features for image registration. Experiments with these imagery dataset proved the feasibility and the efficiency of the suggested method.

  • PDF

Dynamic analysis of a magneto-electro-elastic material with a semi-infinite mode-III crack under point impact loads

  • Feng, Wenjie;Liu, Jinxi
    • Structural Engineering and Mechanics
    • /
    • v.27 no.5
    • /
    • pp.609-623
    • /
    • 2007
  • The problem of a semi-infinite magneto-electro-elastically impermeable mode-III crack in a magneto-electro-elastic material is considered under the action of impact loads. For the case when a pair of concentrated anti-plane shear impacts, electric displacement and magnetic induction impacts are exerted symmetrically on the upper and lower surfaces of the crack, the magneto-electro-elastic field ahead of the crack tip is determined in explicit form. The dynamic intensity factors and dynamic energy density factor are obtained. The method adopted is to reduce the mixed initial-boundary value problem, by using the Laplace and Fourier transforms, into three simultaneous dual integral equations, one of which is converted into an Abel's integral equation and the others into a singular integral equation with Cauchy kernel. Based on the obtained fundamental solutions of point impact loads, the solutions of two kinds of different loading cases are evaluated by integration. For some particular cases, the present results reduce to the previous results.

PROJECTIVE DOMAINS WITH NON-COMPACT AUTOMORPHISM GROUPS I

  • Yi, Chang-Woo
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.5
    • /
    • pp.1221-1241
    • /
    • 2008
  • Most of domains people have studied are convex bounded projective (or affine) domains. Edith $Soci{\acute{e}}$-$M{\acute{e}}thou$ [15] characterized ellipsoid in ${\mathbb{R}}^n$ by studying projective automorphism of convex body. In this paper, we showed convex and bounded projective domains can be identified from local data of their boundary points using scaling technique developed by several mathematicians. It can be found that how the scaling technique combined with properties of projective transformations is used to do that for a projective domain given local data around singular boundary point. Furthermore, we identify even unbounded or non-convex projective domains from its local data about a boundary point.