• Title/Summary/Keyword: One-Dimension

Search Result 1,541, Processing Time 0.032 seconds

Image Enhancement for Two-dimension bar code PDF417

  • Park, Ji-Hue;Woo, Hong-Chae
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.69-72
    • /
    • 2005
  • As life style becomes to be complicated, lots of support technologies were developed. The bar code technology is one of them. It was renovating approach to goods industry. However, data storage ability in one dimension bar code came in limit because of industry growth. Two-dimension bar code was proposed to overcome one-dimension bar code. PDF417 bar code most commonly used in standard two-dimension bar codes is well defined at data decoding and error correction area. More works could be done in bar code image acquisition process. Applying various image enhancement algorithms, the recognition rate of PDF417 bar code is improved.

  • PDF

Link-Disjoint Embedding of Complete Binary Trees into 3D-Meshes using Dimension-Ordered Routing (순위차원라우팅을 사용한 완전 이진트리의 3차원 메쉬로의 링크 충돌 없는 임베딩)

  • Park, Sang-Myeong;Lee, Sang-Kyu;Moon, Bong-Hee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.169-176
    • /
    • 2000
  • This paper is considered with the problem of embedding complete binary trees into 3-dimensional meshes using dimension-ordered routing with primary concern of minimizing link congestion. The authors showed that a complete binary tree with $2^P-1$ nodes can be embedded into a 3-dimensional mesh with optimum size, $2^P$ nodes, if the link congestion is two[14], (More precisely, the link congestion of each dimension is two, two, and one if the dimension-ordered routing is used, and two, one, and one if the dimension-ordered routing is not imposed.) In this paper, we present a scheme to find an embedding of a complete binary tree into a 3-dimensional mesh of size no larger than 1.27 times the optimum with link congestion one while using dimension-ordered routing.

  • PDF

Vertical Dimension in Complete Denture : A Literature Review & Clinical Procedures (총의치 수직고경 설정에 대한 고찰)

  • Chung, Jun-Yong
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.18 no.3
    • /
    • pp.185-195
    • /
    • 2002
  • Purpose This article describes the historic and clinical aspects of the determination of the vertical dimension of occlusion and the synoptic procedure of the determination of the vertical dimension of occlusion in complete denture. The determining procedure of the susceptible vertical dimension of occlusion is one of the most important steps in construction of complete denture and prosthodontic treatment. It is considered essential for the improvement and the recovery of facial esthetics and stomatognathic functions. Results Several methods have been suggested for measurement of the vertical dimension of occlusion in the construction of complete denture and the prosthodontic rehabilitation. These range from pre-extraction records to the use of physiologic rest position, swallowing, phonetics, esthetics and facial proportion, etc. But, there is no universally accepted or completely accurate method. There seems to be no significant advantages of one technique other than those of cost, time and equipment requirements, and seems to be in controversial in determining the vertical dimension. Conclusion The vertical dimension of occlusion should be determined and reinspected carefully by dentist for a successful prosthesis with several methods. The more investigations are necessary for more objective and scientific techniques in determining the vertical dimension of occlusion.

COMINIMAXNESS WITH RESPECT TO IDEALS OF DIMENSION ONE

  • Irani, Yavar
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.289-298
    • /
    • 2017
  • Let R denote a commutative Noetherian (not necessarily local) ring and let I be an ideal of R of dimension one. The main purpose of this note is to show that the category ${\mathfrak{M}}(R,\;I)_{com}$ of I-cominimax R-modules forms an Abelian subcategory of the category of all R-modules. This assertion is a generalization of the main result of Melkersson in [15]. As an immediate consequence of this result we get some conditions for cominimaxness of local cohomology modules for ideals of dimension one. Finally, it is shown that the category ${\mathcal{C}}^1_B(R)$ of all R-modules of dimension at most one with finite Bass numbers forms an Abelian subcategory of the category of all R-modules.

The Gain Estimation of a Fabry-Perot Cavity (FPC) Antenna with a Finite Dimension

  • Kwon, Taek-Sun;Lee, Jae-Gon;Lee, Jeong-Hae
    • Journal of electromagnetic engineering and science
    • /
    • v.17 no.4
    • /
    • pp.241-243
    • /
    • 2017
  • In this paper, we have presented an equation for estimating the gain of a Fabry-Perot cavity (FPC) antenna with a finite dimension. When an FPC antenna has an infinite dimension and its height is half of a wavelength, the maximum gain of that FPC antenna can be obtained theoretically. If the FPC antenna does not have a dimension sufficient for multiple reflections between a partially reflective surface (PRS) and the ground, its gain must be less than that of an FPC antenna that has an infinite dimension. In addition, the gain of an FPC antenna increases as the dimension of a PRS increases and becomes saturated from a specific dimension. The specific dimension where the gain starts to saturate also gets larger as the reflection magnitude of the PRS becomes closer to one. Thus, it would be convenient to have a gain equation when considering the dimension of an FPC antenna in order to estimate the exact gain of the FPC antenna with a specific dimension. A gain versus the dimension of the FPC antenna for various reflection magnitudes of PRS has been simulated, and the modified gain equation is produced through the curve fitting of the full-wave simulation results. The resulting empirical gain equation of an FPC antenna whose PRS dimension is larger than $1.5{\lambda}_0$ has been obtained.

Statistical Analysis on Critical Dimension Variation for a Semiconductor Fabrication Process (반도체 제조공정의 Critical Dimension 변동에 대한 통계적 분석)

  • Park, Sung-Min;Lee, Jeong-In;Kim, Byeong-Yun;Oh, Young-Sun
    • IE interfaces
    • /
    • v.16 no.3
    • /
    • pp.344-351
    • /
    • 2003
  • Critical dimension is one of the most important characteristics of up-to-date integrated circuit devices. Hence, critical dimension control in a semiconductor wafer fabrication process is inevitable in order to achieve optimum device yield as well as electrically specified functions. Currently, in complex semiconductor wafer fabrication processes, statistical methodologies such as Shewhart-type control charts become crucial tools for practitioners. Meanwhile, given a critical dimension sampling plan, the analysis of variance technique can be more effective to investigating critical dimension variation, especially for on-chip and on-wafer variation. In this paper, relating to a typical sampling plan, linear statistical models are presented for the analysis of critical dimension variation. A case study is illustrated regarding a semiconductor wafer fabrication process.

On robustness in dimension determination in fused sliced inverse regression

  • Yoo, Jae Keun;Cho, Yoo Na
    • Communications for Statistical Applications and Methods
    • /
    • v.25 no.5
    • /
    • pp.513-521
    • /
    • 2018
  • The goal of sufficient dimension reduction (SDR) is to replace original p-dimensional predictors with a lower-dimensional linearly transformed predictor. The sliced inverse regression (SIR) (Li, Journal of the American Statistical Association, 86, 316-342, 1991) is one of the most popular SDR methods because of its applicability and simple implementation in practice. However, SIR may yield different dimension reduction results for different numbers of slices and despite its popularity, is a clear deficit for SIR. To overcome this, a fused sliced inverse regression was recently proposed. The study shows that the dimension-reduced predictors is robust to the numbers of the slices, but it does not investigate how robust its dimension determination is. This paper suggests a permutation dimension determination for the fused sliced inverse regression that is compared with SIR to investigate the robustness to the numbers of slices in the dimension determination. Numerical studies confirm this and a real data example is presented.