• Journal of Dental Rehabilitation and Applied Science
• /
• v.36 no.3
• /
• pp.183-195
• /
• 2020

Purpose: The purpose of this study is to compare the flexural strength of CAD/CAM denture base resins with conventional denture base resins based on their thicknesses. Materials and Methods: For the conventional denture base resins, Lucitone 199^® (C-LC) was used. DIOnavi - Denture (P-DO) and DENTCA Denture Base II (P-DC) were taken for the 3D printing denture base resins. For the prepolymerized PMMA resins, Vipi Block Gum (M-VP) and M-IVoBase^® CAD (M-IV) were used. The final dimensions of the specimens were 65.0 mm x 12.7 mm x 1.6 mm / 2.0 mm / 2.5 mm. The 3-point bend test was implemented to measure the flexural strength and flexural modulus. Microscopic evaluation of surface of fractured specimen was conducted by using a scanning electron microscope (SEM). After testing the normality of the data, one-way ANOVA was adopted to evaluate the differences among sample groups with a significance level of P = 0.05. The Tukey HSD test was performed for post hoc analysis. Results: Under the same thicknesses, there are significant differences in flexural strength between CAD/CAM denture base resins and conventional denture base resins except for P-DO and C-LC. M-VP showed higher flexural strength than conventional denture base resins, P-DC and M-IV displayed lower flexural strength than conventional denture base resins. Flexural modulus was highest in M-VP, followed by C-LC, P-DO, P-DC, M-IV, significant differences were found between all materials. In the comparison of flexural strength according to thickness, flexural strength of 2.5 mm was significantly higher than that of 1.6 mm in C-LC. Flexural strength of 2.5 mm and 2.0 mm was significantly higher than that of 1.6 mm in P-DC and M-VP. In M-IV, as the thickness increases, significant increase in flexural strength appeared. SEM analysis illustrates different fracture surfaces of the specimens. Conclusion: The flexural strength of different CAD/CAM denture base resins used in this study varied according to the composition and properties of each material. The flexural strength of CAD/CAM denture base resins was higher than the standard suggested by ISO 20795-1:2013 at a thickness of 1.6 mm or more though the thickness decreased. However, for clinical use of dentures with lower thickness, further researches should be done regarding other properties at lower thickness of denture base resins.

• Science of Emotion and Sensibility
• /
• v.15 no.3
• /
• pp.389-398
• /
• 2012

Virtual worlds have pursued reality as if they actually exist. In order to evaluate the sense of reality in the computer-simulated worlds, several subjective questionnaires, which include specific independent variables, have been proposed in the literature. However, the questionnaires lack reliability and validity necessary for defining and measuring the virtual realization. Few studies have been conducted to investigate the effect of visual factors on the sense of reality experienced by exposing to a virtual environment. Therefore, this study was aimed at reinvestigating the variables and proposing a more reliable and advisable questionnaire for evaluating the virtual realization, focusing on visual factors. Twenty-one questions were gleaned from the literature and subjective interviews with focused groups. Exploratory factor analysis with oblique rotation was performed on the data obtained from 200 participants(females: 100) after exposing to a virtual character image described in an extreme way. After removing poorly loading items, remained subsets were subjected to confirmatory factor analysis on the data obtained from the same participants. As a result, 3 significant factors were determined to efficiently measure the virtual realization. The determined factors included visual presence(3 subset items), visual immersion(7 subset items), and visual interactivity(4 subset items). The proposed factors were verified by conducting a subjective evaluation in which participants were asked to evaluate a 3D virtual eyeball model based on the visual presence. The results implicated that the measurement method was suitable for evaluating the degree of the virtual realization. The proposed method is expected to reasonably measure the degree of the virtual realization.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.329-342
• /
• 2003

Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

• Journal of radiological science and technology
• /
• v.40 no.4
• /
• pp.647-655
• /
• 2017

This study was conducted to review the mediating effects of retirement preparation in how the degree of requirements for retirement education and the degree of preparation for retirement education affects quality of life, and how the degree of participation in retirement education which is a moderating variable is moderated. The study findings show that first, in terms of the difference in quality of life across different general characteristics, those who live in a city rather than a Gun, those who had received education of graduate school or higher rather than those with an education of undergraduate university programs or lower, those who were public officers or employees of corporations rather than those who were self-employed had a higher quality of life. The group satisfied with their economic status and health status were found to be more satisfied with their quality of life. Second, a correlation analysis showed that there was a positive correlation between retirement preparation, quality of life, and degree of requirements for retirement preparation. Moreover, there was also a positive correlation between quality of life, retirement education and the degree of requirements for retirement education. There was a positive correlation between retirement education and the degree of requirements for retirement preparation. Third, participation in retirement education moderated the indirect effect that the degree of preparation for retirement education affected quality of life through the degree of retirement preparation. In other words, the degree of requirements for retirement education affects retirement preparation and affects quality of life through the indirect effects of retirement education. As such, the moderated mediating effects of retirement education on retirement preparation was found to be greater. This indicates that quality of life may also vary in accordance with the requirements for retirement education.

• Journal of Life Science
• /
• v.17 no.5 s.85
• /
• pp.678-686
• /
• 2007

Human mesenchymal stem cells(hMSC), that have been reported to be present in bone marrow, adipose tissues, dermis, muscles and peripheral blood, have the potential to differentiate along different lineages including those forming bone, cartilage, fat, muscle and neuron. Therefore, hMSC are attractive candidates for cell and gene therapy. The optimal conditions for hMSC expansion require medium supplemented with fetal bovine serum(FBS). Some forms of cell therapy will involve multiple doses, raising a concern over immunological reactions caused by medium-derived FBS proteins. Previously, we have shown that hADSC can be cultured in human serum(HS) during their isolation and expansion, and that they maintain their proliferative capacity and ability for multilineage differentiation and promote engraftment of peripheral blood-derived CD34 cells mobilized from bone marrow in NOD/SCID mice. In this study we determined whether hADSC grown in HS maintain surface markers expression similar with cells grown in FBS during culture expansion and compared gene expression profile by Affymetrix microarray. Flow cytometry analysis showed that HLA-DR, CD117, CD29 and CD44 expression in HS-cultured hADSC during culture expansion were similar with that in FBS-cultured cells. However, the gene expression profile in HS-cultured hADSC was significantly different from that in FBS-cultured cells. Therefore, these data indicated that HS-cultured hADSC should be used in vivo animal study of hADSC transplantation for direct extrapolation of preclinical data into clinical application.

• Horticultural Science & Technology
• /
• v.31 no.5
• /
• pp.531-537
• /
• 2013

The average annual and winter ambient air temperatures in Korea have risen by 0.7 and $1.4^{\circ}C$, respectively, during the last 30 years. Radish (Raphanus sativus), one of the most important cool season crops, may well be used as a model to study the influence of climatic change on plant growth, because it is more adversely affected by elevated temperatures than warm season crops. This study examined the influence of transplanting time, nitrogen fertilizer level, and climate parameters, including air temperature and growing degree days (GDD), on the performance of a radish cultivar 'Mansahyungtong' to estimate crop growth during the spring growing season. The radish seeds were sown from April 24 to May 22, 2012, at internals of 14 days and cultivated with 3 levels of nitrogen fertilization. The data from plants sown on April 24 and May 8, 2012 were used for the prediction of plant growth as affected by planting date and nitrogen fertilization for spring production. In our study, plant fresh weight was higher when the radish seeds were sown on $24^{th}$ of April than on $8^{th}$ and $22^{nd}$ of May. The growth model was described as a logarithmic function using GDD according to the nitrogen fertilization levels: for 0.5N, root dry matter = 84.66/(1+exp (-(GDD - 790.7)/122.3)) ($r^2$ = 0.92), for 1.0N, root dry matter = 100.6/(1 + exp (-(GDD - 824.8)/112.8)) ($r^2$ = 0.92), and for 2.0N, root dry matter = 117.7/(1+exp (-(GDD - 877.7)/148.5)) ($r^2$ = 0.94). Although the model slightly tended to overestimate the dry mass per plant, the estimated and observed root dry matter and top dry matter data showed a reasonable good fit with 1.12 ($R^2$ = 0.979) and 1.05 ($R^2$ = 0.991), respectively. Results of this study suggest that the GDD values can be used as a good indicator in predicting the root growth of radish.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.30 no.5
• /
• pp.993-999
• /
• 2001

The purpose of the study was to develop a nutritional counseling program using expert system to assist obese people to lose weight through behavior modification in the internet. The counseling internet program for weight loss was developed by the accumulation of knowledge for dealing with eating habits and exercising behaviors into expert system tool, Knowledge Engineering Agent (KEA) by a dietitian without any help of computer expert. KEA was built based on the theory of Multiple Classification Ripple Down Rules. To accumulate knowledge into KEA, survey was performed in 150 obese people, the dietitian reviewed and consulted each survey case, and the consulted contents were learned and accumulated into KEA. Survey questionnaires were the same as those of the internet consulting program, and they included general characteristics, dietary habits, lifestyle, and exercise patterns related to obesity. KEA was used for nutritional counseling of obese people after KEA had enough knowledge for weight loss based on behavior modification by the dietitian. To accumulate knowledge to KEA, the dietitian selected proper factors inferred from the survey questionnaire of each case, and added the conclusions for them. Conclusions were made for helping clients to correct bad eating behaviors and accumulate good behaviors for losing weight. When clients answered survey questionnaires in a counseling internet program, KEA gave the recommendation how to eat, to exercise and the deal with stress in a real time for each case. If KEA did not have enough knowledge for a specific case, the conclusion window wrote no conclusion and the dietitian needed to add conclusions for the case. The conclusions for the new case added to the KEA knowledge base. In conclusions, a counseling internet program for weight reduction can be used for give advices how to deal with obesity in a man-to-man way in a real time using KEA where nutritional knowledge based on behavior modification for weight loss was accumulated.