http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
라잉트라이셉스익스텐션 운동후 벤치프레스 운동시 대흉근, 상완삼두근의 근전도반응과 근력발현
조기형(Cho Ki-Hyung) 한국체육과학회 2008 한국체육과학회지 Vol.17 No.3
The purpose of this study was bench press of pectoralis major and triceps brachii on EMG response and Strength Activation after lying triceps extension. All subjects were tested for their one repetition maximum(RM) strength on the supine bench press. Surface electrodes were attached on the belly of the pectoralis major and the bellies of the triceps brachii; long, medial, and lateral head. Normalized iEMG and MEF were collected and compared to three sites on the triceps brachii and measured iEMG and MEF according to the intensity resistance training loading method. First, the iEMG of the lateral head of the triceps brachii showed bench press 10RM after lying triceps 50% 5RM and was higher than bench press 10RM after lying triceps 5RM(p<.05). Second, the 10RM practice number during the bench press 10RM after triceps brachii single joint all-out pre exercise on exercise load method showed bench press 10RM without pre exercise > bench press 10RM after lying triceps 5RM > bench press 10RM after lying triceps 50% 5RM(p<.05, p<.001). When the muscle fatigue(MEF) of pectoralis major was high, the muscle activity(iEMG) of triceps brachii became high.
RDBMS와 IRS를 이용한 XML 저장관리 시스템 설계 및 구현
강형일(Hyung Il Kang),최영길(Young Gil Choi),이종설(Jong Sul Lee),유재수(Jae Soo Yoo),조기형(Ki Hyung Cho) 한국정보과학회 2001 정보과학회 컴퓨팅의 실제 논문지 Vol.7 No.1
본 논문에서는 관계형 데이타베이스인 오라클과 IRS중 하나인 BRS를 사용하여 XML저장관리 시스템을 설계 및 구현한다. XML저장관리 시스템의 내용 검색과 인덱스 추출을 위해 BRS 검색 시스템을 사용하였으며, XML 문서, 구조정보, DTD, 이미지 등을 저장하기 위해 오라클을 사용하였다. 본 논문에서 구현한 저장관리 시스템은 질의 처리기, 검색결과생성기, XML 객체관리자, XML 인덱스 관리자, 구조검색엔진 등으로 구성된다. 구현된 XML 저장관리 시스템은 XML 문서에 대한 내용검색뿐만 아니라 구조적 특징 또는 애트리뷰트에 기반한 검색을 효율적으로 제공한다. 구현한 저장관리 시스템은 문서 저장시간, 문서 추출 시간, 내용 검색 시간 등에 대해서 분할 모델 저장관리 시스템과 비교한다. In this paper, we design and implement a XML repository system using RDBMS (ORACLE) and IRS(BRS). Our scheme uses BRS to support full text indexing and content-based queries efficiently, and ORACLE to store XML documents, multimedia data, DTD and structure information. In addition, a XML repository system consists of a query processor, a retrieval result generator, a XML object manager, a XML index manager, and a structure retrieval engine. The implemented XML repository system efficiently supports retrieval based on structure and attribute retrieval as well as content-based retrieval. We compare our repository system with decomposition model repository system in terms of document storing time, document extracting time, contents retrieval time.
이재욱,조기형 ( Jae Oek Lee,Ki Hyung Cho ) 충북대학교 산업과학기술연구소 1994 산업과학기술연구 논문집 Vol.8 No.2
Abstract_Roman In view of overall network performance, it is very difficult and complex job to eeiablish the si- mulation model of a whole high-speed network, because for every virtual calls the funetion of each nodes in a high-speed network is determine
강덕하,허윤석,조기형,이대영,Kang Duk-Ha,Heo Yoon-Seok,Cho Ki-Hyung,Lee Dae-Young 한국정보기술전략혁신학회 2003 情報學硏究 Vol.6 No.2
This paper is about power line communication(PLC) over the low power voltage grid. The main advantage with power line communication is the use of an existing infrastructure. The PLC channel can be modeled as having multi-path propagation with frequency-selective fading, typical power lines exhibit signal attenuation increasing with length and frequency. OFDM(Orthogonal Frequency Division Multiplexing) is a modulation technique where multiple low data rate carriers are combined by a transmitter to form a composite high data rate transmission. To implement the multiple carrier scheme using a bank of parallel modulators would not be very efficient in analog hardware. Each carrier in an OFDM is a sinusoid with a frequency that is an integer multiple of a base or fundamental sinusoid frequency. Therefore, each carrier is a like a Fourier series component of the composite signal. In fact, it will be shown later that an OFDM signal is created in the frequency domain, and then transformed into the time domain via the Discrete Fourier Transform(DFT).
강덕하,허윤석,조기형,이대영,Kand Duk-Ha,Heo Yoon-Seok,Cho Ki-Hyung,Lee Dae-Young 한국정보기술전략혁신학회 2002 情報學硏究 Vol.5 No.4
This thesis is about power line communication(PLC) over the low voltage grid. The main advantage with power line communication is the use of an existing infrastructure. The PLC channel can be modeled as having multi-path propagation with frequency-selective fading, typical power lines exhibit signal attenuation increasing with length and frequency. OFDM(Orthogonal Frequency Division Multiplexing) is a modulation technique where multiple low data rate carriers are combined by a transmitter to form a composite high data rate transmission. To implement the multiple carrier scheme using a bank of parallel modulators would not be very efficient in analog hardware. Each carrier in an OFDM is a sinusoid with a frequency that is an integer multiple of a base or fundamental sinusoid frequency. Therefore, each carrier is a like a Fourier series component of the composite signal. In fact, it will be shown later that an OFDM signal is created in the frequency domain, and then transformed into the time domain via the Discrete Fourier Transform(DFT).
복경수,이석희,조기형,유재수,Bok, Kyoung-Soo,Lee, Seok-Hee,Cho, Ki-Hyung,Yoo, Jae-Soo 한국정보처리학회 2000 정보처리논문지 Vol.7 No.8
다차원 색인 구조를 위한 기존의 벌크 로딩 알고리즘은 색인 구성 시간과 검색 성능 모두를 향상시키지 못하는 문제점을 갖는다. 이 논문은 이와 같은 문제점을 해결한 대량의 고차원 데이터에 대한 색인 구조를 위한 새로운 벌크 로딩 알고리즘을 제안한다. 제안한는 알고리즘은 색인을 구성하는 시간을 단축시키기 위해 전체 데이터 집합을 정렬하는 것이 아니라 데이터의 특성을 파악하여 피벗 값에 따라 분할하는 기법을 이용한다. 또한 검색 성능을 향상시키기 위해 데이터들의 분포 특성에 따라 분할 위치를 선택한다. 실험을 통해 제안하는 알고리즘의 기존의 알고리즘보다 색인 구성 시간과 검색 성능 측면에서 우수함을 보인다. Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.
복경수,윤호원,김명호,조기형,유재수,Bok Kyoung-Soo,Yoon Ho-Won,Kim Myoung-Ho,Cho Ki-Hyung,Yoo Jae-Soo 한국정보처리학회 2006 정보처리학회논문지D Vol.13 No.4
기존에 제안된 색인 구조는 연속적 이동 객체를 갱신하기 위해 이동 객체의 기존 위치를 삭제하고 새로운 위치를 삽입하는 과정을 반복하기 때문에 많은 갱신 비용을 소요한다. 본 논문에서는 연속적 이동 객체의 갱신 비용을 감소시키기 위한 새로운 색인 구조를 제안한다. 제안하는 색인 구조는 이동 객체의 위치를 저장한 공간 분할 방식의 색인 구조와 이동 객체의 위치를 직접 접근하기 위한 보조 색인 구조로 구성된다. 노드의 팬아웃을 증가시키기 위해 자식 노드에 대한 정보는 실제 분할 영역을 저장하는 것이 아니라 kd-tree로 저장한다. 또한, 이동 객체의 위치 갱신을 빠르게 처리하기 위해 색인 구조 전체를 순회하지 않고 단말 노드를 직접 접근하여 상향식으로 갱신을 수행한다. 제안하는 색인 구조의 우수성을 입증하기 위해 다양한 분포 특성에 따라 이동 객체를 생성하고 이동 객체에 대한 삽입, 갱신, 검색 성능을 비교 분석한다. Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.