• Title/Summary/Keyword: Trace operator

Search Result 25, Processing Time 0.022 seconds

Dynamic Slicing Algorithms for Understanding of C Programs (C 프로그램의 이해를 지원하는 동적 조각화 알고리즘)

  • Kim, Tae-Hee;Kang, Moon-Seol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.172-180
    • /
    • 2005
  • Dynamic slicing method decomposes a program into slices and supports to be understood programs easily by software developer or maintainer. In this paper, we propose dynamic slicing algorithm to reduce time to decompose a program. We produce reference-variable set used in right and modify-variable set used in left on the basis of the assignment operator of all sentences and extract Inter-Variable Relationship(VV) for all variables of variable declaration. Proposed algorithm extracts dynamic slices by using them and execution trace of program. In conclusion, proposed algorithm improved the performance by reducing the time to extract dynamic slices by decreasing average comparison count of sentence when the number of criterion variables is three or more.

AN INVERSE PROBLEM OF THE THREE-DIMENSIONAL WAVE EQUATION FOR A GENERAL ANNULAR VIBRATING MEMBRANE WITH PIECEWISE SMOOTH BOUNDARY CONDITIONS

  • Zayed, E.M.E.
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.81-105
    • /
    • 2003
  • This paper deals with the very interesting problem about the influence of piecewise smooth boundary conditions on the distribution of the eigenvalues of the negative Laplacian in R$^3$. The asymptotic expansion of the trace of the wave operator (equation omitted) for small |t| and i=√-1, where (equation omitted) are the eigenvalues of the negative Laplacian (equation omitted) in the (x$^1$, x$^2$, x$^3$)-space, is studied for an annular vibrating membrane $\Omega$ in R$^3$together with its smooth inner boundary surface S$_1$and its smooth outer boundary surface S$_2$. In the present paper, a finite number of Dirichlet, Neumann and Robin boundary conditions on the piecewise smooth components (equation omitted)(i = 1,...,m) of S$_1$and on the piecewise smooth components (equation omitted)(i = m +1,...,n) of S$_2$such that S$_1$= (equation omitted) and S$_2$= (equation omitted) are considered. The basic problem is to extract information on the geometry of the annular vibrating membrane $\Omega$ from complete knowledge of its eigenvalues by analysing the asymptotic expansions of the spectral function (equation omitted) for small |t|.

MP-Lasso chart: a multi-level polar chart for visualizing group Lasso analysis of genomic data

  • Min Song;Minhyuk Lee;Taesung Park;Mira Park
    • Genomics & Informatics
    • /
    • v.20 no.4
    • /
    • pp.48.1-48.7
    • /
    • 2022
  • Penalized regression has been widely used in genome-wide association studies for joint analyses to find genetic associations. Among penalized regression models, the least absolute shrinkage and selection operator (Lasso) method effectively removes some coefficients from the model by shrinking them to zero. To handle group structures, such as genes and pathways, several modified Lasso penalties have been proposed, including group Lasso and sparse group Lasso. Group Lasso ensures sparsity at the level of pre-defined groups, eliminating unimportant groups. Sparse group Lasso performs group selection as in group Lasso, but also performs individual selection as in Lasso. While these sparse methods are useful in high-dimensional genetic studies, interpreting the results with many groups and coefficients is not straightforward. Lasso's results are often expressed as trace plots of regression coefficients. However, few studies have explored the systematic visualization of group information. In this study, we propose a multi-level polar Lasso (MP-Lasso) chart, which can effectively represent the results from group Lasso and sparse group Lasso analyses. An R package to draw MP-Lasso charts was developed. Through a real-world genetic data application, we demonstrated that our MP-Lasso chart package effectively visualizes the results of Lasso, group Lasso, and sparse group Lasso.

A Study on the Improvement of the Facial Image Recognition by Extraction of Tilted Angle (기울기 검출에 의한 얼굴영상의 인식의 개선에 관한 연구)

  • 이지범;이호준;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.935-943
    • /
    • 1993
  • In this paper, robust recognition system for tilted facial image was developed. At first, standard facial image and lilted facial image are captured by CCTV camera and then transformed into binary image. The binary image is processed in order to obtain contour image by Laplacian edge operator. We trace and delete outermost edge line and use inner contour lines. We label four inner contour lines in order among the inner lines, and then we extract left and right eye with known distance relationship and with two eyes coordinates, and calculate slope information. At last, we rotate the tilted image in accordance with slope information and then calculate the ten distance features between element and element. In order to make the system invariant to image scale, we normalize these features with distance between left and righ eye. Experimental results show 88% recognition rate for twenty five face images when tilted degree is considered and 60% recognition rate when tilted degree is not considered.

  • PDF

Evaluation of Angle Dependence on Positional Radioisotope Source Detector using Monte Carlo Simulation in NDT (몬테카를로 시뮬레이션을 이용한 방사선원 위치 검출기의 각도의존성 연구)

  • Han, Moojae;Heo, Seunguk;Shin, Yohan;Jung, Jaehoon;Kim, Kyotae;Heo, Yeji;Lee, Deukhee;Cho, Heunglae;Park, Sungkwang
    • Journal of the Korean Society of Radiology
    • /
    • v.13 no.1
    • /
    • pp.141-146
    • /
    • 2019
  • Radiation sources used in the field of industrial non-destructive pose a risk of exposure due to ageing equipment and operator carelessness. Thus, the need for a safety management system to trace the location of the source is being added. In this study, Monte Carlo Simulation was performed to analyse the angle dependence of the unit-cell comprising the line-array dosimeter for tracking the location of radiation sources. As a result, the margin of error for the top 10% of each slope was 5.90% at $0^{\circ}$, 8.08% at $30^{\circ}$, and 20.90% at $60^{\circ}$. The ratio of the total absorbed dose was 83.77% at $30^{\circ}$ and 53.36% at $60^{\circ}$ based on $0^{\circ}$(100%) and showed a tendency to decrease with increasing slope. For all gradients, the maximum number was shown at $30^{\circ}$ No. 9 pixels, and for No. 10, there was a tendency to drop 7.24 percent. This study has shown a large amount of angle dependence, and it is estimated that the proper distance between the source and line-array dosimeters should be maintained at a distance of not less than 1 cm to reduce them.