Journal of the Institute of Electronics Engineers of Korea SD
/
v.43
no.11
s.353
/
pp.37-47
/
2006
This work proposes a 10b 25MS/s $0.8mm^2$ 4.8mW 0.13um CMOS A/D Converter (ADC) for high-performance wireless communication systems such as DVB, DAB and DMB simultaneously requiring low voltage, low power, and small area. A two-stage pipeline architecture minimizes the overall chip area and power dissipation of the proposed ADC at the target resolution and sampling rate while switched-bias power reduction techniques reduce the power consumption of analog amplifiers. A low-power sample-and-hold amplifier maintains 10b resolution for input frequencies up to 60MHz based on a single-stage amplifier and nominal CMOS sampling switches using low threshold-voltage transistors. A signal insensitive 3-D fully symmetric layout reduces the capacitor and device mismatch of a multiplying D/A converter while low-noise reference currents and voltages are implemented on chip with optional off-chip voltage references. The employed down-sampling clock signal selects the sampling rate of 25MS/s or 10MS/s with a reduced power depending on applications. The prototype ADC in a 0.13um 1P8M CMOS technology demonstrates the measured DNL and INL within 0.42LSB and 0.91LSB and shows a maximum SNDR and SFDR of 56dB and 65dB at all sampling frequencies up to 2SMS/s, respectively. The ADC with an active die area if $0.8mm^2$ consumes 4.8mW at 25MS/s and 2.4mW at 10MS/s at a 1.2V supply.
Journal of the Institute of Electronics and Information Engineers
/
v.53
no.5
/
pp.87-97
/
2016
This work proposes a time-shared 10b DAC based on a two-step resistor string to minimize the effective area of a DAC channel for driving each AMOLED display column. The proposed DAC shows a lower effective DAC area per unit column driver and a faster conversion speed than the conventional DACs by employing a time-shared DEMUX and a ROM-based two-step decoder of 6b and 4b in the first and second resistor string. In the second-stage 4b floating resistor string, a simple current source rather than a unity-gain buffer decreases the loading effect and chip area of a DAC channel and eliminates offset mismatch between channels caused by buffer amplifiers. The proposed 1-to-24 DEMUX enables a single DAC channel to drive 24 columns sequentially with a single-phase clock and a 5b binary counter. A 0.9pF sampling capacitor and a small-sized source follower in the input stage of each column-driving buffer amplifier decrease the effect due to channel charge injection and improve the output settling accuracy of the buffer amplifier while using the top-plate sampling scheme in the proposed DAC. The proposed DAC in a $0.18{\mu}m$ CMOS shows a signal settling time of 62.5ns during code transitions from '$000_{16}$' to '$3FF_{16}$'. The prototype DAC occupies a unit channel area of $0.058mm^2$ and an effective unit channel area of $0.002mm^2$ while consuming 6.08mW with analog and digital power supplies of 3.3V and 1.8V, respectively.
The effects of initial conditions and input values of the rainfall-runoff model were studied in the applications of a lumped concept model for flood event data extension. For the initial conditions of the rainfall-runoff model, baseflow effects and spatial distributions of saturation points ($R_{sa}$) for the storage function methods (SFM) were analyzed. In addition, researches on the effects of rainfall data conditions as input values for the rainfall-runoff model were performed. The Chungju Dam watershed was selected and divided into 3 catchments including smaller size of 22 sub-catchments. The observed discharge and inflow amounts at Yeongwol 1, Chungju Dam, and Yeongwol 2 water level stations were individually operated as criteria for flood data extension in 30 flood events from 1993 to 2009. Direct and base flow were distinguished from a stream flow. In order to test capability of flood data extension, obtained base flow was applied to the rainfall-runoff model for three water level stations. When base flow was adopted in the model, the Nash-Sutcliffe Efficiency(NSE) was increased. The numbers of over satisfaction for model performance (>0.5) were increased over 10%. Saturation points ($R_{sa}$) which strongly influence the runoff amount when rainfall starts were optimized based on the runoff amount at three water level stations. The sizes of saturation points for three locations were similar which means saturation point size is not depending on the runoff amount. The effects of rainfall information for flood runoff were tested at 2002ev1 and 2008ev1. When increased the amount of rainfall information, the runoff simulations were closer to the simulations with full of rainfall information. However, the size of improvement was not substantial on rainfall-runoff simulations in terms of the size of total amount of rainfall.
The Journal of Korean Institute of Communications and Information Sciences
/
v.31
no.8B
/
pp.691-700
/
2006
Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.
In this paper, we propose the development of deep learning structure to improve quality of polygonal containers. The deep learning structure consists of a convolution layer, a bottleneck layer, a fully connect layer, and a softmax layer. The convolution layer is a layer that obtains a feature image by performing a convolution 3x3 operation on the input image or the feature image of the previous layer with several feature filters. The bottleneck layer selects only the optimal features among the features on the feature image extracted through the convolution layer, reduces the channel to a convolution 1x1 ReLU, and performs a convolution 3x3 ReLU. The global average pooling operation performed after going through the bottleneck layer reduces the size of the feature image by selecting only the optimal features among the features of the feature image extracted through the convolution layer. The fully connect layer outputs the output data through 6 fully connect layers. The softmax layer multiplies and multiplies the value between the value of the input layer node and the target node to be calculated, and converts it into a value between 0 and 1 through an activation function. After the learning is completed, the recognition process classifies non-circular glass bottles by performing image acquisition using a camera, measuring position detection, and non-circular glass bottle classification using deep learning as in the learning process. In order to evaluate the performance of the deep learning structure to improve quality of polygonal containers, as a result of an experiment at an authorized testing institute, it was calculated to be at the same level as the world's highest level with 99% good/defective discrimination accuracy. Inspection time averaged 1.7 seconds, which was calculated within the operating time standards of production processes using non-circular machine vision systems. Therefore, the effectiveness of the performance of the deep learning structure to improve quality of polygonal containers proposed in this paper was proven.
Journal of the Computational Structural Engineering Institute of Korea
/
v.32
no.1
/
pp.65-73
/
2019
In order to increase the production efficiency of the ship and shorten the production cycle, it is important to evaluate the accuracy of the ship components efficiently during the drying cycle. The accuracy control of the block is important for shortening the ship process, reducing the cost, and improving the accuracy of the ship. Some systems have been developed and used mainly in large shipyards, but in some cases, they are measured and managed using conventional measuring instruments such as tape measure and beam, optical instruments as optical equipment, In order to perform accuracy control, these tools and equipment as well as equipment for recording measurement data and paper drawings for measuring the measurement position are inevitably combined. The measured results are managed by the accuracy control system through manual input or recording device. In this case, the measurement result is influenced by the work environment and the skill level of the worker. Also, in the measurement result management side, there are a human error about the lack of the measurement result creation, the lack of the management sheet management, And costs are lost in terms of efficiency due to consumption. The purpose of this study is to improve the working environment in the existing accuracy management process by using the augmented reality technology to visualize the measurement information on the actual block and to obtain the measurement information And a smart management system based on augmented reality that can effectively manage the accuracy management data through interworking with measurement equipment. We confirmed the applicability of the proposed system to the accuracy control through the prototype implementation.
A CpG island is a short stretch of DNA in which the frequency of the CG dinucleotide is higher than other regions. CpG islands are present in the promoters and exonic regions of approximately $30{\sim}60$% of mammalian genes so they are useful markers for genes in organisms containing 5-methylcytosine in their genomes. Recent evidence supports the notion that the hypermethylation of CpG island, by silencing tumor suppressor genes, plays a major causal role in cancer, which has been described in almost every tumor types. In this respect, CpG island search by computational methods is very helpful for cancer research and computational promoter and gene predictions. I therefore developed a window program (called CpGi) on the basis of CpG island criteria defined by D. Takai and P. A. Jones. The program 'CpGi' was implemented in Visual C++ 6.0 and can determine the locations of CpG islands using diverse parameters (%GC, Obs (CpG)/Exp (CpG), window size, step size, gap value, # of CpG, length) specified by user. The analysis result of CpGi provides a graphical map of CpG islands and G+C% plot, where more detailed information on CpG island can be obtained through pop-up window. Two human contigs, i.e. AP00524 (from chromosome 22) and NT_029490.3 (from chromosome 21), were used to compare the performance of CpGi and two other public programs for the accuracy of search results. The two other programs used in the performance comparison are Emboss-CpGPlot and CpG Island Searcher that are web-based public CpG island search programs. The comparison result showed that CpGi is on a level with or outperforms Emboss-CpGPlot and CpG Island Searcher. Having a simple and easy-to-use user interface, CpGi would be a very useful tool for genome analysis and CpG island research. To obtain a copy of CpGi for academic use only, contact corresponding author.
Han Youngyih;Cho Jae Ho;Park Hee Chul;Chu Sung Sil;Suh Chang-Ok
Radiation Oncology Journal
/
v.20
no.1
/
pp.24-33
/
2002
Purpose : In order to improve dose homogeneity and to reduce acute toxicity in tangential whole breast radiotherapy, we evaluated two treatment techniques using multiple static fields or universal compensators. Materials and Methods : 1) Multistatic field technique : Using a three dimensional radiation treatment planning system, Adac Pinnacle 4.0, we accomplished a conventional wedged tangential plan. Examining the isodose distributions, a third field which blocked overdose regions was designed and an opposing field was created by using an automatic function of RTPS. Weighting of the beams was tuned until an ideal dose distribution was obtained. Another pair of beams were added when the dose homogeneity was not satisfactory. 2) Universal compensator technique : The breast shapes and sizes were obtained from the CT images of 20 patients who received whole breast radiation therapy at our institution. The data obtained were averaged and a pair of universal physical compensators were designed for the averaged data. DII (Dose Inhomogeneity Index : percentage volume of PTV outside $95\~105\%$ of the prescribed dose) $D_{max}$ (the maximum point dose in the PTV) and isodose distributions for each technique were compared. Results : The multistatic field technique was found to be superior to the conventional technique, reducing the mean value of DII by $14.6\%$ (p value<0.000) and the $D_{max}$ by $4.7\%$ (p value<0.000). The universal compensator was not significantly superior to the conventional technique since it decreased $D_{max}$ by $0.3\%$ (p value=0.867) and reduced DII by $3.7\%$ (p value=0.260). However, it decreased the value of DII by maximum $18\%$ when patients' breast shapes fitted in with the compensator geometry. Conclusion : The multistatic field technique is effective for improving dose homogeneity for whole breast radiation therapy and is applicable to all patients, whereas the use of universal compensators is effective only in patients whose breast shapes fit inwith the universal compensator geometry, and thus has limited applicability.
Discontinuities such as faults, fractures and joints in rock mass play the dominant role in the mechanical and hydraulic properties of the rock mass. The key factors that influence on the flow of groundwater are hydraulic and geometric characteristics of discontinuities and their connectivity. In this study, a program that analyzes groundwater flow in the 3D discontinuity network was developed on the assumption that the discontinuity characteristics such as density, trace length, orientation and aperture have particular distribution functions. This program generates discontinuities in a three-dimensional space and analyzes their connectivity and groundwater flow. Due to the limited computing capacity In this study, REV was not exactly determined, but it was inferred to be greater than 25$\times$25$\times$25 ㎥. By calculating the extent of aperture that influences on the groundwater flow, it was found that the discontinuities with the aperture smaller than 30% of the mean aperture had little influence on the groundwater flow. In addition, there was little difference in the equivalent hydraulic conductivity for the the two cases when considering and not considering the boundary effect. It was because the groundwater flow was mostly influenced by the discontinuities with large aperture. Among the parameters considered in this study, the length, aperture, and orientation of discontinuities had the greatest influence on the equivalent hydraulic conductivity of rock mass in their order. In case of existence of a fault in rock mass, elements of the equivalent hydraulic conductivity tensor parallel to the fault fairly increased in their magnitude but those perpendicular to the fault were increased in a very small amount at the first stage and then converged.
Park, Yong Sung;Lee, Yong Jin;Kim, Wook;Ji, Young Hoon;Kim, Kum Bae;Kang, Joo Hyun;Lim, Sang Moo;Woo, Sang-Keun
Progress in Medical Physics
/
v.27
no.2
/
pp.86-92
/
2016
An absorbed dose calculation method using a digital phantom is implemented in normal organs. This method cannot be employed for calculating the absorbed dose of tumor. In this study, we measure the S-value for calculating the absorbed dose of each organ and tumor. We inject a radioisotope into a torso phantom and perform Monte Carlo simulation based on the CT data. The torso phantom has lung, liver, spinal, cylinder, and tumor simulated using a spherical phantom. The radioactivity of the actual absorbed dose is measured using the injected dose of the radioisotope, which is Cu-64 73.85 MBq, and detected using a glass dosimeter in the torso phantom. To perform the Monte Carlo simulation, the information on each organ and tumor acquired using the PET/CT and CT data provides anatomical information. The anatomical information is offered above mean value and manually segmented for each organ and tumor. The residence time of the radioisotope in each organ and tumor is calculated using the time activity curve of Cu-64 radioactivity. The S-values of each organ and tumor are calculated based on the Monte Carlo simulation data using the spatial coordinate, voxel size, and density information. The absorbed dose is evaluated using that obtained through the Monte Carlo simulation and the S-value and the residence time in each organ and tumor. The absorbed dose in liver, tumor1, and tumor2 is 4.52E-02, 4.61E-02, and 5.98E-02 mGy/MBq, respectively. The difference in the absorbed dose measured using the glass dosimeter and that obtained through the Monte Carlo simulation data is within 12.3%. The result of this study is that the absorbed dose obtained using an image can evaluate each difference region and size of a region of interest.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.