• Title/Summary/Keyword: Block level

Search Result 1,333, Processing Time 0.023 seconds

Conjoint analysis with mixed levels of attributes (혼합된 수준들의 속성들을 갖는 컨조인트 분석)

  • Lim, Yong B.;Chung, Jong Hee
    • Journal of Korean Society for Quality Management
    • /
    • v.44 no.4
    • /
    • pp.799-811
    • /
    • 2016
  • Purpose: The conjoint analyst in marketing are interested in detecting whether there exist synergy or antagonistic effects between two attributes. In the cases where attributes have two or three levels, we research on the design of survey questionnaire to estimate all the main effect and as many two factor interaction effects as possible. Methods: We consider the balanced incomplete block (BIB) mixed level factorial design $2^f{\times}3^g$ or fractional factorial design. To reduce the number of questions in a questionnaire, we propose the balanced incomplete block mixed level design with minimum aberration which is generated by implementing proc factex in SAS. Also, we propose using two or three level BIB factorial design instead of mixed level designs by transforming three level attributes into two attributes of two levels and two level attribute into three level attribute by using dummy level technique. Results: We propose three methods for designing survey questionnaire where the block and design generators are found with practical number of questions in a questionnaire. By analyzing all the respondents survey data generated by the simulation study, we find the proper model and do the concepts optimization. Conclusion: The proposed methods of designing survey questionnaires seem to perform well in the sense that the proper model, and then the optimal concept is found in a case study where all the respondents survey data are generated by the simulation study.

A Study on the Block Truncation Coding Using the Bit-plane Reduction (비트평면 감축을 이용한 블록 절단부호화에 관한 연구)

  • 이형호;박래홍
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.5
    • /
    • pp.833-840
    • /
    • 1987
  • A new Block Truncation Coding(BTC) technique reducing the bit-plane and using differential pulse code modulation (DPCM) is proposed and compared with the conventional BTC methods. A new technique decides whether the subblock can be approximated to be uniform or not. If the subblock can be approximated to be uniform(merge mode), we transmit only the gray-level informantion. It not (split mode), we transmity both the bit-plane and the gray-level information. DPCM method is proposed to the encoding of gray-level information when the subblock can be approximated to be uniform. Also modified quantization method is presented to the encoding of gray-level information when the subblock is not uniform. This technique shows the results of coding 256 level images at the average data rate of about 0.75 bits/pel.

  • PDF

Block Unit Mapping Technique of NAND Flash Memory Using Variable Offset

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.8
    • /
    • pp.9-17
    • /
    • 2019
  • In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

Analyzing Airport Network Characteristics Applied to the Structural Equivalence (구조적 등위성을 적용한 공항네트워크의 특성 분석)

  • Oh, Sung Yeoul;Park, Yonghwa
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.2
    • /
    • pp.162-169
    • /
    • 2014
  • This study dealt with the airport network applying the Structural Equivalence which has used in the field of social science network. It analyzed the size of aviation market and trade exchanges. The results between blocks through the Convergence of Iteration Correlation are as follows; Block 1 (major hub airport) and Block 5 (Australian and New Zealand airports) have a strong relationship between other blocks. Block 3 (CIS region) and Block 7 (Malaysia and Indonesia) have been indicated as relatively low degree. The structural equivalence analysis can be grouped as a small number of blocks with large and complex networks and also presented a significant result according to the nature of the relationship between aviation market and the level of trade exchanges.

The YIQ Model of Computed Tomography Color Image Variable Block with Fractal Image Coding (전산화단층촬영 칼라영상의 YIQ모델을 가변블록 이용한 프랙탈 영상 부호화)

  • Park, Jae-Hong;Park, Cheol-Woo
    • Journal of the Korean Society of Radiology
    • /
    • v.10 no.4
    • /
    • pp.263-270
    • /
    • 2016
  • This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

AMSEA: Advanced Multi-level Successive Elimination Algorithms for Motion Estimation (움직임 추정을 위한 개선된 다단계 연속 제거 알고리즘)

  • Jung, Soo-Mok;Park, Myong-Soon
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.98-113
    • /
    • 2002
  • In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

Performance Evaluation of Overlapping wavelet Transform for AR Model (AR 모델에 의한 중복 웨이브렛 변환의 성능 평가)

  • 권상근;김재균
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.1
    • /
    • pp.56-62
    • /
    • 1993
  • OWT is a tool for block transform coding with wavelet basis functions that overlap adjacent blocks. The OWT can reduce the block effect. In this paper performances of OWT are evaluated for AR model. Some simulation results show that performances are nearly same to DCT, but block effect is reduced to very low level.

  • PDF

Overlapping Wavelet Transform (중복 웨이브렛 변환)

  • 권상근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.6
    • /
    • pp.604-612
    • /
    • 1992
  • OWT is a tool for block transform coding with wavelet basis functions that overlap adjacent blocks. The OWT can reduce the block effect. Without increasing the transmission data in this paper transform matrix of OWT Is presented. Some simulation results show that performances are early same to BCT, but block effect is reduced to very low level.

  • PDF

EFFECTS OF AVERAGING AND COMPLIANCE ON NEWMARK-TYPE DEFORMATION ANALYSIS

  • Kim, Jin-Man
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2010.09c
    • /
    • pp.61-65
    • /
    • 2010
  • The performance of slopes during earthquake is often accessed in terms of permanent deformation. In the assessment of permanent deformation, Newmark-type rigid block analysis is widely used. Original Newmark-type block approach, however, assumes the potential sliding mass to be rigid, and has been criticized to be potentially unconservative. The paper reviews analytically the impact of this noncompliance assumption on computed permanent deformations. The results indicate that there is a simple criterion that can be used to determine the level of conservativeness of the rigid block approach in cases of gently-sloping slip surfaces and retaining walls.

  • PDF

Estimation of the Block and Basu model for system level life testing with censored data

  • Jeong, In-Ho;Cho, Kil-Ho;Cho, Jang-Sik
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.5
    • /
    • pp.941-948
    • /
    • 2009
  • We consider a life testing experiment in which several two component shared parallel system are put on test, and the test is terminated at a specified number of system failures. The bivariate data obtained from such a system level life testing can be classified into three classes: (1) the case of failed two components with known failure times, (2) the case of one censored component and the other failed component of which the failure time might be known or unknown, (3) the case of censored two components. In this thesis, the maximum likelihood estimators of parameters for Block and Basu bivariate exponential distribution under above censoring scheme are obtained. And the results of comparative studies are presented.

  • PDF