• Title/Summary/Keyword: State-state mapping

Search Result 335, Processing Time 0.02 seconds

Methodology of Mapping Quantitative Trait Loci for Binary Traits in a Half-sib Design Using Maximum Likelihood

  • Yin, Zongjun;Zhang, Qin;Zhang, Jigang;Ding, Xiangdong;Wang, Chunkao
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.18 no.12
    • /
    • pp.1669-1674
    • /
    • 2005
  • Maximum likelihood methodology was applied to analyze the efficiency and statistical power of interval mapping by using a threshold model. The factors that affect QTL detection efficiency (e.g. QTL effect, heritability and incidence of categories) were simulated in our study. Daughter design with multiple families was applied, and the size of segregating population is 500. The results showed that the threshold model has a great advantage in parameters estimation and power of QTL mapping, and has nice efficiency and accuracy for discrete traits. In addition, the accuracy and power of QTL mapping depended on the effect of putative quantitative trait loci, the value of heritability and incidence directly. With the increase of QTL effect, heritability and incidence of categories, the accuracy and power of QTL mapping improved correspondingly.

A study of Temperal Difference Learning using Nonlinear Function Approximation (비선형 함수 근사화를 사용한 TD학습에 관한 연구)

  • Kwon, Jae-Cheol;Lee, Young-Seog;Kim, Dong-Ok;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.407-409
    • /
    • 1998
  • This paper deals with temporal-difference learning that is a method for approximating long-term future cost as a function of current state in knowlege-poor environment, a function approximator is used to approximate the mapping from state to future cost, a linear function approximator is limited because mapping from state to future cost has a nonlinear characteristic, so a nonlinear function approximator is used to approximate the mapping from state to future cost in this paper, and that TD learning using a nonlinear function approximator is stable is proved.

  • PDF

Application of the Instantaneous Lyapunov Exponent and Chaotic Systems, Part 2: Experiment and Comparison with the Force-State Mapping Method (순간 발산지수의 카오스계에의 응용, 파트 2: 실험 및 힘-위상(Force-State Mapping) 방법과의 비교)

  • Shin, Ki-Hong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.1 s.94
    • /
    • pp.150-160
    • /
    • 1999
  • 본 논문은 ‘파트 1’에 그 기초를 두었으며, 실제 실험 상황에의 응용예를 들었다. 보편적인 ‘이중-우물 위치 진동기(double-well potential vibrator)'를 외부 공기압 감쇠기를 장치할 수 있도록 수정하였다. 감쇠는 높음 또는 낮음 으로 조정할 수 있도록 하였다. 이 실험계는 주기운동부터 카오스 운동까지 다양한 동적 특성을 보여준다. 힘-위상(Force-Stare Mapping) 방법이 선형상태 및 카오스상태에 응용되었으며, 특히 감쇠의 높고 낮음의 파악에 그 중점을 두었다. 그리고 , 부분발산지수들(Short term averaged Lyapunov exponents)의 합이 또한 감쇠를 파악함과 동시에 높은 감쇠에서 낮은 감쇠로의 변화를 감시할 수 있음을 보였다. 이 두가지 방법들을 비교하였으며 논하였다.

  • PDF

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection

  • Kim, HyunJin;Lee, Seung-Woo
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.154-157
    • /
    • 2013
  • This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.

A Compact Representation of Translation Pages for Flash Translation Layers of Solid State Drives

  • Kim, Yong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.2
    • /
    • pp.1-7
    • /
    • 2019
  • This paper presents CTP (Compact Translation Page), a compact representation of translation pages, for page mapping-based flash translation layers to improve RAM utilization and reduce the response time of solid state drives. CTP can store translation information twice in a translation page and the total number of translation pages stored in flash is reduced to half. Therefore, CTP halves the RAM size of the directory of translation pages and uses the saved RAM space for translation cache. CTP shows the best response time when compared to existing page mapping-based flash translation layers.

Symmetric Conformal Mapping for Surface Matching and Registration

  • Zeng, Wei;Hua, Jing;Gu, Xianfeng David
    • International Journal of CAD/CAM
    • /
    • v.9 no.1
    • /
    • pp.103-109
    • /
    • 2010
  • Recently, various conformal geometric methods have been presented for non-rigid surface matching and registration. This work proposes to improve the robustness of conformal geometric methods to the boundaries by incorporating the symmetric information of the input surface. We presented two symmetric conformal mapping methods, which are based on solving Riemann-Cauchy equation and curvature flow respectively. Experimental results on geometric data acquired from real life demonstrate that the symmetric conformal mapping is insensitive to the boundary occlusions. The method outperforms all the others in terms of robustness. The method has the potential to be generalized to high genus surfaces using hyperbolic curvature flow.

A New Parameter Estimation Method for a Zipf-like Distribution for Geospatial Data Access

  • Li, Rui;Feng, Wei;Wang, Hao;Wu, Huayi
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.134-140
    • /
    • 2014
  • Many reports have shown that the access pattern for geospatial tiles follows Zipf's law and that its parameter ${\alpha}$ represents the access characteristics. However, visits to geospatial tiles have temporal and spatial popularities, and the ${\alpha}$-value changes as they change. We construct a mathematical model to simulate the user's access behavior by studying the attributes of frequently visited tile objects to determine parameter estimation algorithms. Because the least squares (LS) method in common use cannot obtain an exact ${\alpha}$-value and does not provide a suitable fit to data for frequently visited tiles, we present a new approach, which uses a moment method of estimation to obtain the value of ${\alpha}$ when ${\alpha}$ is close to 1. When ${\alpha}$ is further away from 1, the method uses the associated cache hit ratio for tile access and uses an LS method based on a critical cache size to estimate the value of ${\alpha}$. The decrease in the estimation error is presented and discussed in the section on experiment results. This new method, which provides a more accurate estimate of ${\alpha}$ than earlier methods, promises more effective prediction of requests for frequently accessed tiles for better caching and load balancing.

Denoising Mapping Utilizing Constellation Symmetry in Denoise-and-Forward Two-Way Relay Channels

  • Zheng, Jianping;Bai, Baoming;Li, Ying
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.617-620
    • /
    • 2012
  • The denoising mapping with the closest-neighbor clustering (CNC) method in denoise-and-forward two-way relay channels is studied. Specifically, the symmetry of the constellations in source terminals A and B is utilized to reduce the complexity of the CNC method. The specific case considered first to illustrate how the constellation symmetry works in the CNC method is the quadrature phase-shift keying constellation in A and B and the single-antenna deployment in all terminals. This case study shows that an enormous complexity reduction can be achieved. Next, the result is extended to multiple-antenna scenarios and square quadrature amplitude modulations.