• Journal of The Korean Dental Society of Anesthesiology
• /
• v.13 no.4
• /
• pp.179-188
• /
• 2013

Background: Today, there are computer controlled local anesthesia devices used clinically. The main principle is to control injection speed by computer aided system, and it relieves pain. However, there are few objective data considering this subject. In this literature review, we researched studies about computer controlled anesthetic delivery. We compared pain control effect of computer controlled to conventional local anesthetic syringe system. Methods: A bibliographic search in PubMed was performed and we reviewed original articles. Results: There were 18 publications that compared pain control effect of computer controlled to conventional system. There were 8 articles reported of children, similar pain control effect was found in 7 of them. One study showed superior pain control effect of computer controlled anesthetic delivery. For adults, 10 studies showed superior pain control effect in computer aided system. Conclusions: Computer controlled anesthetic delivery has similar or superior pain control effect compared to conventional local anesthetic syringe system. For both children and adults, computer controlled anesthetic delivery could be clinically useful, still it may be more effective for adults.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.6
• /
• pp.11-18
• /
• 2006

The purpose of this paper is to draw problems from analyzing "General Computer" questions of Career Searching Section in the College Scholastic Ability Test in 2005 and 2006 and to offer some suggestions about them. For the qualitative research, this paper analyzed content validity. For the quantitative research, this paper analyzed item difficulty and item discrimination by using Bayesian 1.0 based on 2-parameter item response model and this paper analyzed item reliability and distracters by using Testan 1.0. By analyzing "General Computer" questions, this paper would like to improve the quality of items and estimate item difficulty. Therefore, "General Computer" questions could be suggested as materials for developing reliable and discriminative questions.

• Journal of The Korean Association of Information Education
• /
• v.2 no.1
• /
• pp.60-71
• /
• 1998

The purpose of this research is to develop a education on demand system by which general is people learn computer utilization. Nowadays computer is getting essential for everylife. However computer novice has difficulty in learning computer because computer utililization is changed rapidly. One is hard to learn computer because of lack of time and money. This system allows us to study computer at anyplace and anytime and to share educational data with learners. Therefore this system endows equal opportunity for general person to learn computer.

• Asia pacific journal of information systems
• /
• v.12 no.1
• /
• pp.123-138
• /
• 2002

For the last two decades, there has been much research on computer abuse from the perspective of the general deterrence theory based on objectism, which covers security policy, security awareness programs, and physical security system. The traditional view offered by the general deterrence theory indicates that security policy, security awareness, and security system play a major role in preventing computer abuse. In spite of continuous organizational efforts and investments based on these systematic factors, the incidence of computer abuse in organizations is still rapidly increasing. This paper proposes another perspective-the social control theory based on subjectism-in preventing computer abuse. According to the social control theory, organizational trust, which comprises organizational attachment, commitment, involvement and norms, can prevent computer abuse by reducing insider's computer abuse. The aim of this article is to assess the role of organizational trust come from attachment, commitment, involvement, norms in preventing computer abuse. The results indicate that both organizational trust and deterrent factors are effective in preventing computer abuse.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.16 no.2
• /
• pp.81-88
• /
• 2016

Local anesthesia is administered to reduce pain during dental treatments, but may itself cause pain and contribute to increased dental fear. Computer-controlled local anesthetic delivery (CCLAD) is one the method to reduce patient pain during local anesthesia; it is a device that slowly administers anesthetics by using a computerized device to control the injection speed. This literature review aims to provide an objective assessment of the usefulness of CCLAD for controlling pain by reviewing papers published to date that have used CCLAD.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.2
• /
• pp.13-26
• /
• 2006

5 years are passed since the 7th National Curriculum of Education began. The curriculum didn't get successful outcomes, rather brought about several problems. Especially, the computer curriculum didn't effectively deal with fast developing computer technology. In present, the general and overall problems of middle school computer education suggested in many previous researches. After we investigate general computer education problems which computer teachers and students are felt, we must try to reflect the results in computer education policy. In this paper, on the basis of general computer education problems suggested by previous researches, we absolutely analyzed the teacher's and student's question results about correct situation of middle school, and suggested improvement methods of middle school computer education.

• Journal of Computing Science and Engineering
• /
• v.9 no.1
• /
• pp.20-28
• /
• 2015

General purpose computing applications have not yet been thoroughly explored in procedure level speculation, especially in the light-weighted profiling way. This paper proposes a light-weighted profiling mechanism to analyze speculative parallelism characterization in several classic general purpose computing applications from SPEC CPU2000 benchmark. By comparing the key performance factors in loop and procedure-level speculation, it includes new findings on the behaviors of loop and procedure-level parallelism under these applications. The experimental results are as follows. The best gzip application can only achieve a 2.4X speedup in loop level speculation, while the best mcf application can achieve almost 3.5X speedup in procedure level. It proves that our light-weighted profiling method is also effective. It is found that between the loop-level and procedure-level TLS, the latter is better on several cases, which is against the conventional perception. It is especially shown in the applications where their 'hot' procedure body is concluded as 'hot' loops.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.59-67
• /
• 2010

In this paper, we suggest and analyze some three step iterative scheme for finding the common elements of the set of the solutions of the extended general variational inequalities involving three operators and the set of the fixed points of nonexpansive mappings. We also consider the convergence analysis of suggested iterative schemes under some mild conditions. Since the extended general variational inequalities include general variational inequalities and several other classes of variational inequalities as special cases, results obtained in this paper continue to hold for these problems. Results obtained in this paper may be viewed as a refinement and improvement of the previously known results.

• East Asian mathematical journal
• /
• v.28 no.5
• /
• pp.561-567
• /
• 2012

The approximate solvability of a generalized system for relaxed cocoercive extended general variational inequalities is studied by using the project operator technique. The results presented in this paper are more general and include many previously known results as special cases.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.751-754
• /
• 2015

최근 시계열 데이터베이스 기반의 다양한 응용 분야에서 서브시퀀스 매칭(subsequence matching)연구가 활발히 진행되고 있다. FRM과 DualMatch은 효과적인 서브시퀀스 매칭을 위해 처음 제안된 해결책이다. 이후 이들을 일반화한 GeneralMatch가 제안되었으며, 최근에는 GeneralMatch의 이원적 접근법인 DualGMatch가 제안되었다. 본 논문에서는 GeneralMatch와 DualGMath를 비교 분석 하고자 한다. 이를 위해, 먼저 윈도우 구성 관점에서 GeneralMatch와 DualGMatch를 평가한다. 다음으로, 두 해결책을 최대 윈도우 크기 효과와 인덱스 저장 효율 관점에서 이론적으로 비교 분석한다. 마지막으로, 실제 시계열 데이터를 활용하여 GeneralMatch와 DualGMatch의 인덱스 페이지 접근 횟수를 비교한다. 분석 결과, GeneralMatch가 윈도우 크기 효과와 인덱스 저장 효율 측면에서 DualGMatch보다 우수한 것으로 나타났다.