3D imaging systems using 2D phased arrays have a large number of active channels, compelling to use a very expensive and bulky beamforming hardware, and suffer from low volume rate because, in principle, at least one ultrasound transmit-receive event is necessary to construct each scanline. A high speed 3D imaging method using a cross array proposed previously to solve the above limitations can implement fast scanning and dynamic focusing in the lateral direction but suffer from low resolution except at the fixed transmit focusing along the elevational direction. To overcome these limitations, we propose a new real-time volumetric imaging method using a cross array based on the synthetic aperture technique. In the proposed method, ultrasound wave is transmitted successively using each elements of an 1D transmit array transducer, one at a time, which is placed along the elevational direction and for each firing, the returning pulse echoes are received using all elements of an 1D receive array transducer placed along the lateral direction. On receive, by employing the conventional dynamic focusing and synthetic aperture method along lateral and elevational directions, respectively, ultrasound waves can be focused effectively at all imaging points. In addition, in the proposed method, a volume of interest consisting of any required number of slice images, can be constructed with the same number of transmit-receive steps as the total number of transmit array elements. Computer simulation results show that the proposed method can provide the same and greatly improved resolutions in the lateral and elevational directions, respectively, compared with the 3D imaging method using a cross array based on the conventional fixed focusing. In the accompanying paper, we will also propose a new real-time 3D imaging method using a cross array for improving transmit power and elevational spatial resolution, which uses linear wave fronts on transmit.
Kim, Sung-Jae;Kim, Hae-Min;Choi, Hoon;Kim, Young-Jun
Journal of Life Science
/
v.21
no.7
/
pp.1032-1038
/
2011
Recently identified Ciona intestinalis voltage sensor-containing phosphatase (Ci-VSP) consists of an ion channel-like transmembrane domain (VSD) and a phosphatase-like domain. Ci-VSP senses the change of membrane potential by its VSD and works as a phosphoinositide phosphatase by its phosphatase domain. In this study, we present the construction of His-tagged phosphatase-like domain of Ci-VSP, its recombinant expression and purification, and its enzymatic activity behavior in order to examine the biochemical behavior of phosphatase domain of Ci-VSP without interference. We found that Ci-VSP(248-576)-His can be eluted with an elution buffer containing 25 mM NaCl and 100 mM imidazole during His-tag purification. In addition, we found the proper measurement condition for kinetics study of Ci-VSP(248-576)-His against p-nitrophenyl phosphate (pNPP). We measured the kinetic constant of Ci-VSP(248-576)-His at $37^{\circ}C$, pH 5.0 or 5.5, under 30 min of reaction time, and less than $2.0\;{\mu}g$ of protein amount. With these conditions, we acquired that Ci-VSP(248-576)-His has $K_m$ of $354{\pm}0.143\;{\mu}M$, $V_{max}$ of $0.0607{\pm}0.0137\;{\mu}mol$/min/mg and $k_{cat}$ of $0.359{\pm}0.009751\;min^{-1}$ for pNPP dephosphorylation. Therefore, we produced a pure form of Ci-VSP(248-576)-His, and this showed a higher activity against pNPP. This purified protein will provide the road to a structural investigation on an interesting protein, Ci-VSP.
The Journal of Korean Institute of Communications and Information Sciences
/
v.35
no.4A
/
pp.332-340
/
2010
In this paper, we deal with multi-user diversity scheduling methods that transmit simultaneously signals from multiple users using superposition coding multiplexing. These methods can make various scheduling methods be obtained, according to strategies for user selection priority from the first user to the first-following users, strategies for per-user power allocation, and resulting combining strategies. For the first user selection, we consider three strategies such as 1) higher priority for a user with a better channel state, 2) following the proportional fair scheduling (PFS) priority, 3) higher priority for a user with a lower average serving rate. For selection of the first-following users, we consider the identical strategies for the first user selection. However, in the second strategy, we can decide user priorities according to the original PFS ordering, or only once an additional user for power allocation according to the PFS criterion by considering a residual power and inter-user interference. In the strategies for power allocation, we consider two strategies as follows. In the first strategy, it allocates a power to provide a permissible per-user maximum rate. In the second strategy, it allocates a power to provide a required per-user minimum rate, and then it reallocates the residual power to respective users with a rate greater than the required minimum and less than the permissible maximum. We consider three directions for scheduling such as maximizing the sum rate, maximizing the fairness, and maximizing the sum rate while maintaining the PFS fairness. We select the max CIR, max-min fair, and PF scheduling methods as their corresponding reference methods [1 and references therein], and then we choose candidate scheduling methods which performances are similar to or better than those of the corresponding reference methods in terms of the sum rate or the fairness while being better than their corresponding performances in terms of the alternative metric (fairness or sum rate). Through computer simulations, we evaluate the sum rate and Jain’s fairness index (JFI) performances of various scheduling methods according to the number of users.
Currently, as a consequence of PACS (Picture Archiving Communication System) implementation many hospitals are replacing conventional film-type interpretations of diagnostic medical images with new digital-format interpretations that can also be saved, and retrieve However, the big limitation in PACS is considered to be the lack of mobility. The purpose of this study is to determine the optimal communication packet size. This was done by considering the terms occurred in the wireless communication. After encoding medical image using JPGE2000 image compression method, This method embodied auto-error correction technique preventing the loss of packets occurred during wireless communication. A PC class server, with capabilities to load, collect data, save images, and connect with other network, was installed. Image data were compressed using JPEG2000 algorithm which supports the capability of high energy density and compression ratio, to communicate through a wireless network. Image data were also transmitted in block units coeded by JPEG2000 to prevent the loss of the packets in a wireless network. When JPGE2000 image data were decoded in a PUA (Personal Digital Assistant), it was instantaneous for a MR (Magnetic Resonance) head image of 256${\times}$256 pixels, while it took approximately 5 seconds to decode a CR (Computed Radiography) chest image of 800${\times}$790 pixels. In the transmission of the image data using a CDMA 1X module (Code-Division Multiple Access 1st Generation), 256 byte/sec was considered a stable transmission rate, but packets were lost in the intervals at the transmission rate of 1Kbyte/sec. However, even with a transmission rate above 1 Kbyte/sec, packets were not lost in wireless LAN. Current PACS are not compatible with wireless networks. because it does not have an interface between wired and wireless. Thus, the mobile JPEG2000 image viewing system was developed in order to complement mobility-a limitation in PACS. Moreover, the weak-connections of the wireless network was enhanced by re-transmitting image data within a limitations The results of this study are expected to play an interface role between the current wired-networks PACS and the mobile devices.
The fiber Raman amplifier(FRA) is a distinctly advantageous technology. Due to its wider, flexible gain bandwidth, and intrinsically lower noise characteristics, FRA has become an indispensable technology of today. Various FRA modeling methods, with different levels of convergence speed and accuracy, have been proposed in order to gain valuable insights for the FRA dynamics and optimum design before real implementation. Still, all these approaches share the common platform of coupled ordinary differential equations(ODE) for the Raman equation set that must be solved along the long length of fiber propagation axis. The ODE platform has classically set the bar for achievable convergence speed, resulting exhaustive calculation efforts. In this work, we propose an alternative, highly efficient framework for FRA analysis. In treating the Raman gain as the perturbation factor in an adiabatic process, we achieved implementation of the algorithm by deriving a recursive relation for the integrals of power inside fiber with the effective length and by constructing a matrix formalism for the solution of the given FRA problem. Finally, by adiabatically turning on the Raman process in the fiber as increasing the order of iterations, the FRA solution can be obtained along the iteration axis for the whole length of fiber rather than along the fiber propagation axis, enabling faster convergence speed, at the equivalent accuracy achievable with the methods based on coupled ODEs. Performance comparison in all co-, counter-, bi-directionally pumped multi-channel FRA shows more than 102 times faster with the convergence speed of the Average power method at the same level of accuracy(relative deviation < 0.03dB).
Journal of the Institute of Electronics Engineers of Korea SP
/
v.41
no.2
/
pp.23-34
/
2004
Video camera can be a useful tool to capture images for use in colorimeter. However the RGB signals generated by different video camera are not equal for the same scene. The video camera for use in colorimeter is characterized based on the CIE standard colorimetric observer. One method of deriving a colorimetric characterization matrix between camera RGB output signals and CIE XYZ tristimulus values is least squares polynomial modeling. However it needs tedious experiments to obtain camera transfer matrix under various white balance point for the same camera. In this paper, a new method to obtain camera transfer matrix under different white balance by using 3${\times}$3 camera transfer matrix under a certain white balance point is proposed. According to the proposed method camera transfer matrix under any other white balance could be obtained by using colorimetric coordinates of phosphor derived from 3${\times}$3 linear transfer matrix under the certain white balance point. In experimental results, it is demonstrated that proposed method allow 3${\times}$3 linear transfer matrix under any other white balance having a reasonable degree of accuracy compared with the transfer matrix obtained by experiments.
The Journal of Korean Institute of Communications and Information Sciences
/
v.23
no.8
/
pp.2052-2063
/
1998
Various full-scale radio location systems have been developed since ground-based radio navigation systems appeared during World War II, and more recently global positioning systems (GPS) have been widely used as a representative location system. In addition, radio location systems based on cellular systems are intensively being studied as cellular services become more and more popular. However, these studies have been focused mainly on macrocellular systems of which based stations are mutually synchronized. There has been no study about systems of which based stations are asynchronous. In this paper, we proposed two radio location algorithms in microcellular CDMA systems of which base stations are asychronous. The one is to estimate the position of a personal station at the center of rectangular shaped area which approximates the realistic common area. The other, as a method based on road map, is to first find candidate positions, the centers of roads pseudo-range-distant from the base station which the personal station belongs to and then is to estimate the position by monitoring the pilot signal strengths of neighboring base stations. We compare these two algorithms with three wide-spread algorithms through computer simulations and investigate interference effect on measuring pseudo ranges. The proposed algorithms require no recursive calculations and yield smaller position error than the existing algorithms because of less affection of non-line-of-signt propagation in microcellular environments.
Choi, Man Kwon;Yun, Sung Wook;Yu, In Ho;Lee, Jong-Won;Lee, Si Young;Yoon, Yong Cheol
Journal of Bio-Environment Control
/
v.24
no.2
/
pp.85-92
/
2015
This study examined the settlement of a 1-2W type greenhouse using a timber pile, which was recently established on Gyehwa-do reclaimed land, in order to obtain base data for the construction of a greenhouse on reclaimed land. The results of this study are as follows. foundation and timber pile increased over time, irrespective of the interior and exterior of the upon investigation of the ground, it was confirmed that there was no soft rock stratum (bedrock), and that a sedimentary stratum existed under the fill deposit, which is estimated to have been reclaimed during the site renovation. It was also found that a weathered zone was located under the fill deposit and sedimentary stratum, and that the soil texture of the entire ground floor consisted of clay mixed with sand, silty clay, and granite gneiss, in that order, regardless of boreholes. In addition, the underground water level was 0.3m below ground, regardless of boreholes. Despite a slight difference, the settlement of the greenhouse or measurement sites (channels). With regard to the pillar inside the greenhouse, except in the case of CH-2, the data at a site located on the side wall of the greenhouse (wind barrier side) indicated vibrations of relatively larger amplitude. Moreover, the settlement showed a significant increase during a certain period, which was subsequently somewhat reversed. Based on these phenomena, it was verified that the settlement range of each site in the interior and exterior of the greenhouse was between 1.0 and 7.5mm at this time, except in the case of CH-1. The results of the regression analysis indicated good correlation, with the coefficient of determination by site ranging between 0.6362 and 0.9340. Furthermore, the coefficient of determination ranged between 0.6046 and 0.8822 on the exterior of the greenhouse, which is lower than inside the greenhouse, but still indicates significant correlation.
Kim, Min-Ji;Jahng, Geon-Ho;Lee, Hack-Young;Kim, Sun-Mi;Ryu, Chang-Woo;Shin, Won-Chul;Lee, Soo-Yeol
Investigative Magnetic Resonance Imaging
/
v.14
no.2
/
pp.103-114
/
2010
Purpose : To generate a Korean specific brain template, especially in patients with Alzheimer's disease (AD) by optimizing the voxel-based analysis. Materials and Methods : Three-dimensional T1-weighted images were obtained from 123 subjects who were 43 cognitively normal subjects and patients with 44 mild cognitive impairment (MCI) and 36 AD. The template and the corresponding aprior maps were created by using the matched pairs approach with considering differences of age, gender and differential diagnosis (DDX). We measured several characteristics in both our and the MNI templates, including in the ventricle size. Also, the fractions of gray matter and white matter voxels normalized by the total intracranial were evaluated. Results : The high resolution template and the corresponding aprior maps of gray matter, white matter (WM) and CSF were created with the voxel-size of $1{\times}1{\times}1\;mm$. Mean distance measures and the ventricle sizes differed between two templates. Our brain template had less gray matter and white matter areas than the MNI template. There were volume differences more in gray matter than in white matter. Conclusion : Gray matter and/or white matter integrity studies in populations of Korean elderly and patients with AD are needed to investigate with this template.
We performed the seismic field data processing using an open-source software (Madagascar) to verify if it is applicable to processing of field data, which has low signal-to-noise ratio and high uncertainties in velocities. The Madagascar, based on Python, is usually supposed to be better in the development of processing technologies due to its capabilities of multidimensional data analysis and reproducibility. However, this open-source software has not been widely used so far for field data processing because of complicated interfaces and data structure system. To verify the effectiveness of the Madagascar software on field data, we applied it to a typical seismic data processing flow including data loading, geometry build-up, F-K filter, predictive deconvolution, velocity analysis, normal moveout correction, stack, and migration. The field data for the test were acquired in Gunsan Basin, Yellow Sea using a streamer consisting of 480 channels and 4 arrays of air-guns. The results at all processing step are compared with those processed with Landmark's ProMAX (SeisSpace R5000) which is a commercial processing software. Madagascar shows relatively high efficiencies in data IO and management as well as reproducibility. Additionally, it shows quick and exact calculations in some automated procedures such as stacking velocity analysis. There were no remarkable differences in the results after applying the signal enhancement flows of both software. For the deeper part of the substructure image, however, the commercial software shows better results than the open-source software. This is simply because the commercial software has various flows for de-multiple and provides interactive processing environments for delicate processing works compared to Madagascar. Considering that many researchers around the world are developing various data processing algorithms for Madagascar, we can expect that the open-source software such as Madagascar can be widely used for commercial-level processing with the strength of expandability, cost effectiveness and reproducibility.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.