• Restorative Dentistry and Endodontics
• /
• v.26 no.1
• /
• pp.32-40
• /
• 2001

The aim of this study was to evaluate the effect of various polymerization techniques on the microleakage of compomer restorations. Fifty extracted human premolars and molar were used and randomly divided into 5 groups. After cavity preparation, compomer (F2000$^{\circledR}$) was filled according to the manufacturer's directions. All groups, except group 5, were filled using an incremental technique. Group 1 was polymerized for 40 seconds at a continuous 485mW/$\textrm{cm}^2$ with a VIP$^{\circledR}$(Bisco, USA) light cure unit. Group 2 was polymerized for 20 seconds at 345mW/$\textrm{cm}^2$ and then for 20 seconds at 645mW/$\textrm{cm}^2$ with the VIP equation omitted light cure unit. Group 3 was polymerized at 400mW/$\textrm{cm}^2$, gradually increased to 50mW/$\textrm{cm}^2$ 10 seconds until 550mW/$\textrm{cm}^2$ was reached; total 40 seconds with a Spectrum 800$^{\circledR}$ (Dentsply Caulk, USA) light cure unit. Group 4 was polymerized for 3 seconds using an incremental technique with a Flipo$^{\circledR}$ (LOKKi, France) light cure unit. Group 5 was polymerized for 3 seconds using a bulk fill technique with the Flipo$^{\circledR}$ light cure unit. The specimens were embedded with acrylic resin, and were sectioned with diamond saws in a mesiodistal direction along the longitudinal axis of the tooth so as to pass through the center of the restoration, and three surfaces (occlusal, pulpal, and gingival) were examined with SEM. The results were as follows ; 1. Group 5 showed a significantly larger gaps compared to other groups on the gingival, occlusal, and pulpal walls. 2. All groups except group 5 had no statistically significant gap on the gingival, occlusal, and pulpal walls. 3. There was no significant correlation between the amount of enamel on the gingival and occlusal walls and polymerization shrinkage.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

Time series of conventional prediction techniques uses the model which is generated from the training step. This model is applied to new input data without any change. If this model is applied directly to stream data, the rate of prediction accuracy will be decreased. This paper proposes an stream data prediction technique using sliding window and regression. This technique considers the characteristic of time series which may be changed over time. It is composed of two steps. The first step executes a fractional process for applying input data to the regression model. The second step updates the model by using its information as new data. Additionally, the model is maintained by only recent data in a queue. This approach has the following two advantages. It maintains the minimum information of the model by using a matrix, so space complexity is reduced. Moreover, it prevents the increment of error rate by updating the model over time. Accuracy rate of the proposed method is measured by RME(Relative Mean Error) and RMSE(Root Mean Square Error). The results of stream data prediction experiment are performed by the proposed technique IMQR(Incremental Multiple Quadratic Regression) is more efficient than those of MLR(Multiple Linear Regression) and SVR(Support Vector Regression).

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.162-171
• /
• 1999

Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.10a
• /
• pp.28-31
• /
• 1997

Buckling analysis of thin compressed beam has been carried out. Pre-buckling and post-buckling are simulated by finite element method incorporating with the incremental nonlinear theory and the Newton-Raphson solution technique. In order to find the bifurcation point, the determinent of the stiffness matrix is calculated at every iteration procedure. For post-buckling analysis, a small perturbed initial guess is given along the eigenvector direction at the bifurcation point. Nonlinear elastic buckling and elastic-plastic buckling of cantilever beam are analyzed. The buckling load and buckled shape of the two models are compared.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.643-645
• /
• 2005

클러스터링은 무질서한 데이터들의 상호 연관 관계를 정의하고, 이를 통하여 보다 체계적으로 데이터를 군집화하는 것이다. 클러스터링을 적용한 웹 서비스 시스템은 비슷한 내용을 묶어 제공하기 때문에 사용자는 보다 효율적으로 정보를 제공받을 수 있다. 시멘틱 웹의 기반이 되는 온톨로지는 클러스터링을 위한 완벽한 입력 데이터를 제공한다. 본 논문은 온톨로지를 기반의 메타 데이터를 클러스터링 하기 위한 기법을 제안한다. 본 논문의 목적은 온톨로지 기반의 메타 데이터들의 유사성을 측정하기 위한 평가함수를 정의하고, 이러한 평가함수를 적용한 계층적 클러스터링 알고리즘을 연구하는 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.496-498
• /
• 2003

본 논문에서 최신구간을 활용하여 패턴의 최신성을 보장하고 최신구간내 패턴의 누락 없이 모든 패턴을 발견할 수 있는 점진적 로그 분석 기법을 제안한다. 즉, 주기마다 최신구간이 이동되면서, 동시에 패턴의 최신성 여부가 결정되고, 이동된 최신구간내 패턴이 될 후보 패턴을 미리 예측하여 보다 합리적인 패턴 관리할 수 있다. 따라서 일반적인 점진적 로그 분석 기법에서 간과된 대량의 로그에 숨겨진 패턴은 적어도 해당 최신구간내에서 모두 발견될 수 있고 최신성도 보증된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.883-884
• /
• 2009

프로그램 개발 단계에서 소요되는 비용을 최소화하기 위해 점진 평가 방법이 사용되고 있다. 점진 평가는 프로그램을 모두 다시 평가하는 대신 수정한 부분과 그 부분에 영향 받는 부분만을 다시 평가하는 방법으로 프로그램의 실행 효율성을 향상시킬 수 있는 중요 분야이다. 본 논문에서는 자바 같은 언어에서 확장된 종속차트의 종속 링크를 사용해 변수의 값이 변경되었을 때 그 부분에 영향 받는 부분을 찾아내는 변화 추적 과정을 통하여 효율적인 점진 평가를 수행할 수 있는 방법을 제시한다. 모의실험을 통해 점진 평가의 효율성을 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.433-436
• /
• 2008

프로그램의 생산성을 향상시키기 위해 프로그램 개발 단계에서 소요되는 비용을 최소화하려는 목적으로 점진 평가를 사용하고 있다. 점진 평가는 전체 프로그램을 다시 평가하는 대신 수정한 부분과 그 부분에 영향 받는 부분만을 다시 평가하는 방법이다. 본 논문에서는 기존의 종속 차트(dependency chart)를 확장하여 객체 지향언어인 자바 같은 언어에서 점진 평가를 수행할 수 있도록 확장된 종속 차트를 제시한다. 객체 지향언어에서 점진 평가를 수행하는 알고리즘을 제시하고 실험을 통해 점진 평가의 효율성을 분석한다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.41 no.3
• /
• pp.181-186
• /
• 2017

Single point incremental forming (SPIF) is a sheet-forming technique. It is a die-less sheet metal manufacturing process for rapid prototyping and small batch production. The Critical parameters in the forming process include tool diameter, step depth, feed rate, spindle speed, etc. In this study, these parameters and the die shape corresponding to the Varying Wall Angle Conical Frustum(VWACF) model were used for forming 0.8mm in thick Al5052-O sheets. The Taguchi method of Experiments of Design (DOE) and Grey relational optimization were used to determine the optimum parameters in SPIF. A response study was performed on formability, spring back, and thickness reduction. The research shows that the optimum combination of these parameters that yield best performance of SPIF is as follows: tool diameter, 6mm; spin speed, 60rpm; step depth, 0.3mm; and feed rate, 500mm/min.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

Association rule discovery is a method of mining for the associated item set on large databases based on support and confidence threshold. The discovered association rules can be applied to the marketing pattern analysis in E-commerce, large shopping mall and so on. The association rule discovery makes multiple scan over the database storing large transaction data, thus, the algorithm requiring very high overhead might not be useful in real-time association rule discovery in dynamic environment. Therefore this paper proposes an active candidate set management model based on trigger and incremental update mechanism to overcome non-realtime limitation of association rule discovery. In order to implement the proposed model, we not only describe an implementation model for incremental updating operation, but also evaluate the performance characteristics of this model through the experiment.