• Title/Summary/Keyword: mapping size

Search Result 383, Processing Time 0.024 seconds

Evaluation of a Fine-mapping Method Exploiting Linkage Disequilibrium in Livestock Populations: Simulation Study

  • Kim, JongJoo;Farnir, Frederic
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.19 no.12
    • /
    • pp.1702-1705
    • /
    • 2006
  • A simulation study was conducted to evaluate a fine-mapping method exploiting population-wide linkage disequilibrium. Data were simulated according to the pedigree structure based on a large paternal half-sib family population with a total of 1,034 or 2,068 progeny. Twenty autosomes of 100 cM were generated with 5 cM or 1 cM marker intervals for all founder individuals in the pedigree, and marker alleles and a number of quantitative trait loci (QTL) explaining a total of 70% phenotypic variance were generated and randomly assigned across the whole chromosomes, assuming linkage equilibrium between the markers. The founder chromosomes were then descended through the pedigree to the current offspring generation, including recombinants that were generated by recombination between adjacent markers. Power to detect QTL was high for the QTL with at least moderate size, which was more pronounced with larger sample size and denser marker map. However, sample size contributed much more significantly to power to detect QTL than map density to the precise estimate of QTL position. No QTL was detected on the test chromosomes in which QTL was not assigned, which did not allow detection of false positive QTL. For the multiple QTL that were closely located, the estimates of the QTL positions were biased, except when the QTL were located on the right marker positions. Our fine mapping simulation results indicate that construction of dense maps and large sample size is needed to increase power to detect QTL and mapping precision for QTL position.

Mapping Particle Size Distributions into Predictions of Properties for Powder Metal Compacts

  • German, Randall M.
    • Proceedings of the Korean Powder Metallurgy Institute Conference
    • /
    • 2006.09b
    • /
    • pp.704-705
    • /
    • 2006
  • Discrete element analysis is used to map various log-normal particle size distributions into measures of the in-sphere pore size distribution. Combinations evaluated range from monosized spheres to include bimodal mixtures and various log-normal distributions. The latter proves most useful in providing a mapping of one distribution into the other (knowing the particle size distribution we want to predict the pore size distribution). Such metrics show predictions where the presence of large pores is anticipated that need to be avoided to ensure high sintered properties.

  • PDF

A Proposal for Hit Ratio Improvement of a Microprocessor's Cache Memory (마이크로프로세서 캐쉬메모리의 적중률 개선을 위한 제안)

  • 조용훈;김정선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.783-787
    • /
    • 2000
  • A microprocessor, which is used as a CPU for state-of-the-art personal computers, adopts 256KB or 512KB L2(Level 2) cache memory. This cache hires Direct Mapping Procedure, 32B Line Size, and no Write Allocation. In this cache architecture, we can expert about 2.5% hit ratio improvement by using 8-way Set Associative Mapping instead of Direct Mapping, 128B Line Size instead of 32B, and Write Allocation.

  • PDF

Performance Analysis of n-way Associative Cache and Fully Associative Cache (n-way Set Associative Cache와 Fully Associative Cache성능 분석)

  • Jo, Yong-Hun;Kim, Jeong-Seon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.802-810
    • /
    • 1997
  • In this paper, the performance of direce mapping caches, 2_, 4_, 8_, .., 4096_way way set associative caches, and fully assiciative caches are analyized by trace simulation for verivying their effectiveness.In general, it is well known that as n, the number of main memory lines to be stored into one cache line number in direct mapping cache, increases, the performance of the cache memory should get higher linearly.According to our analysis, however, it is not true on all the cache organizations.It is shown that as n increases, miss ratios get lower only when the small cache(less than 256K) using large line size is used.It is also shown that fully associative mapping achieves high performance only when small size cache using large line size ia used.

  • PDF

Integration of Kriging Algorithm and Remote Sensing Data and Uncertainty Analysis for Environmental Thematic Mapping: A Case Study of Sediment Grain Size Mapping (지표환경 주제도 작성을 위한 크리깅 기법과 원격탐사 자료의 통합 및 불확실성 분석 -입도분포지도 사례 연구-)

  • Park, No-Wook;Jang, Dong-Ho
    • Journal of the Korean Geographical Society
    • /
    • v.44 no.3
    • /
    • pp.395-409
    • /
    • 2009
  • The objective of this paper is to illustrate that kriging can provide an effective framework both for integrating remote sensing data and for uncertainty modeling through a case study of sediment grain size mapping with remote sensing data. Landsat TM data which show reasonable relationships with grain size values are used as secondary information for sediment grain size mapping near the eastern part of Anmyeondo and Cheonsuman bay. The case study results showed that uncertainty attached to prediction at unsampled locations was significantly reduced by integrating remote sensing data through the analysis of conditional variance from conditional cumulative distribution functions. It is expected that the kriging-based approach presented in this paper would be efficient integration and analysis methodologies for any environmental thematic mapping using secondary information as well as sediment grain size mapping.

An Effective Memory Mapping Function for CMAC Controller (CMAC 제어기를 위한 효과적인 메모리 매핑 함수)

  • Kwon, H.Y.;Bien, Z.;Suh, I.H.
    • Proceedings of the KIEE Conference
    • /
    • 1989.11a
    • /
    • pp.488-493
    • /
    • 1989
  • In this paper, the structure of CMAC address mapping is first revisited, and the address hashing function and the random mapping is discussed in the conventional CMAC implementation. Then the effective size of CMAC memory is derived from the modulus property of the CMAC address vector, and a new hashing function for the effective memory mapping is proposed for a CMAC implementation with feasible memory size and no troublesome random mapping. Finally, the performance of the conventional CMAC learning algorithm and that of the proposed new CMAC scheme arc compared via simulations.

  • PDF

Index block mapping for flash memory system (플래쉬 메모리 시스템을 위한 인덱스 블록 매핑)

  • Lee, Jung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.23-30
    • /
    • 2010
  • Flash memory is non-volatile and can retain data even after system is powered off. Besides, it has many other features such as fast access speed, low power consumption, attractive shock resistance, small size, and light-weight. As its price decreases and capacity increases, the flash memory is expected to be widely used in consumer electronics, embedded systems, and mobile devices. Flash storage systems generally adopt a software layer, called FTL. In this research, we proposed a new FTL mechanism for overcoming the major drawback of conventional block mapping algorithm. In addition to the block mapping table, a index block mapping table with a small size is used to indicate sector location. The proposed indexed block mapping algorithm by adding a small size. By the simulation result, the proposed FTL provides an enhanced speed than a conventional hybrid mapping algorithm by around 45% in average, and the requirement of mapping memory is also reduced by around 12%.

WADPM : Workload-Aware Dynamic Page-level Mapping Scheme for SSD based on NAND Flash Memory (낸드 플래시 메모리 기반 SSD를 위한 작업부하 적응형 동적 페이지 매핑 기법)

  • Ha, Byung-Min;Cho, Hyun-Jin;Eom, Young-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.215-225
    • /
    • 2010
  • The NAND flash memory based SSDs are considered to replace the existing HDDs. To maximize the I/O performance, SSD is composed of several NAND flash memories in parallel. However, to adopt the hybrid mapping scheme in SSD may cause degradation of the I/O performance. In this paper, we propose a new mapping scheme for the SSD called WADPM. WADPM loads only necessary mapping information into RAM and dynamically adjusts the size of mapping information in the RAM. So, WADPM avoids the shortcoming of page-level mapping scheme that requires too large mapping table. Performance evaluation using simulations shows that I/O performance of WADPM is 3.5 times better than the hybrid-mapping scheme and maximum size of mapping table of WADPM is about 50% in comparison with the page-level mapping scheme.

Analysis and mapping of the re-1 gene for reduced embryo size in rice

  • Kien, Trinh Hong;Oh, Ji Min;Yang, Paul;Hong, Soon Kwan;Ahn, Sang Nag
    • Korean Journal of Breeding Science
    • /
    • v.42 no.1
    • /
    • pp.23-27
    • /
    • 2010
  • The objective of this study was to map the gene for reduced embryo size in rice using DNA markers. The reduced embryo size mutant was induced from N-methyl-N-nitrosourea (MNU) treated Taichung 65. Genetic analysis revealed that the phenotype of the reduced embryo was controlled by a single recessive gene, designated as re-1. For mapping the gene controlling embryo size, an $F_2$ population was developed from a cross between the Korean Tongil-type, Milyang 23 (Oryza sativa ssp. indica) and the mutant. The ratio of $F_2$ seeds nearly fitted to 3:1 ratio, indicating that this phenotype was controlled by a single recessive gene. Bulked sergeant analysis was performed with SSR markers. The gene for the reduced embryo size was detected on chromosome 1. The gene was further mapped between two SSR markers, RM315 and RM265 on chromosome 1 (approximately 1.5 Mb interval). The linked markers will facilitate selection of this grain character in a breeding program and provide the foundation for positional cloning of this gene.

Rendering Performance Evaluation of 3D Games with Interior Mapping (Interior Mapping이 적용된 3D 게임의 렌더링 성능 평가)

  • Lee, Jae-Won;Kim, Youngsik
    • Journal of Korea Game Society
    • /
    • v.19 no.6
    • /
    • pp.49-60
    • /
    • 2019
  • Interior Mapping has been used to reduce graphics resources. In this paper, rendering speed(FPS), the number of polygons, shader complexity and each resource size of Interior Mapping were compared to those of actual modeling in order to examine the performance of 3D games when the technology is adapted by utilizing Unreal Engine 4. In addition, for the efficient application, the difference in performance according to the resolution and detail of cube map texture was verified.