Proceedings of the Korean Vacuum Society Conference
/
2011.08a
/
pp.120-120
/
2011
Graphene is a carbon based material and it has great potential of being utilized in various fields such as electronics, optics, and mechanics. In order to develop graphene-based logic systems, graphene field-effect transistor (GFET) has been extensively explored. GFET requires supporting devices, such as volatile memory, to function in an embedded logic system. As far as we understand, graphene has not been studied for volatile memory application, although several graphene non-volatile memories (GNVMs) have been reported. However, we think that these GNVM are unable to serve the logic system properly due to the very slow program/read speed. In this study, a GVM based on the GFET structure and using an engineered graphene channel is proposed. By manipulating the deposition condition, charge traps are introduced to graphene channel, which store charges temporarily, so as to enable volatile data storage for GFET. The proposed GVM shows satisfying performance in fast program/erase (P/E) and read speed. Moreover, this GVM has good compatibility with GFET in device fabrication process. This GVM can be designed to be dynamic random access memory (DRAM) in serving the logic systems application. We demonstrated GVM with the structure of FET. By manipulating the graphene synthesis process, we could engineer the charge trap density of graphene layer. In the range that our measurement system can support, we achieved a high performance of GVM in refresh (>10 ${\mu}s$) and retention time (~100 s). Because of high speed, when compared with other graphene based memory devices, GVM proposed in this study can be a strong contender for future electrical system applications.
Journal of the Korea Society of Computer and Information
/
v.17
no.4
/
pp.139-145
/
2012
Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.
In this paper, we propose an improved image encryption and fault-tolerance decryption method using phase wrapping and phase encoding in the frequency domain. To generate an encrypted image, an encrypting key which denotes the product of a phase-encoded virtual image, not an original image, and a random phase image is zero-padded and Fourier transformed and its real-valued data is phase-encoded. The decryption process is simply performed by performing the inverse Fourier transform for multiplication of the encrypted key with the decrypting key, made of the proposed phase wrapping method, in the output plane with a spatial filter. This process has the advantages of solving optical alignment and pixel-to-pixel mapping problems. The proposed method using the virtual image, which does not contain any information from the original image, prevents the possibility of counterfeiting from unauthorized people and also can be used as a current spatial light modulator technology by phase encoding of the real-valued data. Computer simulations show the validity of the encryption scheme and the robustness to noise of the encrypted key or the decryption key in the proposed technique.
1. Objects The experiments of catalytic aharcoaling were carried out for the fallowing purposes. (1) To determine the economically desirable amount of catalytic materials to be used when a catalytic charcoaling is practiced. (2) To observe the rate of carbonization of non-treated charcoal wood when the catalytic charcoaling is proceeded in the same charcoal pit. 2. Meterials (1) Small sample chips made of oak (Q. accutissima Carr.), measured by 0.5cm in width and thickness, respectively, and 1cm in length, were used as charcoal wood in each experiment. (2) Ammonium chloride was used as a catalytic material and electric kiln as a charcoaling apparatus. 3. Experiment (1) The sample chips were put into a electric oven for three hours at the temperature $60^{\circ}{\sim}70^{\circ}C$ in order to reduce some water contents. (2) Oven dried sample chips were then soaked for an hour in solution of ammonium chloride. Three kinds of solution were prepared, that is, 2.5%, 5%, and 10%, solution in which the amount of ammonium chloride used was weighed at the rate of 0.5%, 1.0%, and 2.0% to the total weight of the sample chips, resppectivelly. (3) Soaked sample chips were put in the air for 12 hours to reduce some water contents, and then were put into electric oven for 2 hours at the temperature $105^{\circ}{\sim}110^{\circ}C$. (4) Dried sample chips were kept in a desiccator with control sample chips which were treated excarly the same process as the treated sample chips except only not using the ammonium chloride in the process of soking. (5) Sample chips kept in the desiccator were used at random in each charcoaling experiment. (6) Charcoaling in the electric kiln were carried out by using small crucibles with complete cover to reduce the amount of ash. At each charcoaling experiment four crucibles filled with sample ships, weighed about 20gr, were put into electric kiln. The charcoaling was continued for an hour at the temperature $400^{\circ}{\sim}450^{\circ}C$. (7) In order to investigate the influence given by the gases produced during the catalytic charcoaling to the rate of carbonization of non-treated sample chips, the following experiment was done. (a) A crueible was divided into two parts by inserting a fine iron net at the middle of the crucible, and then non-treated sample chips, weighed about 10gr, were put in the upper part of the crucible and treated sample chips, weighed also about 10gr, were put in the under part. (b) The crucibles filled with two kinds of sample chips were put into a electric kiln for an hour at the temperature $400^{\circ}{\sim}450^{\circ}C$. 4. Results. Results for two replications (with four crucibles in one replication) for each experiment designed are as follows : (1) The rats of carbonization of the non treated sample chips, and that of the treated sample chips with ammonium chloride at the rate of 1.5%, 1.0%, and 2.0% to the total weight of the sample chips used were averaged at 19.85%, 22.63%, 24.14%, and 26.60%, respectively. (2) The rats of carbonization of the non-treated sample chips were averaged at (a) 20.04% (0.5% treatment), (b) 20.28% (1.0% treatment), and (c) 20.61% (2.0% treatment) when the treated sample chips were carbonized in the same crucible.
Objectives: To identify the factors associated with the intention to undergo mammography among Korean women without a prior screening experience. Methods: Among 1,039 women of the general population, we selected 145 women (mean age: 54.2 years, age range : 40-78 years) without any prior experience with mammography. They were recruited for the 'Cancer Information Needs Assessment Survey' by using the method of random multi-stage cluster sampling. Data on the socio-demographic characteristics, intention to undergo mammography based on the Precaution Adoption Process Model, level of self belief and self efficacy for breast cancer screening, motivation for decision to undergo breast cancer screening were obtained by conducting a household survey. Results: Of the study subjects, 49.7% were classified as "unengaged" and "decided not to act" regarding breast cancer screening. Women with the intention to undergo mammography were more likely to be younger (OR 0.11, 95%CI 0.04-0.36), to have been recommended to undergo screening by others (OR 3.27, 95%CI 1.36-7.87), to have a high level of perceived sensitivity (OR 3.15, 95%CI 1.27-7.82), and to have a high level of self efficacy (OR 1.09, 95%CI 0.97-1.23). Exposure to campaigns and information regarding breast cancer screening, whether cancer patients are or not in around, perceived severity, perceived benefit, and perceived cost were factors that were not significantly associated with the intention to undergo mammography. Conclusion: It is necessary to develop tailored intervention strategies for women who have never undergone breast cancer screening on the basis of their demographic characteristics and factors that positively influence the intention to undergo mammography.
Phase-only encryption scheme using exclusive-OR rules in Fourier plane and a single path decryption system are presented. A zero-padded original image, multiplied by a random phase image, is Fourier transformed and its real-valued data is encrypted with key data by using XOR rules. A decryption is simply performed based on 2-1 setup with spatial filter by Fourier transform for multiplying phase-only encrypted data by phase-only key data, which are obtained by phase-encoding process, and spatial filtering for zero-order elimination in inverse-Fourier plane. Since the encryption process is peformed in Fourier plane, proposed encryption scheme is more tolerant to loss of key information by scratching or cutting than previous XOR encryption method in space domain. Compare with previous phase-visualization systems, due to the simple architecture without a reference wave, our system is basically robust to mechanical vibrations and fluctuations. Numerical simulations have confirmed the proposed technique as high-level encryption and simple decryption architecture.
The Journal of Korean Institute of Communications and Information Sciences
/
v.31
no.7A
/
pp.649-658
/
2006
Recently, Software Development was applied to new-approach methods as a various form : client-server system and web-programing, object-orient concept, distributed development with a network environments. On the other hand, it be concerned about the distributed development technology and increasing of object-oriented methodology. These technology is spread out the software quality and improve of software production, reduction of the software develop working. Futures, we considered about the distributed software development technique with a many workstation. In this paper, we discussed optimal release problem based on a stochastic differential equation model for the distributed Software development environments. In the past, the software reliability applied to quality a rough guess with a software development process and approach by the estimation of reliability for a test progress. But, in this paper, we decided to optimal release times two method: first, SRGM with an error counting model in fault detection phase by NHPP. Second, fault detection is change of continuous random variable by SDE(stochastic differential equation). Here, we decide to optimal release time as a minimum cost form the detected failure data and debugging fault data during the system test phase and operational phase. Especially, we discussed to limitation of reliability considering of total software cost probability distribution.
Kim, Ji-Hyeon;Rojas, Geoff;Anders, Axel;Kim, Jae-Seong
Proceedings of the Korean Vacuum Society Conference
/
2010.02a
/
pp.362-362
/
2010
Today, vast attention has been paid to periodic arrays of nanostructures due to their potential for applications such as memory with huge storage density. Such application requires large-scale fabrication of well ordered nano-sized structures. One of the most widely used methods for the ordered nanostructures is lithography. This top-down process, however, has the limit to reduce size. Here the promising alternative is the self-organization of ordered nano-sized structures such as large scale 2d carbon-induced reconstructions on W(110). In the present study, we report on the first well-resolved atomic resolution STM studies of the well-known R($15{\times}3$) and R($15{\times}12$) carbon induced reconstruction of the W(110). From the atomic image of R($15{\times}3$) for different values of tunneling gap resistance, we can tell there are no missing atoms in unit cells of R($15{\times}3$) and some atomic displacements are substantial from the clean W(110), even though not all the imaged position of atoms correspond to tungsten, but may include those of carbon. We are considering two cases; First case is related to lattice deformation, or top layer of W(110) is deformed in the process of relief of strain caused by random inserting of carbon atoms possibly in the interstitial position. In the second case, R($15{\times}3$) unit cell results from a coincidence lattice between clean W(110) substrate and tungsten carbide overlayer which has rectangular atomic arrangement and giving R($15{\times}3$) coincidence lattice. beta-W2C showing rectangular unit cell should be a candidate. Further, we report on new reconstructions. Unlike the well-known R($15{\times}12$) consisting of two parts, two inner structures between two "Backbone" structures. The new reconstruction, which we found for the first time, contains more parts between the "Backbone"s. Sometimes we can observe the reconstruction consists of only inner parts without "Backbone" parts. Thus, the observed reconstruction can be built by constructing of two types of "Lego"-like block. Moreover, the rectangle shape of "Backbone" transform to parallelogram-like shape over time, the so-called wavy-R($15{\times}12$). Adsorption of hydrogen can be the reason for this transformation.
With expanded and extended coverage of the national medical insurance and fast growing health care expenditures, appropriateness of health service utilization and quality of care are concerns of both health care providers and insurers as well as patients. An accurate patient classification system is a basic tool for effective health care policies and efficient health services management. A classification system applicable to Korean medical information-Korean Diagnosis Related Groups (K-DRGs)-was developed based on the U.S. Refined DRGs, and the performance of the developed system was assessed in this study. In the process of the development, first the Korean coding systems for diagnoses and procedures were converted to the systems used in the definition of the U.S. Refined DRGs using the mapping tables formulated by physician panels. Then physician panels reviewed the group definition, and identified medical practice patterns different in two countries. The definition was modified for the differences in K-DRGs. The process resulted in 1,199 groups in the system. Several groups in Refined DRGs could not be differentiated in K-DRGs due to insufficient medical information, and several groups could not be defined due to procedures which were not practiced in Korea. However, the classification structure of Refined DRGs was retained in K-DRGs. The developed system was evaluated fur its performance in explaining variations in resource use as measured by charges and length of stay(LOS), for both all and non-extreme discharges. The data base used in this evaluation included 373,322 discharges which was a random sample of discharges reviewed and payed by the medical insurance during the five-month period from September 1990. The proportion of variance in resource use which was reduced by classifying patients into K-DRGs-r-square-was comparable to the performance of the U.S. Refined DRGs: .39 for charges and .25 for LOS for all discharges, and .53 for charges and .31 for LOS for non-extreme discharges. Another measure analyzed to assess the performance was the coefficient of variation of charges within individual K-DRGs. A total of 966 K-DRGs (87.7%) showed a coefficient below 100%, and the highest coefficient among K-DRGs with more than 30 discharges was 159%.
Predicting term deposit subscriptions is one of representative financial marketing in banks, and banks can build a prediction model using various customer information. In order to improve the classification accuracy for term deposit subscriptions, many studies have been conducted based on machine learning techniques. However, even if these models can achieve satisfactory performance, utilizing them is not an easy task in the industry when their decision-making process is not adequately explained. To address this issue, this paper proposes an explainable scheme for term deposit subscription forecasting. For this, we first construct several classification models using decision tree-based ensemble learning methods, which yield excellent performance in tabular data, such as random forest, gradient boosting machine (GBM), extreme gradient boosting (XGB), and light gradient boosting machine (LightGBM). We then analyze their classification performance in depth through 10-fold cross-validation. After that, we provide the rationale for interpreting the influence of customer information and the decision-making process by applying Shapley additive explanation (SHAP), an explainable artificial intelligence technique, to the best classification model. To verify the practicality and validity of our scheme, experiments were conducted with the bank marketing dataset provided by Kaggle; we applied the SHAP to the GBM and LightGBM models, respectively, according to different dataset configurations and then performed their analysis and visualization for explainable term deposit subscriptions.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.