• Journal of dental hygiene science
• /
• v.23 no.1
• /
• pp.60-67
• /
• 2023

Background: In our study, a silver diamine fluoride (SDF) compound for the treatment of dental caries was synthesized to characterize its remineralization activity upon direct application to deciduous teeth. This study aimed to use microscopic computed tomography (microCT) and nanoindentation to evaluate whether SDF composite application could effectively arrest dental caries in five exfoliated primary molars. Methods: Carious teeth were extracted and visually examined using quantitative photofluorescence devices (Qraycam and QraypenTM). After performing microCT, the SDF composite was applied to the teeth according to the manufacturer's instructions. The researchers exchanged and precipitated the irritant saliva once daily for 1 week. The teeth were sectioned longitudinally through the centers of the mesial and distal surfaces, embedded, polished, and measured using nanoindentation. Thereafter, microCT was repeated. Statistical analyses were performed using GraphPad Prism software. Results: Following SDF composite application, a remineralized layer was observed on microCT images, and the hardness increased when measured using nanoindentation. We found that demineralized enamel presented with an increased number of irregular crystals in the deep carious lesion group compared with those in the shallow carious lesion group, resulting in a rougher surface. Conclusion: The SDF composite may be used for remineralization of early caries and cessation of advanced caries in primary molars.

• Journal of radiological science and technology
• /
• v.28 no.2
• /
• pp.111-115
• /
• 2005

The quality of image from the system that creates medical images by using X-ray depends on the various different reasons such as the X-ray generator, the subject and the image transmission medium. In other words, thereare various factors existing that can influence on the quality of image from the moment when the X-ray is generated and until the final image is created. Therefore, the operator who creates images at the clinical site should make continuous evaluation and observation from the final image. There are various methods of evaluating the medical images, but it is assumed that the MTF measurement method can be suitable for measuring actual or effective resolution. So in this study, the MTF measurement method by using X-ray film has been avoided and the MTF features according to the deterioration of the X-ray system have been measured by using the software (the program used Borland C++ builder software and LEAD tools software) that can measure the MTF of the digital medical images. As the result of this measurement, it has been found out through the MTF graph that the resolution and sharpness from the old x-ray generator with a many years of using and many numbers of times of using were deteriorated for the quality of image comparing to those from the new system. Also a simple and easy measurement method for the MTF from the digital medical images can be obtained in this study.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• Journal of Korean Medicine Rehabilitation
• /
• v.32 no.1
• /
• pp.51-62
• /
• 2022

Objectives Objective of this study is to investigate the role of paraspinal muscles by examining the correlation between slip percentage (SP) of spondylolisthesis and fatty infiltration of lumbar paraspinal muscle. Methods Retrospective analysis was performed on 45 patients diagnosed with spondylolisthesis based on medical records. Using T2-weighted axial magnetic resonance imaging, cross-sectional areas (CSAs) of psoas major (PM), multifidus (MU) and erector spinae (ES) were calculated and divided by CSA of lower level vertebral body (VB). SP was measured using sagittal T2-weighted images. Correlation of SP with muscle relative cross-sectional area (RCSA) and muscle fatty infiltration by Goutallier classification was respectively analyzed using Spearman correlation. Statistic assessment conducted by Wilcoxon signed rank test and paired t-test using program GraphPad prism 5 (GraphPad Software, Inc., San Diego, CA, USA). Results Spondylolisthesis forward slip percentage by Taillard's method was negatively associated with both side MU RCSAs. No significant correlation was found between PM RCSA, ES RCSA and SP. Forward slippage was significantly correlated with fatty infiltration of lumbar paraspinal muscle measured by Goutallier classification. Conclusions This study is to understand the role of paraspinal muscle affecting spinal instability by investigating correlation between statistical deviation of lumbar muscle characters (RCSA, fatty infiltration of lumbar muscle) and SP. We found that spondylolisthesis SP is positively related to fatty infiltration of lumbar paraspinal muscle. and is negatively associated with both side MU RCSAs.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.9
• /
• pp.381-386
• /
• 2023

Many existing test case generation researchers extract test cases from models. However, research on generating test cases from natural language requirements is required in practice. For this purpose, the combination of natural language analysis and requirements engineering is very necessary. However, Requirements analysis written in Korean is difficult due to the diverse meaning of sentence expressions. We research test case generation through natural language requirement definition analysis, C3Tree model, cause-effect graph, and decision table steps as one of the test case generation methods from Korean natural requirements. As an intermediate step, this paper generates test cases from C3Tree model-based decision tables using meta-modeling. This method has the advantage of being able to easily maintain the model-to-model and model-to-text transformation processes by modifying only the transformation rules. If an existing model is modified or a new model is added, only the model transformation rules can be maintained without changing the program algorithm. As a result of the evaluation, all combinations for the decision table were automatically generated as test cases.

• Parasites, Hosts and Diseases
• /
• v.54 no.1
• /
• pp.9-14
• /
• 2016

Tamoxifen is an antagonist of the estrogen receptor and currently used for the treatment of breast cancer. The current treatment of cutaneous leishmaniasis with pentavalent antimony compounds is not satisfactory. Therefore, in this study, due to its antileishmanial activity, effects of tamoxifen on the growth of promastigotes and amastigotes of Leishmania major Iranian strain were evaluated in vitro. Promastigotes and amastigotes were treated with different concentrations (1, 5, 10, 20, and $50{\mu}g/ml$) and time periods (24, 48, and 72 hr) of tamoxifen. After tamoxifen treatment, MTT assay (3-[4,5-dimethylthiazol-2-yl]-2,5 biphenyl tetrazolium bromide assay) was used to determine the percentage of live parasites and Graph Pad Prism software to calculate $IC_{50}$. Flow cytometry was applied to investigate the induction of tamoxifen-induced apoptosis in promastigotes. The half maximal inhibitory concentration ($IC_{50}$) of tamoxifen on promastigotes was $2.6{\mu}g/ml$ after 24 hr treatment. Flow cytometry analysis showed that tamoxifen induced early and late apoptosis in Leishmania promastigotes. While after 48 hr in control group the apoptosis was 2.0%, the $50{\mu}g/L$ concentration of tamoxifen increased it to 59.7%. Based on the in vitro antileishmanial effect, tamoxifen might be used for leishmaniasis treatment; however, further researches on in vivo effects of tamoxifen in animal models are needed.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.479-490
• /
• 2009

A number of temporal abstraction approaches have been suggested so far to handle the high computational complexity of Markov decision problems (MDPs). Although the structure of temporal abstraction can significantly affect the efficiency of solving the MDP, to our knowledge none of current temporal abstraction approaches explicitly consider the relationship between topology and efficiency. In this paper, we first show that a topological measurement from complex network literature, mean geodesic distance, can reflect the efficiency of solving MDP. Based on this, we build an incremental method to systematically build temporal abstractions using a network model that guarantees a small mean geodesic distance. We test our algorithm on a realistic 3D game environment, and experimental results show that our model has subpolynomial growth of mean geodesic distance according to problem size, which enables efficient solving of resulting MDP.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.103-110
• /
• 2006

The Game development process that the Korea Game Development Infinity researches and publishes has laid important groundwork for the game industry. However, the game design cannot guarantee a software quality because an artifact is made incorrect by a game planner's new idea and modification. In this paper theorized the system to maintain artifacts consistently that is generated in planning phase and make changed contents traceable. First, it defined an ACT graph to represent relation of between artifacts, a ACT table that traces and manages it changes and a table of artifacts change history. Also, it suggested the ACT process applying as we mentioned above. Then we worked a case study to verify the change tracking technique which is presented. In a case study, we find game designer is capable to grip and modify a change of artifacts when it occurs a change of game design artifacts. As a result of that, we can save the time and effort to maintain the consistency among game design artifacts.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.926-939
• /
• 2002

The formal specification methods with probability have been demanded in the area of fault real-time systems, in order to specify the uncertainty that the systems can encounter during their execution due to various environmental factors. This paper presents a new formal method with probability. namely Probabilistic Abstract Timed Machine (PATM), in order to analyze and predict system's behavior in dynamical environmental changes, This method classifies the factors into two classes: the variable and the constant. The analysis of system's behavior is performed on the probabilistic reachability graph generated from the ATM specification for the system. The analysis can predict any possibility that the behavior may not satisfy some safety requirements of the system, indicate which variable factors cause such satisfaction, and further recover from this unsatisfying fault state by fixing the variable factors. Consequently the reliability to the fault real-time systems can be improved.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.662-668
• /
• 2001

Since the problem of disproving a tautology is as hard as the problem of proving it, no polynomial time algorithm for falsification(or testing invalidity) is feasible. Previous algorithms are mostly based on either divide-and-conquer or graph representation. Most of them demonstrated satisfactory results on a variety of input under certain constraints. However, they have experienced difficulties dealing with big input. We propose a new falsification algorithm using a Merge Rule to produce a counterexample by constructing a minterm which is not satisfied by an input expression in DNF(Disjunctive Normal Form). We also show that the algorithm is consistent and sound. The algorithm is based on a greedy method which would seek to maximize the number or terms falsified by the assignment made at each step of the falsification process. Empirical results show practical performance on big input to falsify randomized nontautological problem instances, consuming O(nm$^2$) time, where n is the number of variables and m is number of terms.