• 제목/요약/키워드: complexities

검색결과 477건 처리시간 0.029초

What Holds the Future of Quantitative Genetics? - A Review

  • Lee, Chaeyoung
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제15권2호
    • /
    • pp.303-308
    • /
    • 2002
  • Genetic markers engendered by genome projects drew enormous interest in quantitative genetics, but knowledge on genetic architecture of complex traits is limited. Complexities in genetics will not allow us to easily clarify relationship between genotypes and phenotypes for quantitative traits. Quantitative genetics guides an important way in facing such challenges. It is our exciting task to find genes that affect complex traits. In this paper, landmark research and future prospects are discussed on genetic parameter estimation and quantitative trait locus (QTL) mapping as major subjects of interest.

효율적인 애니메이션을 위한 모션 에디팅 방법의 계산량분석에 관한 연구 (Analysis on the Computational complexities of Motion Editing for Graphic Animation)

  • 이지홍;김인식;김성수
    • 제어로봇시스템학회논문지
    • /
    • 제8권1호
    • /
    • pp.28-36
    • /
    • 2002
  • Regarding efficient development of computer graphic animations, lots of techniques for editing or transforming existing motion data have been developed. Basically, the motion transformation techniques follow optimization process. To make the animation be natural, almost all the techniques utilize kinematics and dynamics in constructing constraints for the optimization. Since the kinematic and dynamic structures of virtual characters to be animated are very complex, the most time-consuming part is known to the optimization process. In order to suggest some guide lines to engineers involved in the motion transformation, in this paper, we analyze the computational complexities for typical motion transformation in quantitative manner as well as the possibility for parallel computation.

PERFORMANCE COMPARISON OF CRYPTANALYTIC TIME MEMORY DATA TRADEOFF METHODS

  • Hong, Jin;Kim, Byoung-Il
    • 대한수학회보
    • /
    • 제53권5호
    • /
    • pp.1439-1446
    • /
    • 2016
  • The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.

위상복잡도 조절을 위한 설계 해상도 계층적 제어 기법 (Hierarchical design resolution control scheme for the systematic generation of optimal candidate designs having various topological complexities)

  • 서정훈;김윤영
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 추계학술대회
    • /
    • pp.1310-1315
    • /
    • 2003
  • In many practical engineering design problems, there are some design and manufacturing considerations that are difficult or infeasible to express in terms of an objective function or a constraint. In this situation, a set of optimal candidate designs having different topological complexities, not just a single optimal design, is preferred. To generate systematically such design candidates, we propose a hierarchical multiscale design resolution control scheme. In order to adjust its topological complexity by choosing a different starting resolution level in the hierarchical design space, we propose to employ a general M-band wavelet transform in transforming the original design space into the multiscale design space.

  • PDF

EFFICIENT LATTICE REDUCTION UPDATING AND DOWNDATING METHODS AND ANALYSIS

  • PARK, JAEHYUN;PARK, YUNJU
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제19권2호
    • /
    • pp.171-188
    • /
    • 2015
  • In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

Reconfigurable FIR Filter for Dynamic Variation of Filter Order and Filter Coefficients

  • Meher, Pramod Kumar;Park, Sang Yoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제16권3호
    • /
    • pp.261-273
    • /
    • 2016
  • Reconfigurable finite impulse response (FIR) filters whose filter coefficients and filter order change dynamically during run-time play an important role in the software defined radio (SDR) systems, multi-channel filters, and digital up/down converters. However, there are not many reports on such reconfigurable designs which can support dynamic variation of filter order and filter coefficients. The purpose of this paper is to provide an architectural solution for the FIR filters to support run-time variation of the filter order and filter coefficients. First, two straightforward designs, namely, (i) single-MAC based design and (ii) full-parallel design are presented. For large variation of the filter order, two designs based on (iii) folded structure and (iv) fast FIR algorithm are presented. Finally, we propose (v) high throughput design which provides significant advantage in terms of hardware and/or time complexities over the other designs. We compare complexities of all the five structures, and provide the synthesis results for verification.

Boy Power: Soft Power and Political Power in the Circulation of Boys Love (BL) Narratives from South Korea, Thailand, and the Philippines

  • Miguel Antonio N. Lizada
    • 수완나부미
    • /
    • 제16권1호
    • /
    • pp.81-101
    • /
    • 2024
  • This paper examines the complexities and creative opportunities brought about by the transnational circulation of texts specifically in the areas of transmission, consumption, and adaptation. The circulation of texts and along with it creative elements such as generic forms, tropes, and frameworks for consumption form an integral part in the production and advancement of any form of popular culture. In the process of such circulation, adaptation becomes a form of social and political process necessary for domestic palatability. In this paper, I examine how these complexities can be illustrated in the circulation of one emerging popular form in East and Southeast Asia: Boys Love (BL) television and web series. Using the transnational movement of the BL genre from South Korea, Thailand, and the Philippines, I examine how the circulation and adaptations are inflected by considerations related to regional geopolitics and domestic issues concerned with the creative praxis of representing gender and sexuality.

A Fuzzy logic-based Model in Image Processing

  • Moghani, Ali
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 한국정보디스플레이학회 2008년도 International Meeting on Information Display
    • /
    • pp.943-946
    • /
    • 2008
  • Many works have been done to enable computer, as brain of robot, to learn color categorization, most of them rely on modeling of human color perception and mathematical complexities. This paper aims at developing the innate ability of the computer to learn the human-like color categorization.

  • PDF

Parallel Prefix Computation and Sorting on a Recursive Dual-Net

  • Li, Yamin;Peng, Shietung;Chu, Wanming
    • Journal of Information Processing Systems
    • /
    • 제7권2호
    • /
    • pp.271-286
    • /
    • 2011
  • In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

A review of the state-of-the-art in aerodynamic performance of horizontal axis wind turbine

  • Luhur, Muhammad Ramzan;Manganhar, Abdul Latif;Solangi, K.H.;Jakhrani, Abdul Qayoom;Mukwana, Kishan Chand;Samo, Saleem Raza
    • Wind and Structures
    • /
    • 제22권1호
    • /
    • pp.1-16
    • /
    • 2016
  • The paper presents the state-of-the-art in aerodynamic performance of the modern horizontal axis wind turbine. The study examines the different complexities involved with wind turbine blade aerodynamic performance in open atmosphere and turbine wakes, and highlights the issues which require further investigations. Additionally, the latest concept of smart blades and frequently used wind turbine design analysis tools have also been discussed. The investigation made through this literature survey shows significant progress towards wind turbine aerodynamic performance improvements in general. However, still there are several parameters whose behavior and specific role in regulating the performance of the blades is yet to be elucidated clearly; in particular, the wind turbulence, rotational effects, coupled effect of turbulence and rotation, extreme wind events, formation and life time of the wakes.