http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이선우,이옥화,김준철,명평근,박창식,우선희 충남대학교 형질전환복제돼지연구센터 2007 논문집 Vol. No.10
Although mammalian sperms are cryopreserved for in vitro fertilization a process of cryopreservation decreases the fertility. Acrosome reaction requires depolarization-induced ca^(2+) influx and ca^(2+) releases from the ca^(2+) stores. To examine whether the cellular ca^(2+) mobilization is altered by a sperm cryopreservation we compared cytosolic ca^(2+) signals between fresh and cryopreserved pig sperms using confocal ca^(2+) imaging. The magnitudes of depolarization-induced ca^(2+) increases were significantly smaller in cryopreserved sperms. Exposures to 10 mM caffeine or 5 μM thapsigargin elicited less ca^(2+) increases in the cryopreserved sperms compared to fresh sperms. In addition, progesterone-triggered ca^(2+) rises, that are thought to enhance acrosome reaction, were completely abolished in the cryopreserved sperms. These results suggest that storage and(/or) release of ca^(2+) from the intracellular ca^(2+) stores in pig sperms are significantly impaired by the process of cryopreservation.
선우 명훈(Sunwoo Myung Hoon) 한국정보과학회 1994 정보과학회논문지 Vol.21 No.12
일반적으로 다중프로세서에서 프로세서들간의 데이타 공유를 위하여 두가지 방식이 주로 쓰이는데 이는 메시지 전달 방식 및 공유 기억소자 방식이다. 그러나 전자는 통신부담이 결점이며 후자는 공유기억소자 분쟁의 단점이 있다. 또한 비효율적인 데이타 입출력 구조도 성능향상에 있어 제한사항이다. 본 논문에서는 위의 단점들을 경감시킬 수 있는 유동적인 연결구조를 갖는 새로운 다중프로세서 (Flexibly Coupled Multiprocessors)를 제안한다. 이 다중프로세서의 구현을 위하여 가변길이 기억소자 (Variable Address Space Memory)를 제안하는데 이는 이웃한 기억소자 모듈들이 필요에 따라 재분할이 가능한 버스구조에 의하여 하나의 기억소자 모듈이 될 수 있다. 따라서 이 가변길이 기억소자 모듈들은 공유 기억소자 또는 비공유 기억소자로 사용된다. 제안하는 다중프로세서의 정량적 모델을 정립, 분석하였고, 상용의 하이퍼큐브 구조 다중프로세서인 Inter's Personal SuperComputer (iPSC)를 이용하여 시뮬레이션 하였다. 성능평가를 위하여 병렬처리 알고리즘들을 개발하여 실지로 iPSC상에서 구현하였으며 제안하는 다중프로세서의 정량적 모델을 이용, 시뮬레이션을 통한 비교 분석을 수행하였다. 실험결과 제안하는 다중프로세서가 iPSC보다 성능에서 월등함을 입증하였다. Two hardware mechanisms are mainly used for data sharing among processors in existing multiprocessors: message passing in loosely coupled multiprocessors and shared memory in tightly coupled multiprocessors. The former has communication overhead and the latter has shared memory contention. Moreover, inefficient data input and output (I/O) schemes are also limitations on performance. This paper proposes a new architecture, called the Flexibly (Tightly/Loosely) Coupled Multiprocessors (FCM), to alleviate these disadvantages. A variable address space memory scheme, in which a set of adjacent memory modules can be merged by a dynamically partitionable bus, is proposed to realize FCM. Computational models of FCM are established, quantitatively analyzed and simulated on the iPSC (Intel's Personal SuperComputer), a hypercube multiprocessor. Parallel algorithms for region labeling and median filtering are implemented on the iPSC and simulated on FCM. The performance of FCM shows remarkable improvement over that of the iPSC.
A New OFDM Transmission Scheme Using DFT Code Multiplexing
SeongKeunOh,KiSeubLee,Myung Hoon Sunwoo 에스케이텔레콤 (주) 2002 Telecommunications Review Vol.12 No.4
We propose a new orthogonal frequency division multiplexing transmission scheme using orthogonal code multiplexing. This scheme makes all modulation symbols have the same reliability even in a frequency selective fading channel, through a distributed transmission of each symbol over the whole effective subcarriers using a distinct orthogonal code. As an appropriate set of orthogonal multiplexing codes, we use the set of discrete Fourier transform code sequences that hold the orthogonality irrespective of the length. Using this set, we also can greatly reduce the peak-to-average-power ratio (PAR) of the resulting signal. Simulation results show that the proposed scheme can significantly reduce the required signal-to-noise ratio at a given bit error rate over the existing schemes. The scheme can maintain the PAR within a reasonable range of about 6dB even up to 512 subcarriers and works well even with PAR clipping of 1.5dB.
New Frame Rate Up-Conversion Algorithms With Low Computational Complexity
Un Seob Kim,Myung Hoon Sunwoo IEEE 2014 IEEE transactions on circuits and systems for vide Vol.24 No.3
<P>This paper proposes a new frame rate up-conversion (FRUC) algorithm to reduce the computational complexity and to improve the peak signal-to-noise ratio (PSNR) performance. The proposed FRUC algorithm includes prediction-based motion vector smoothing (PMOS), partial average-based motion compensation (PAMC), and intrapredicted hole interpolation (IPHI). PMVS can efficiently remove outliers using motion vectors of neighboring blocks and PAMC performs motion compensation with the region-based partial average to reduce blocking artifacts of the interpolated frames. For hole interpolation, IPHI uses intraprediction of H.264/AVC to eliminate blurring and also uses the fixed weights implemented using only shift operations, which result in low computational complexity. Compared to the existing algorithms, which use bilateral motion estimation, the proposed algorithm improves the average PSNR of the interpolated frames by 3.44 dB and lowers PSNR performance only by 0.13 dB than the existing algorithm that employs unilateral ME; however, it can significantly reduce the computational complexity of FRUC about 89.3% based on the absolute difference.</P>
MESIP: A Configurable and Data Reusable Motion Estimation Specific Instruction-Set Processor
Sung Dae Kim,Myung Hoon Sunwoo IEEE 2013 IEEE Transactions on Circuits and Systems for Vide Vol.23 No.10
<P>This paper proposes a new motion estimation (ME)-specific instruction-set processor (MESIP) with a novel search scan order with high data reusability, to efficiently implement various advanced ME algorithms. The proposed ME-specific instructions can be selectively used for ME algorithms. The novel data-reusing search scan order, called center biased search scan (CBSS), exploits the symmetry of the search pattern to reduce redundant data loading on MESIP by about 26.9% and 16.1% compared with raster scan and snake scan, respectively. MESIP has been implemented with IBM's 90-nm CMOS technology and has 203 K gates excluding memory. Simulation results show that the proposed MESIP can reduce the number of required instructions by up to 18.9% compared with existing ME processors. Moreover, MESIP achieves comparable performance even with ME ASICs and hence may be quite suitable for a low-power and high-performance ME implementation.</P>