• Title/Summary/Keyword: Max

Search Result 6,344, Processing Time 0.036 seconds

A Parallel Algorithm for Merging Relaxed Min-Max Heaps (Relaxed min-max 힙을 병합하는 병렬 알고리즘)

  • Min, Yong-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.5
    • /
    • pp.1162-1171
    • /
    • 1998
  • This paper presents a data structure that implements a mergable double-ended priority queue : namely an improved relaxed min-max-pair heap. By means of this new data structure, we suggest a parallel algorithm to merge priority queues organized in two relaxed heaps of different sizes, n and k, respectively. This new data-structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [9]. As a result, employing max($2^{i-1}$,[(m+1/4)]) processors, this algorithm requires O(log(log(n/k))${\times}$log(n)) time. Also, on the MarPar machine, this method achieves a 35.205-fold speedup with 64 processors to merge 8 million data items which consist of two relaxed min-max heaps of different sizes.

  • PDF

Prediction of VO2max Using Submaximal PACER in Obese Middle School Boys (최대하 PACER 검사를 통한 비만 남자 중학생의 VO2max 추정)

  • Kim, Do-Youn;Kim, Won-Hyun
    • Journal of Digital Convergence
    • /
    • v.11 no.3
    • /
    • pp.371-380
    • /
    • 2013
  • The purpose of this study was to develop the equation of $\dot{V}O_{2max}$ by $sub_{max}imal$ PACER method for obese middle school boys. For this, $_{max}$imal test using Bruce protocol in lab was performed and then PACER $_{max}imal$ test with portable $\dot{V}O_{2max}$ equipment. To decide the level of submaximal test, during PACER with portable equipment, we found the section in which target hreat rate(over 75%$HR_{max}$) and then per section(75%,80%,85%,90%,95%) metabolic responses were recorded, with which we analyzed multiple regression by stepwise method. Model 1(at 90%$HR_{max}$): $\dot{V}O_{2max}$(ml/kg/min) = 142.721-0.275(repetition)-0.48(HR)+0.177(weight)-1.536(age)[%error 3.90ml/kg/min; performance until 2 stage(13 repetition)]. Model 2(at 95%$HR_{max}$): $\dot{V}O_{2max}$(ml/kg/min) = 182.851-0.103(repetition)-0.744(HR)+0.186(weight)-0.324(age)[%error 4.51ml/kg/min; performance until 3 stage(25 repetitions)]. estimated $\dot{V}O_{2max}$ from Model 1 was different about $3.25{\pm}6.32ml/kg/min$(%error=6.84%), otherwise model 2 was $3.16{\pm}4.54ml/kg/min$(%error=5.75%). considering %HRmax, as the submaximal test model 1 might be fit more than model 2 for obese middle school boys.

A study on WiMAX Backhaul in Mobile Communication Network (이동통신 네트워크에서 WiMAX Backhaul에 관한 연구)

  • Park, Chun-Kwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.59-64
    • /
    • 2014
  • This paper address the scheme for WiMAX backhaul in mobile communication network. These days most ISPs has implemented Wi-Fi backhaul using T1/E1 and DSL. if WiMAX is installed as the alternative to the mobile backhaul, it can decrease the costs drastically for the installation and operations. And it will be one of the best cost-effective solutions to cover the service areas which has not the wired communication infrastructure. WiMAX can be used for Base station, Subscriber Station, and Relay. In this paper, the performance is measured for downstream and upstream using NAT and port forwarding functions by configuring WiMAX server and WiMAX SS.

Combine Harvest Scheduling Program for Rough Rice using Max-coverage Algorithm

  • Lee, Hyo-Jai;Kim, Oui-Woung;Kim, Hoon;Han, Jae-Woong
    • Journal of Biosystems Engineering
    • /
    • v.38 no.1
    • /
    • pp.18-24
    • /
    • 2013
  • Purpose: This study was conducted to develop an optimal combine scheduling program using Max-Coverage algorithm which derives the maximum efficiency for a specific location in harvest seasons. Methods: The combine scheduling program was operated with information about combine specification and farmland. Four operating types (Max-Coverage algorithm type, Boustrophedon path type, max quality value type, and max area type) were selected to compare quality and working capacity. Result: The working time of Max-Coverage algorithm type was shorter than others, and the total quality value of Max-Coverage algorithm and max quality value type were higher than others. Conclusion: The developed combine scheduling program using Max-Coverage algorithm will provide optimal operation and maximum quality in a limited area and time.

Merging Algorithm for Relaxed Min-Max Heaps Relaxed min-max 힙에 대한 병합 알고리즙

  • Min, Yong-Sik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.1E
    • /
    • pp.73-82
    • /
    • 1995
  • This paper presents a data structure that implements a mergeable double-ended priority queue ; namely, an improved relaxed min-max-pair heap. It suggests a sequential algorithm to merge priority queues organized in two relaxed min-max heaps : kheap and nheap of sizes k and n, respecrively. This new data sturuture eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [8]. As a result, the suggested method in this paper requires the time complexity of O(log(log(n/k))*log(k)) and the space complexity of O(n+), assuming that $k{\leq}{\lfloor}log(size(nheap)){\rfloor}$ are in two heaps of different sizes.

  • PDF

MAX-INJECTIVE, MAX-FLAT MODULES AND MAX-COHERENT RINGS

  • Xiang, Yueming
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.3
    • /
    • pp.611-622
    • /
    • 2010
  • A ring R is called left max-coherent provided that every maximal left ideal is finitely presented. $\mathfrak{M}\mathfrak{I}$ (resp. $\mathfrak{M}\mathfrak{F}$) denotes the class of all max-injective left R-modules (resp. all max-flat right R-modules). We prove, in this article, that over a left max-coherent ring every right R-module has an $\mathfrak{M}\mathfrak{F}$-preenvelope, and every left R-module has an $\mathfrak{M}\mathfrak{I}$-cover. Furthermore, it is shown that a ring R is left max-injective if and only if any left R-module has an epic $\mathfrak{M}\mathfrak{I}$-cover if and only if any right R-module has a monic $\mathfrak{M}\mathfrak{F}$-preenvelope. We also give several equivalent characterizations of MI-injectivity and MI-flatness. Finally, $\mathfrak{M}\mathfrak{I}$-dimensions of modules and rings are studied in terms of max-injective modules with the left derived functors of Hom.

Adjacent Interference Analysis between M-WiMAX OFDMA/TDD and WCDMA FDD System in the 2.6 GHz Band Part II : Adjacent Interference Analysis with Smart Antenna in M-WiMAX System (2.6 GHz 대역에서 M-WiMAX OFDMA/TDD 시스템과 WCDMA FDD 시스템간의 상호 간섭 분석 Part II : Adjacent Interference Analysis with Smart Antenna in M-WiMAX System)

  • Wang, Yu-Peng;Ko, Sang-Jun;Chang, Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.588-599
    • /
    • 2007
  • This paper presents the coexistence issues between M-WiMAX TDD and WCDMA FDD systems. To improve the M-WiMAX system performance and to reduce the adjacent channel interference to WCDMA FDD system, transmit and receive beamforming techniques are applied in the base stations of M-WiMAX system. Furthermore, we propose an adjacent channel interference modeling methodology, which captures the effect of transmit beamforming on the adjacent channel interference. Besides, we verify the performance improvement in the uplink of WCDMA system due to the transmit beamforming in M-WiMAX downlink based on the proposed adjacent channel interference modeling methodology. We also verify the performance enhancement due to the receive beamforming in the uplink of M-WiMAX system through system level Monte Carlo simulations, considering random user position, the effect of shadowing and multi-path fading channel. Discussions on the gain of applying transmit and receive beamforming in M-WiMAX system comparing the case of SISO system are also included. Furthermore, we present the performance of cosited M-WiMAX and WCDMA systems, considering commercial deployment, additional channel filter at base stations and the effects of TxBF and RxBF.

Mobile WiMAX 인증시험 개요 및 절차

  • Choe, Du-Jeong;Kim, Seon-Jong;Kim, Young-Hwa
    • TTA Journal
    • /
    • s.111
    • /
    • pp.117-124
    • /
    • 2007
  • WiMAX 포럼은 WiMAX 기술이 적용된 단말기 및 기지국 간의 상호운용성을 확보하기 위해 WiMAX 포럼 공인 적합성 시험 및 상호운용성 시험을 통과한 제품만이 시장에 출시된 수 있도록 권고하고 있다. TTA는 WiMAX 포럼 국제공인 인증시험소로 지정되어 적합성 시험과 상호운용성 시험을 제공할 수 있는 인증시험소를 구축 중에 있으며, 국제 WiMAX 포럼 활동을 통해 최신 인증시험 동향을 파악하고 있다. 이에 본 고에서는 WiMAX 인증시험 개요 및 최신 동향과 TTA 공인인증시험소 구축 현황을 소개하고자 한다.

  • PDF

Mobile WiMAX 인증시험 개요 및 동향

  • Choe, Du-Jeong;Choe, Sang-Ho;Jeong, In-Myeong
    • TTA Journal
    • /
    • s.104
    • /
    • pp.129-136
    • /
    • 2006
  • TTA는 지난 2월 21일, 프랑스 파리에서 개최된 WiMAX 이사회 회의에서 WiMAX 포럼 공인시험소 자격을 획득하였다. 이런 결과를 바탕으로 TTA는 2006년 9월 Mobile WiMAX 시험장비 도입을 시작으로 시험장비 검증과 모의 인증시험을 거쳐 12월부터 Mobile WiMAX 제품에 대한 WiMAX 포럼 공인 인증시험을 실시할 계획이다. 이에 본 고를 통해 현재 진행 중인 Mobile WiMAX 인증시험 개요 및 동향을 소개하고 자 한다. 1) IEEE802.16-2004 : IEEE Standard for Local and Metropolitan Area Networks-Part16: Air Interface for Fixed Wireless Access Systems

  • PDF