• Title/Summary/Keyword: Two-dimension

Search Result 1,793, Processing Time 0.035 seconds

A Study on Clothing evaluative Criteria of Various Clothing Items (II) (의류상품 유형별 평가기준에 관한 연구(II))

  • 김미영
    • Journal of the Korean Home Economics Association
    • /
    • v.26 no.3
    • /
    • pp.1-12
    • /
    • 1988
  • The objectives of the study were two folds. The first objective was to determine the dimensions of the evaluative criteria of various clothing items (underwear, pajamas, jeans, blouse, two-piece, coat). The second objective was to compare the importance of the dimensions according to the clothing items and the socioeconomic status of the subjects. The questionnaires were administered to college female students living in Seoul. Principal component factor analysis with varimax rotation and ANOVA were used for the analysis. The results were as follows; 1) The evaluative criteria dimensions were found to be different according to clothing items. (1) In underwear, pajamas, jeans, evaluative criteria were classified into Aesthetic dimension, economic dimension and Functional dimension. (2) In blouse, two-piece, coat, evaluative criteria were classified into Aesthetic dimension and practical dimension. 2) there were partially significant differences in placing importance on each evaluative criteria dimension between socio-economic groups. (1) In jeans, there was a significant difference in placing importance on Aesthetic dimension between socioeconomic status groups. (2) In blouse and two-piece there was a significant difference in placing importance on Practical dimension between socioeconomic status groups.

  • PDF

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

A Note on Bootstrapping in Sufficient Dimension Reduction

  • Yoo, Jae Keun;Jeong, Sun
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.3
    • /
    • pp.285-294
    • /
    • 2015
  • A permutation test is the popular and attractive alternative to derive asymptotic distributions of dimension test statistics in sufficient dimension reduction methodologies; however, recent studies show that a bootstrapping technique also can be used. We consider two types of bootstrapping dimension determination, which are partial and whole bootstrapping procedures. Numerical studies compare the permutation test and the two bootstrapping procedures; subsequently, real data application is presented. Considering two additional bootstrapping procedures to the existing permutation test, one has more supporting evidence for the dimension estimation of the central subspace that allow it to be determined more convincingly.

Children's Interpretation of Facial Expression onto Two-Dimension Structure of Emotion (정서의 이차원 구조에서 유아의 얼굴표정 해석)

  • Shin, Young-Suk;Chung, Hyun-Sook
    • Korean Journal of Cognitive Science
    • /
    • v.18 no.1
    • /
    • pp.57-68
    • /
    • 2007
  • This study explores children's categories of emotion understanding from facial expressions onto two dimensional structure of emotion. Children of 89 from 3 to 5 years old were required to those facial expressions related the fourteen emotion terms. Facial expressions applied for experiment are used the photographs rated the degree of expression in each of the two dimensions (pleasure-displeasure dimension and arousal-sleep dimension) on a nine-point scale from 54 university students. The experimental results showed that children indicated the greater stability in arousal dimension than stability in pleasure-displeasure dimension. Emotions about sadness, sleepiness, anger and surprise onto two dimensions was understand very well, but emotions about fear, boredom were showed instability in pleasure-displeasure dimension. Specifically, 3 years old children indicated highly the perception in a degree of arousal-sleep than perception of pleasure-displeasure.

  • 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

Two variations of cross-distance selection algorithm in hybrid sufficient dimension reduction

  • Jae Keun Yoo
    • Communications for Statistical Applications and Methods
    • /
    • v.30 no.2
    • /
    • pp.179-189
    • /
    • 2023
  • Hybrid sufficient dimension reduction (SDR) methods to a weighted mean of kernel matrices of two different SDR methods by Ye and Weiss (2003) require heavy computation and time consumption due to bootstrapping. To avoid this, Park et al. (2022) recently develop the so-called cross-distance selection (CDS) algorithm. In this paper, two variations of the original CDS algorithm are proposed depending on how well and equally the covk-SAVE is treated in the selection procedure. In one variation, which is called the larger CDS algorithm, the covk-SAVE is equally and fairly utilized with the other two candiates of SIR-SAVE and covk-DR. But, for the final selection, a random selection should be necessary. On the other hand, SIR-SAVE and covk-DR are utilized with completely ruling covk-SAVE out, which is called the smaller CDS algorithm. Numerical studies confirm that the original CDS algorithm is better than or compete quite well to the two proposed variations. A real data example is presented to compare and interpret the decisions by the three CDS algorithms in practice.

On hierarchical clustering in sufficient dimension reduction

  • Yoo, Chaeyeon;Yoo, Younju;Um, Hye Yeon;Yoo, Jae Keun
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.4
    • /
    • pp.431-443
    • /
    • 2020
  • The K-means clustering algorithm has had successful application in sufficient dimension reduction. Unfortunately, the algorithm does have reproducibility and nestness, which will be discussed in this paper. These are clear deficits for the K-means clustering algorithm; however, the hierarchical clustering algorithm has both reproducibility and nestness, but intensive comparison between K-means and hierarchical clustering algorithm has not yet been done in a sufficient dimension reduction context. In this paper, we rigorously study the two clustering algorithms for two popular sufficient dimension reduction methodology of inverse mean and clustering mean methods throughout intensive numerical studies. Simulation studies and two real data examples confirm that the use of hierarchical clustering algorithm has a potential advantage over the K-means algorithm.

A STASTICAL STUDY OF DENIAL CROWDING AND ITS RELATIONSHIP TOOTH SIZE, AND ARCH DIMENSION AND SHAPE (치아의 밀집(Crowding)에 영향을 주는 치아 및 악궁의 크기와 형태에 관한 통계학적 연구)

  • Choi, Young-Ju;Park, Young-Chel
    • The korean journal of orthodontics
    • /
    • v.14 no.2
    • /
    • pp.263-272
    • /
    • 1984
  • This study was undertaken to examine the extent to which tooth size and jaw size each contribute to dental crowding. Two groups of dental casts were selected on the basis of dental crowding. One group, consisting of 94 pairs of dental casts (46 males and 48 females) with normal occlusion. A second group, consisting of 84 pairs of dental casts (98 males and 46 females) with crowding. The results were as follows. 1. Means and standard deviations of the two groups were used to compare the two groups. 2. Significant differences were observed between two groups on the basis of tooth size, arch dimension and arch perimeter. 3. Between noncrowded group and crowded group, was crowded group was found to have large troth size than noncrowded group, while smaller arch dimension and perimeter. 4. Significant differences were observed between males and females on the basis of tooth size, arch dimension and arch perimeter. 5. Author found ideal arch shape of normal occlusion.

  • PDF

Non-linear distributed parameter system estimation using two dimension Haar functions

  • Park Joon-Hoon;Sidhu T.S.
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.3
    • /
    • pp.187-192
    • /
    • 2004
  • A method using two dimension Haar functions approximation for solving the problem of a partial differential equation and estimating the parameters of a non-linear distributed parameter system (DPS) is presented. The applications of orthogonal functions, including Haar functions, and their transforms have been given much attention in system control and communication engineering field since 1970's. The Haar functions set forms a complete set of orthogonal rectangular functions similar in several respects to the Walsh functions. The algorithm adopted in this paper is that of estimating the parameters of non-linear DPS by converting and transforming a partial differential equation into a simple algebraic equation. Two dimension Haar functions approximation method is introduced newly to represent and solve a partial differential equation. The proposed method is supported by numerical examples for demonstration the fast, convenient capabilities of the method.