Kelly, Robert E. Jr.;Obermeyer, Robert J.;Kuhn, M. Ann;Frantz, Frazier W.;Obeid, Mohammad F.;Kidane, Nahom;McKenzie, Frederic D.
Journal of Chest Surgery
/
v.51
no.6
/
pp.390-394
/
2018
Background: The nonsurgical treatment of chest wall deformity by a vacuum bell or external brace is gradual, with correction taking place over months. Monitoring the progress of nonsurgical treatment of chest wall deformity has relied on the ancient methods of measuring the depth of the excavatum and the protrusion of the carinatum. Patients, who are often adolescent, may become discouraged and abandon treatment. Methods: Optical scanning was utilized before and after the intervention to assess the effectiveness of treatment. The device measured the change in chest shape at each visit. In this pilot study, patients were included if they were willing to undergo scanning before and after treatment. Both surgical and nonsurgical treatment results were assessed. Results: Scanning was successful in 7 patients. Optical scanning allowed a visually clear, precise assessment of treatment, whether by operation, vacuum bell (for pectus excavatum), or external compression brace (for pectus carinatum). Millimeter-scale differences were identified and presented graphically to patients and families. Conclusion: Optical scanning with the digital subtraction of images obtained months apart allows a comparison of chest shape before and after treatment. For nonsurgical, gradual methods, this allows the patient to more easily appreciate progress. We speculate that this will increase adherence to these methods in adolescent patients.
An, Hong;Park, Jaechan;Kang, Dong-Hun;Son, Wonsoo;Lee, Young-Sup;Kwak, Youngseok;Ohk, Boram
Journal of Korean Neurosurgical Society
/
v.62
no.5
/
pp.526-535
/
2019
Objective : While the risk of aneurysmal rebleeding induced by catheter cerebral angiography is a serious concern and can delay angiography for a few hours after a subarachnoid hemorrhage (SAH), current angiographic technology and techniques have been much improved. Therefore, this study investigated the risk of aneurysmal rebleeding when using a recent angiographic technique immediately after SAH. Methods : Patients with acute SAH underwent immediate catheter angiography on admission. A four-vessel examination was conducted using a biplane digital subtraction angiography (DSA) system that applied a low injection rate and small volume of a diluted contrast, along with appropriate control of hypertension. Intra-angiographic aneurysmal rebleeding was diagnosed in cases of extravasation of the contrast medium during angiography or increased intracranial bleeding evident in flat-panel detector computed tomography scans. Results : In-hospital recurrent hemorrhages before definitive treatment to obliterate the ruptured aneurysm occurred in 11 of 266 patients (4.1%). Following a univariate analysis, a multivariate analysis using a logistic regression analysis revealed that modified Fisher grade 4 was a statistically significant risk factor for an in-hospital recurrent hemorrhage (p=0.032). Cerebral angiography after SAH was performed on 88 patients ${\leq}3$ hours, 74 patients between 3-6 hours, and 104 patients >6 hours. None of the time intervals showed any cases of intra-angiographic rebleeding. Moreover, even though the DSA ${\leq}3$ hours group included more patients with a poor clinical grade and modified Fisher grade 4, no case of aneurysmal rebleeding occurred during erebral angiography. Conclusion : Despite the high risk of aneurysmal rebleeding within a few hours after SAH, emergency cerebral angiography after SAH can be acceptable without increasing the risk of intra-angiographic rebleeding when using current angiographic techniques and equipment.
Journal of the Korea Institute of Information and Communication Engineering
/
v.23
no.6
/
pp.675-681
/
2019
Noise removal is a pre-requisite procedure in image processing, and various methods have been studied depending on the type of noise and the environment of the image. However, for image processing with high-frequency components, conventional additive white Gaussian noise (AWGN) removal techniques are rather lacking in performance because of the blurring phenomenon induced thereby. In this paper, we propose an algorithm to minimize the blurring in AWGN removal processes. The proposed algorithm sets the high-frequency and the low-frequency component filters, respectively, depending on the pixel properties in the mask, consequently calculating the output of each filter with the addition or subtraction of the input image to the reference. The final output image is obtained by adding the weighted data calculated using the standard deviations and the Gaussian distribution with the output of the two filters. The proposed algorithm shows improved AWGN removal performance compared to the existing method, which was verified by simulation.
Jeon, Hong Jun;Lee, Jong Young;Cho, Byung-Moon;Yoon, Dae Young;Oh, Sae-Moon
Journal of Korean Neurosurgical Society
/
v.62
no.1
/
pp.35-45
/
2019
Objective : To describe our experiences with a fully equipped high-end digital subtraction angiography (DSA) system within a hybrid operating room (OR). Methods : A single-plane DSA system with 3-dimensional rotational angiography, cone-beam computed tomography (CBCT), and real-time navigation software was used in our hybrid OR. Between April 2014 and January 2018, 191 sessions of cerebrovascular procedures were performed in our hybrid OR. After the retrospective review of all cases, the procedures were categorized into three subcategorical procedures : combined endovascular and surgical procedure, complementary rescue procedure during intervention and surgery, and frameless stereotaxic operation. Results : Forty-nine of 191 procedures were performed using hybrid techniques. Four cases of blood blister aneurysms and a ruptured posterior inferior cerebellar artery aneurysm were treated using bypass surgery and endovascular trapping. Eight cases of ruptured aneurysm with intracranial hemorrhage (ICH) were treated by partial embolization and surgical clipping. Six cases of ruptured arteriovenous malformation with ICH were treated by Onyx embolization of nidus and subsequent surgical removal of nidus and ICH. Two (5.4%) of the 37 cases of pre-mature rupture during clipping were secured by endovascular coil embolization. In one (0.8%) complicated case of 103 intra-arterial thrombectomy procedures, emergency surgical embolectomy with bypass surgery was performed. In 27 cases of ICH, frameless stereotaxic hematoma aspiration was performed using $XperGuide^{(R)}$ system (Philips Medical Systems, Best, the Netherlands). All procedures were performed in single sessions without any procedural complications. Conclusion : Hybrid OR with a fully equipped DSA system could provide precise and safe treatment strategies for cerebrovascular diseases. Especially, we could suggest a strategy to cope flexibly in complex lesions or unexpected situations in hybrid OR. CBCT with real-time navigation software could augment the usefulness of hybrid OR.
Because of the various concepts and meanings of fractions and the difficulty of learning, studies to improve the teaching methods of fraction have been carried out. Particularly, because there are various methods of teaching depending on the type of fractions or the models or methods used for problem solving in fraction operations, many researches have been implemented. In this study, I analyzed the fractional operations of CCSSM-CA and its U.S. textbooks. It was CCSSM-CA revised and presented in California and the textbooks of Houghton Mifflin Harcourt Publishing Co., which reflect the content and direction of CCSSM-CA. As a result of the analysis, although the grades presented in CCSSM-CA and Korean textbooks were consistent in the addition and subtraction of fractions, there are the features of expressing fractions by the sum of fractions with the same denominator or unit fraction and the evaluation of the appropriateness of the answer. In the multiplication and division of fractions, there is a difference in the presentation according to the grades. There are the features of the comparison the results of products based on the number of factor, presenting the division including the unit fractions at first, and suggesting the solving of division problems using various ways.
Objective: This study aims to develop CFT, a screening test for dementia that can be conducted on patients with mild cognitive impairment or early dementia. Methods: This study was conducted on therapists working at occupational therapy hospital in Gyeongsangnam-do. The data collection period is two months from July to September 2020, and the research participants were briefed on the purpose, significance, and anonymity of the research in consideration of ethical issues. A total of 33 copies of the data were finally analyzed, excluding those containing insufficient answers and errors, by distributing 40 copies of the data. SPSS Data Access pack 8.0 was used for data analysis, Cronbach's α value was evaluated for internal consistency reliability of each item, and Pearson Correlation coeffient between the lower scales of the assessment tool was measured. Results: The Cronbach's α value of the CFT was shown as .892 and the reliability of the assessment paper was shown to be quite high. The Cronbach's α value for each item in the cognitive assessment tool was the highest at .899 in the subtraction item, with exercise control (mook Chi Pa) at 888, visual memory, plus .887. The correlation of each item of cognitive assessment tools was found to be most correlated with the number of sustained concentrates and word2 to .934; in the stop word-numeric item and visual memory to be .85; and in the addition to the auditory memory item .739. Conclusion: Therefore, this study developed cognitive evaluation tools that can distinguish the diversity and cognitive level of screening tests and clarify standards, which are different from the existing dementia screening tools in Korea. Furthermore, the cognitive assessment tools of this study can be verified by applying them to patients with mild cognitive impairment and early dementia, and the criteria for generalization can be established.
Public-key cryptographic algorithms such as RSA and ECC, which are currently in use, have used mathematical problems that would take a long time to calculate with current computers for encryption. But those algorithms can be easily broken by the Shor algorithm using the quantum computer. Lattice-based cryptography is proposed as new public-key encryption for the post-quantum era. This cryptographic algorithm is performed in the Polynomial Ring, and polynomial multiplication requires the most processing time. Therefore, a hardware model module is needed to calculate polynomial multiplication faster. Number Theoretic Transform, which called NTT, is the FFT performed in the finite field. The logic verification was performed using HDL, and the proposed design at the transistor level using Hspice was compared and analyzed to see how much improvement in delay time and power consumption was achieved. In the proposed design, the average delay was improved by 30% and the power consumption was reduced by more than 8%.
KSII Transactions on Internet and Information Systems (TIIS)
/
v.15
no.7
/
pp.2610-2630
/
2021
The aim of this paper is to propose the alternative algorithm to finish the process in public key cryptography. In general, the proposed method can be selected to finish both of modular exponentiation and point multiplication. Although this method is not the best method in all cases, it may be the most efficient method when the condition responds well to this approach. Assuming that the binary system of the exponent or the multiplier is considered and it is divided into groups, the binary system is in excellent condition when the number of groups is small. Each group is generated from a number of 0 that is adjacent to each other. The main idea behind the proposed method is to convert the exponent or the multiplier as the subtraction between two integers. For these integers, it is impossible that the bit which is equal to 1 will be assigned in the same position. The experiment is split into two sections. The first section is an experiment to examine the modular exponentiation. The results demonstrate that the cost of completing the modular multiplication is decreased if the number of groups is very small. In tables 7 - 9, four modular multiplications are required when there is one group, although number of bits which are equal to 0 in each table is different. The second component is the experiment to examine the point multiplication process in Elliptic Curves Cryptography. The findings demonstrate that if the number of groups is small, the costs to compute point additions are low. In tables 10 - 12, assigning one group is appeared, number of point addition is one when the multiplier of a point is an even number. However, three-point additions are required when the multiplier is an odd number. As a result, the proposed method is an alternative way that should be used when the number of groups is minimal in order to save the costs.
Journal of the Korea Institute of Information Security & Cryptology
/
v.13
no.2
/
pp.127-132
/
2003
Cryptosystems have received very much attention in recent years as importance of information security is increased. Most of Cryptosystems are defined over finite or Galois fields GF($2^m$) . In particular, the finite field GF($2^m$) is mainly used in public-key cryptosystems. These cryptosystems are constructed over finite field arithmetics, such as addition, subtraction, multiplication, and multiplicative inversion defined over GF($2^m$) . Hence, to implement these cryptosystems efficiently, it is important to carry out these operations defined over GF($2^m$) fast. Among these operations, since multiplicative inversion is much more time-consuming than other operations, it has become the object of lots of investigation. Recently, many methods for computing multiplicative inverses at hi호 speed has been proposed. These methods are based on format's theorem, and reduce the number of required multiplication using normal bases over GF($2^m$) . The method proposed by Itoh and Tsujii[2] among these methods reduced the required number of times of multiplication to O( log m) Also, some methods which improved the Itoh and Tsujii's method were proposed, but these methods have some problems such as complicated decomposition processes. In practical applications, m is frequently selected as a power of 2. In this parer, we propose a fast method for computing multiplicative inverses in GF($2^m$) , where m = ($2^n$) . Our method requires fewer ultiplications than the Itoh and Tsujii's method, and the decomposition process is simpler than other proposed methods.
PURPOSE. The purpose of this study was to evaluate the influence of different palatal vault configurations on the accuracy and scan speed of intraoral scans (IO) of completely edentulous arches. MATERIALS AND METHODS. Three different virtual models of a completely edentulous maxillary arch with different palatal vault heights- Cl I moderate (U-shaped), Cl II deep (steep) and Cl III shallow (flat)-were digitally designed using CAD software (Meshmixer; Autodesk, USA) and 3D-printed using SLA-based 3D-printer (XFAB; DWS, Italy) (n = 30; 10 specimens per group). Each model was scanned using intraoral scanner (Trios 3; 3ShapeTM, Denmark). Scanning time was recorded for all samples. Scanning accuracy (trueness and precision) were evaluated using digital subtraction technique using Geomagic Control X v2020 (Geomagic; 3DSystems, USA). One-way analysis of variance (ANOVA) test was used to detect differences in scanning time, trueness and precision among the test groups. Statistical significance was set at α = .05. RESULTS. The scan process could not be completed for Class II group and manufacturer's recommended technique had to be modified. ANOVA revealed no statistically significant difference in trueness and precision values among the test groups (P=.959 and P=.658, respectively). Deep palatal vault (Cl II) showed significantly longer scan time compared to Cl I and III. CONCLUSION. The selection of scan protocol in complex cases such as deep palatal vault is of utmost importance. The modified, adopted longer path scan protocol of deep vault cases resulted in increased scan time when compared to the other two groups.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.