• Title/Summary/Keyword: 쌍대

Search Result 231, Processing Time 0.029 seconds

An Alternative Method for Assessing Local Spatial Association Among Inter-paired Location Events: Vector Spatial Autocorrelation in Housing Transactions (쌍대위치 이벤트들의 국지적 공간적 연관성을 평가하기 위한 방법론적 연구: 주택거래의 벡터 공간적 자기상관)

  • Lee, Gun-Hak
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.11 no.4
    • /
    • pp.564-579
    • /
    • 2008
  • It is often challenging to evaluate local spatial association among onedimensional vectors generally representing paired-location events where two points are physically or functionally connected. This is largely because of complex process of such geographic phenomena itself and partially representational complexity. This paper addresses an alternative way to identify spatially autocorrelated paired-location events (or vectors) at a local scale. In doing so, we propose a statistical algorithm combining univariate point pattern analysis for evaluating local clustering of origin-points and similarity measure of corresponding vectors. For practical use of the suggested method, we present an empirical application using transactions data in a local housing market, particularly recorded from 2004 to 2006 in Franklin County, Ohio in the United States. As a result, several locally characterized similar transactions are identified among a set of vectors showing various local moves associated with communities defined.

  • PDF

For new Duality Structure and its Application in the NCV-|v1 > Library (NCV-|v1 >라이브러리의 새로운 쌍대 구조와 응용)

  • Park, Dong-Young;Jeong, Yeon-Man
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.2
    • /
    • pp.165-170
    • /
    • 2016
  • The characteristic and application of a new duality structure in the $NCV-{\mid}v_1$ > library is studied in this paper. All unitary operations on arbitrarily many qudit's n can be expressed as composition of one- and two-qudit $NCV-{\mid}v_1$ > libraries if their state vectors are eigenvectors. This research provides an extended realization from Barenco's many bits n operator(U(2n)) which is applicable to only all positive polarity statevectors to whole polarity ones. At the control gate synthesis of a unitary operator, such an enhanced expansion is possible due to their symmetric duality property in the case of using both $NCV-{\mid}v_1$ > and $NCV^{\dag}-{\mid}v_1$ > libraries which make the AND predominantly dependent cascade synthesis possible.

Design of Block Complete Diallel Crosses using Dual Design of Blanced Incomplet Block Design (균형된 불완비 블록계획의 쌍대계획을 이용한 완전이면교배의 블록화)

  • Kim, Jin;Bae, Jong-Sung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.11 no.2
    • /
    • pp.247-255
    • /
    • 2000
  • Usually, partailly balanced incomplete block design have been used a parametric design that make blocks of complete diallel cross. For that we use triangular PBIBD as parametric design, we have to find triangular PBIBD with corresponding parameters. Using the theorem that dual design of balanced incomplete block design with special parameters becomes triangular PBIBD, we can design block complete diallel cross without finding new triangular PBIBD. In this paper, we provided the plan and design satisfying such block complete diallel crosses.

  • PDF

Resource Allocation for Multiuser OFDM Systems (다중사용자 OFDM 광대역 무선인터넷 시스템의 자원할당 방법)

  • Jeong Yong-Ju;Baek Cheon-Hyeon;Kim Hu-Gon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1647-1655
    • /
    • 2006
  • 본 연구는 무선 및 사용자요구사항 등 환경의 변화에 따라 부반송파(subcarrier) 할당, 변조방식 및 전력량을 조절하는 적응형 다중사용자 OFDM 시스템을 다룬다. 먼저 사용자별 전송요구 비트수 및 전체 사용가능한 전력량에 대한 제약 조건하에서 총 데이터 전송량(Throughput)을 최대화하는 최적화 문제를 모형화한다. 이 문제는 대부분의 기존 연구들을 포함할 수 있을 정도로 포괄적이지만 미분이 불가능한 비선형 최적화 문제이면서도 빠른 계산시간을 요구한다. 본 연구는 쌍대간격(Duality Gap)이 0이라는 제안 문제의 특성을 바탕으로 하여 Subgradient 쌍대최적화(Dual Optimization) 기법을 적용한다. 또한 이러한 접근법은 사용자 또는 무선환경의 변화에 적극적으로 적응하는 무선자원 할당 메커니즘을 제시한다.

  • PDF

On Estimation of Weights for Elementary Mathematics Achievement Factors by Using AHP (AHP를 이용한 대학수학 성취도 요인의 중요도 추정)

  • Ham, Hyung-Bum
    • Journal for History of Mathematics
    • /
    • v.20 no.3
    • /
    • pp.91-104
    • /
    • 2007
  • In this paper we study the method to estimate weights of the elementary mathematics achievement factors to get reference index which improves elementary mathematics teaching. For it, we discuss not only a synopsis of AHP but also write out pairwise comparison matrix through statistical survey and estimate weights by eigenvector method.

  • PDF

Identification of Critical Source Areas on Water Quality in a Rural Watershed (하천수질자료를 이용한 농촌하천유역 오염원의 규명)

  • Hong, Seong;Kwun, Soon Kuk
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.43 no.5
    • /
    • pp.145-152
    • /
    • 2001
  • 농촌유역하천에서 수집된 수질측정자료를 이용하여 주요 오염원을 규명하였다. 분석에 이용된 수질항목은 BOD, COD. EC, pH. TN, TP,$NO_3-N,PO_4-P$ 등으로서 하천 본류내 구간별로 쌍대비교를 통해서 항목별 차이에 대한 유의성 검정을 하였다. 유의성 검정에 이용된 방법은 쌍대비교를 위한 비모수검정법인 Wilcoxon 순위검정법을 이용하였다. 검정결과, 유기성 오염물질의 지표로 이용되는 BOD와 COD가 상승하는 구간은 주로 생활하수가 유입되는 구간으로 나타났다. 인구밀도가 매우 높으나 생활하수가 처리장으로 배제되는 지역의 하천구간에서는 이들 농도변화는 없었다. 유역 내 축산농가가 밀집되어 있는 지역의 하천구간에서도 농도의 변화 또한 존재하지 않았다. 본 연구에서 조사된 유역에서와 같이 축산분뇨를 퇴비화 및 농지환원하는 경우에는 하천수질에 거의 영향을 미치지 않는다는 것을 알 수 있었다. 따라서 농촌지역의 하천 수질을 개선하기 위해서는 생활하수에 대한 처리가 선행되어야 한다.

  • PDF

Primal-Interior Dual-Simplex Method and Dual-Interior Primal-Simplex Method In the General bounded Linear Programming (일반한계 선형계획법에서의 원내부점-쌍대단체법과 쌍대내부점-원단체법)

  • 임성묵;김우제;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.1
    • /
    • pp.27-38
    • /
    • 1999
  • In this paper, Primal-Interior Dual-Simplex method(PIDS) and Dual-Interior Primal-Simplex method(DIPS) are developed for the general bounded linear programming. Two methods were implemented and compared with other pricing techniques for the Netlib. linear programming problems. For the PIDS, it shows superior performance to both most nagative rule and dual steepest-edge method since it practically reduces degenerate iterations and has property to reduce the problem. For the DIPS, pt requires less iterations and computational time than least reduced cost method. but it shows inferior performance to the dynamic primal steepest-edge method.

  • PDF

Dynamic Task Assignment Using A Quasi-Dual Graph Model (의사 쌍대 그래프 모델을 이용한 동적 태스크 할당 방법)

  • 김덕수;박용진
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.6
    • /
    • pp.62-68
    • /
    • 1983
  • We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.

  • PDF