60 research outputs found
Physical/mechanical properties and microstructure of dental lithium disilicate ceramics for chairside CAD/CAM restoration
ํ์๋
ผ๋ฌธ (๋ฐ์ฌ)-- ์์ธ๋ํ๊ต ๋ํ์ : ์น์ํ๊ณผ, 2014. 2. ์ํธํ.1. ๋ชฉ์
์ต๊ทผ ํ๋ฒ์ ๋ด์์ผ๋ก ์ฌ๋ฏธ์ ์๋ณต์น๋ฃ๋ฅผ ์๋ฃํ ์ ์๋ CAD/CAM์ ์ด์ฉํ ์๋ณต์ ๋ํ ๊ด์ฌ์ด ๋๊ณ ์๋ค. ๋ณธ ์ฐ๊ตฌ์ ๋ชฉ์ ์ ๋ ๊ฐ์ง ์์ฉํ๋ CAD/CAM์ฉ ๋ฆฌํฌ๋ค์ด์ค๋ฆฌ์ผ์ดํธ ์ธ๋ผ๋ฏน์ ๋ฌผ๋ฆฌ/๊ธฐ๊ณ์ ํน์ฑ์ ๋น๊ตํ๊ณ ๊ฒฐ์ ์ ๋ฏธ์ธ ๊ตฌ์กฐ๋ฅผ ๊ด์ฐฐํ๋ ๊ฒ์ด๋ค.
2. ์ฌ๋ฃ ๋ฐ ๋ฐฉ๋ฒ
IPS e.max CAD (Ivoclar Vivadent)์ Rosetta SM (Hass)์ ์ด์ํ ํ์ฑ ๊ณ์ (n=5), ์ด์ถ ๊ตด๊ณก ๊ฐ๋ (n=30), ํ๋ฉด ๊ฒฝ๋ (n=10), ํ๊ดด ์ธ์ฑ (n=3), ์ดํฝ์ฐฝ ๊ณ์ (n=2)๋ฅผ ์ธก์ ํ์ฌ ๋น๊ตํ๊ณ , ๊ฒฐ์ ์ ๋ฏธ์ธ๊ตฌ์กฐ๋ฅผ ๊ด์ฐฐํ๊ธฐ ์ํด ์ ๊ณ ๋ฐฉ์ถ ์ฃผ์ฌ ์ ์ ํ๋ฏธ๊ฒฝ ์ดฌ์๊ณผ X์ ํ์ ๋ถ์์ ํ์๋ค. ์ด์ถ ๊ตด๊ณก ๊ฐ๋์ ํ๋ฉด ๊ฒฝ๋์ ํ๊ท ๊ฐ ๋ถ์์ ์ํด ์ด์๋ถ์ฐ๋ถ์์ ์ํํ์๋ค. ์ดํ ์ด์ถ ๊ตด๊ณก ๊ฐ๋๋ ์ฃผํจ๊ณผ๋ฅผ ๋ถ์ํ๊ธฐ ์ํด Students t-test๋ฅผ ์ฌ์ฉํ์์ผ๋ฉฐ, ํ๋ฉด ๊ฒฝ๋๋ ์ฌํ ๋ถ์์ ์ํด Tukey HDS๋ฅผ ์ฌ์ฉํ์๋ค. ํ์ฑ ๊ณ์์ ํ๊ดด ์ธ์ฑ์ ํ๊ท ๊ฐ ๋ถ์์๋ ์ด์ฒ๋ฆฌ์ ๋ฐ๋ฅธ ์ฐจ์ด ๋ถ์์ ์ํด Wilcoxon signed rank test ๋ฅผ ์ฌ์ฉํ์์ผ๋ฉฐ, ์ฌ๋ฃ์ ๋ฐ๋ฅธ ์ฐจ์ด๋ฅผ ๋ถ์ํ๊ธฐ ์ํด Mann-Whitney U test๋ฅผ ์ฌ์ฉํ์๋ค. ํ๊ดด ์ธ์ฑ์ ํ๊ท ๊ฐ ๋ถ์์ ์ํด Mann-Whitney U test๋ฅผ ์ฌ์ฉํ์๋ค (ฮฑ = 0.05).
3. ๊ฒฐ๊ณผ
์ด์ํ ํ์ฑ ๊ณ์๋ ์ด์ฒ๋ฆฌ ์ ํ ๋ชจ๋ IPS e.max CAD๊ฐ Rosetta SM๋ณด๋ค ํต๊ณ์ ์ผ๋ก ์ ์ํ ์์ค์ผ๋ก ๋์ ์์น๋ฅผ ๋ํ๋๋ค. ๊ตด๊ณก ๊ฐ๋๋ ์ด์ฒ๋ฆฌ ์ ๊ณผ ํ์์ ๋ ์ฌ๋ฃ ์ฌ์ด์ ํต๊ณ์ ์ผ๋ก ์ ์ํ ์ฐจ์ด๊ฐ ์์์ผ๋, ์ด์ฒ๋ฆฌ ์ , ํ์ ๋น๊ต์์๋ ๋ ์ฌ๋ฃ ๋ชจ๋ ํต๊ณ์ ์ผ๋ก ์ ์ํ ์์ค์ผ๋ก ์ฆ๊ฐํ์๋ค. ํ๋ฉด ๊ฒฝ๋ ์ธก์ ๊ฐ์ IPS e.max CAD์ ๊ฒฝ์ฐ ์ด์ฒ๋ฆฌ ํ ์ ์ํ๊ฒ ์ค์ด๋ค์์ผ๋ฉฐ, ๋ฐ๋๋ก Rosetta SM์ ์ฆ๊ฐํ์๋ค. ๋ ์ฌ๋ฃ๋ฅผ ๋น๊ตํ๋ฉด ์ด์ฒ๋ฆฌ ์ ์๋ IPS e.max CAD๊ฐ ๋๊ฒ ๋ํ๋ฌ๊ณ , ์ด์ฒ๋ฆฌ ํ์๋ Rosetta SM์ด ๋๊ฒ ๋ํ๋ฌ๋ค. ์ด๋ฅผ ํ ๋๋ก ๊ตฌํ ํ๊ดด ์ธ์ฑ ํ๊ท ๊ฐ์ ๋ ์ฌ๋ฃ ๋ชจ๋ ์ด์ฒ๋ฆฌ ํ ํ์ ํ ์ฆ๊ฐ๋จ์ ๋ณผ ์ ์์์ผ๋ฉฐ, IPS e.max CAD๊ฐ ์ฝ๊ฐ์ฉ ๋์ ๊ฐ์ ๋ํ๋์ผ๋ ํต๊ณ์ ์๋ฏธ๋ฅผ ์ฐพ๊ธฐ๋ ์ด๋ ค์ ๋ค. ์ ๊ณ ๋ฐฉ์ถ ์ฃผ์ฌ ์ ์ ํ๋ฏธ๊ฒฝ๊ณผ ์์ค์ ํ์ ๋ถ์ ๊ฒฐ๊ณผ ๋ ์ ํ์ ๊ฒฐ์ ์ ์ข
๋ฅ๋ ํํ๋ ์ ์ฌํ์์ผ๋ ํฌ๊ธฐ๋ ์ด์ฒ๋ฆฌ ํ์ Rosetta SM์ด ์กฐ๊ธ ๋ ์๊ณ ์กฐ๋ฐํ ๋ชจ์ต์ด์๋ค. ์ด๋ฌํ ๊ฒฐ๊ณผ์ ๊ธฐ์ดํ์ฌ ์์๊ฐ๋ค์ ์ง๋ฃ์ค์์ CAD/CAM์ ์ฌ์ฉํ ๋ฆฌํฌ ๋ค์ด์ค๋ฆฌ์ผ์ดํธ ๊ธ๋ผ์ค ์ธ๋ผ๋ฏน ์๋ณต๋ฌผ์ ์ ์ํ ๋ ์ฌ๋ฃ ์ ํ์ ํญ์ ๋๋ฆด ์ ์์ ๊ฒ์ด๋ผ ๊ธฐ๋๋๋ค.์๋ก 1
์ฌ๋ฃ ๋ฐ ๋ฐฉ๋ฒ
์ฌ๋ฃ ๋ฐ ์ํธ ์ ์ 6
์คํ ๋ฐฉ๋ฒ
1) ์ด์ํ ํ์ฑ ๊ณ์ ์ธก์ 7
2) ์ด์ถ ๊ตด๊ณก ๊ฐ๋ ์ธก์ 8
3) ํ๋ฉด ๊ฒฝ๋ ์ธก์ 9
4) ํ๊ดด ์ธ์ฑ ์ธก์ 10
5) ์ ๊ณ ๋ฐฉ์ถ ์ฃผ์ฌ ์ ์ ํ๋ฏธ๊ฒฝ ๊ด์ฐฐ 10
6) ์์ค์ ํ์ ๋ถ์ 10
7) ์ดํฝ์ฐฝ ๊ณ์ ์ธก์ 11
8) ํต๊ณ ๋ถ์ 11
๊ฒฐ๊ณผ 12
์ด๊ด ๋ฐ ๊ณ ์ฐฐ 16
๊ฒฐ๋ก 20
์ฐธ๊ณ ๋ฌธํ 21
Abstract 26Docto
A Solution Methodology for DistributedInformation System Configuration Problem Simultaneously Considering File Allocation and Computer Location Assignment
We have undertaken to develop an efficient solution methodology to adress distributed information system configuration problems through mathematical programming. We have simultaneously considered file allocation and computer location assignment problems which are two aspects of the design tighly coupled in a distributed computer system. A model for solving the problem is shown to be a class of nonlinearinteger programming problems and procedures are developed for computing its lower bound. A heuristic algorithm is also developed and some results are obtained. Numerical results yield practical low cost solutions with substantial savings in computer processing time
An Efficient Workflow Management Scheme with Explicit Business Rules
In this paper, we have identified and classified
various workflow operational rules. There are many
business rules involved in the operation of workflow
systems within the enterprise business environments.
The rules are defined as ECA (Event-Condition-
Action) rules and integrated with workflow systems
with the active DB technology. Operational rules are
categorized into task dispatching rules, dynamic
process adaptation rules, exception handling rules,
event-based monitoring rules, and external domain
business rules. By adopting rule-based approach, the
modification of business rules for process management
can be easier. With the explicit management of
business rules, the reasoning process of organizations
can be formalized and managed transparently, which
enables rapid and clear decision-making
Resource Allocation Algorithm for Differentiated Multimedia Services Using Game Theory
๋ณธ ๋
ผ๋ฌธ์ 2008๋
๋ ํ๊ตญ๊ฒฝ์๊ณผํํ ์ถ๊ณํ์ ๋ํ ๊ฒฝ์๋ถ๋ฌธ(์ด๋ก ) ์์๋
ผ๋ฌธ์ผ๋ก ์์ ์ ์ฌ์ฌ๊ณผ์ ์ ๊ฑฐ์ณ ๊ฒ์ฌ
์ถ์ฒ๋์์.Game theory is adapted to a variety of domains such as economics, biology, engineering, political science, computer
science, and philosophy in order to analyze economic behaviors. This research is an application of game theory to
wireless communication. In particular, in terms of bargaining game we dealt with a multimedia resource allocation
problem in wireless communication, which is rapidly spreading such as Wibro, WCDML, IPTV, etc. The algorithm is
assumed to allocate multimedia resources to users who can choose and access differentiated media services. For
this purpose, a utility function of users is devised to reflect quality of service (QoS) and price. We illustrated experimental
results with synthesis data which were made to mimic real multimedia data, and analyzed differentiated
service providing and the effect of the utility function.๋ณธ ์ฐ๊ตฌ๋ ์ง์๊ฒฝ์ ๋ถ ๋ฐ ์ ๋ณดํต์ ์ฐ๊ตฌ์งํฅ์์ IT์์ฒ๊ธฐ์ ๊ฐ๋ฐ์ฌ์
(IITA-2008-F-005-01)์ ์ง์์ผ๋ก ์ํ๋์์
A Rich Web Search Mechanism using Linkage Information
๊ธฐ์กด์ ์น ๊ฒ์ ์์คํ
์ ์ฃผ์ด์ง ํค์๋๋ค์ ๋ชจ๋ ํฌํจํ ์น ํ์ด์ง์ ๋์ถ์ ๋ชฉํ๋ก ํ๊ธฐ ๋๋ฌธ์, ๊ฒ
์์ด์ popularity๊ฐ ๋จ์ด์ง๋ ๊ฒฝ์ฐ๋, ํค์๋์ ํ์ ์ ๋๊ฐ ๊ณผ๋ํ๊ฑฐ๋ ๋ง์์ง๋ ๊ฒฝ์ฐ, ๋๋ ํค์๋๊ฐ ๊ธธ
์ด์ง๋ ๊ฒฝ์ฐ ๋ฑ์๋ ๊ฒ์๊ฒฐ๊ณผ๊ฐ ํฌ๊ฒ ์ค์ด๋๋ ๊ฒฐ๊ณผํฌ์์ฑ ๋ฌธ์ (scarcity problem)๋ฅผ ๊ฒช๊ฒ ๋๋ค. ๋ณธ ์ฐ๊ตฌ์
์๋ ์ด๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํด์ ๊ฒ์๊ฒฐ๊ณผ๋ฅผ ๊ฐ๋ณ ์นํ์ด์ง ์งํฉ์ด ์๋ ๊ด๋ จ ์นํ์ด์ง๋ค๊ฐ์ ๋งํฌ ๊ตฌ์กฐ๋ก ๋
์ถํด์ฃผ๋ ํ์ฅ๋ ๊ฒ์ ๋ฐฉ๋ฒ์ ์ ์ํ๋ค. ํ์ฅ๋ ์น ๊ฒ์์ ๋งํฌ๊ธฐ๋ฐ ๋ถ์์ ํ์ฉํ์ฌ ๊ฐ๋ณ ์ง์๋ค์ ๋
ํ ๊ฒ์ ๊ฒฐ๊ณผ ํ์ด์ง๋ค๊ฐ์ ๋งํฌ ๊ด๊ณ๋ฅผ ํ์ํ๊ณ , ๋์ถ๋ ๊ฒ์ ๊ฒฐ๊ณผ์ ์์ ์ธก์ ์ ํตํด ์ด๋ฃจ์ด์ง๋ค. ๋ณธ
์ฐ๊ตฌ์์ ์ ์ํ๋ ํ์ฅ๋ ์น ๊ฒ์ ๋ฐฉ๋ฒ์ ๊ฒฐ๊ณผํฌ์์ฑ ๋ฌธ์ ์ ํจ๊ณผ์ ์์ ๋ณด์๋ค
๋ค์ค๋ถ๋ฅ ๋ฌธ์ ๋ฅผ ์ํ ์ด์ง์ ์์๋ธ ํ์ต
ํ์๋
ผ๋ฌธ (๋ฐ์ฌ)-- ์์ธ๋ํ๊ต ๋ํ์ : ์ฐ์
๊ณตํ๊ณผ, 2015. 8. ์กฐ์ฑ์ค.In data mining, classification is a type of supervised learning task that involves predicting output variables consisting of a finite number of categories called classes. When the number of classes is larger than two, a classification problem is called a multi-class classification problem. Multi-class classification provides more informative predictions, and is more related to real-world scenarios. In practice, the performance for a multi-class classification problem is typically measured according to the following three perspectives: accurate, reliable, and fast classification. In order to achieve the better performance for the three perspectives, this dissertation proposes to use heterogeneous ensemble learning that exploits multiple classifiers from various classification algorithms, where each classifier plays a different role to accomplish the desired functionality. For accurate multi-class classification, Diversified One-Against-One (DOAO) and Optimally Diversified One-Against-One (ODOAO) are proposed. Their main idea is to decompose the original problem into several binary sub-problems based on the one-against-one approach. DOAO finds the best classification algorithm for each class pair from the set of heterogeneous base classifiers, thereby makes various classification algorithms to complement each other. Since the best classification algorithm for each class pair is different, DOAO enables better classification accuracy. ODOAO, an extension of DOAO, construct an ensemble where a meta-classifier effectively combines the outputs from all the heterogeneous base classifiers. Heterogeneous Ensemble of One-class Classifiers (HEOC) is also proposed for accurate classification based on decomposition of the original problem into several one-class sub-problems. HEOC constructs an ensemble consisting of one-class classifiers from various one-class classification algorithms. HEOC addresses the normalization of heterogeneous base classifiers via stacking. For reliable multi-class classification, a hybrid reject option is proposed to reject ambiguous instances instead of predicting for all instances. The hybrid reject option constructs a filter classifier and a predictor classifier separately, where the filter decides whether to predict using the predictor based on the confidence for an instance, and the predictor predicts the class of the instance. Each component is trained using the best respective classification algorithm to maximize the capability of its role, thereby improve reject option performance as providing better prediction accuracy for the same degree of rejection. For fast multi-class classification, Neural Network Approximator (NNA) is proposed to reduce computational time in the test phase. NNA approximates a classifier by adopting a multiple-outputs artificial neural network as a function approximator, where each output node corresponds to a decision function in the classifier. This approximator enables fast classification speed without compromising accuracy. The effectiveness of the proposed heterogeneous ensemble methods is demonstrated through experiments on benchmark datasets and real-world applications.1. Introduction
2. Literature Review
3. Heterogeneous Ensemble for Accurate Classification: Binary Classifier Approach
4. Heterogeneous Ensemble for Accurate Classification: One-class Classifier Approach
5. Heterogeneous Ensemble for Reliable Classification
6. Heterogeneous Ensemble for Fast Classification
7. ConclusionDocto
์ ์๊ณํ๋ฒ์ ์ด์ฉํ ํ๋ก์ ํธ ํ์ฅ์์๊ฒฐ์ ์ ๊ดํ ์ฐ๊ตฌ
Planning for the expansion of production capacity is of vital importance in many applications
within the private and public sectors. This paper considers a sequencing expansion
problem in which capacity can be added only at discrete points in time.
Given the demand forecast of each period, capacity and cost of each expansion project,
we are to determine the sequence of expansion necessary to provide sufficient capacity to
meet the demand in all periods at minimum cost. This problem is formulated as a pure integer
programming and solved by branch and bound method using Lagrangian relaxation.
At first. simple sequencing expansion problem is presented, and in the latter part,
extension to include precedence between projects is suggested
Studies on the intracellular distribution of myocardial catecholamines of normal animals
์ํ๊ณผ/์์ฌ[ํ๊ธ]
[์๋ฌธ]
Accumulated evidence indicates that the catecholamines are stored as granule
within the celles of adrenal medulla or sympathetic nervous tissues. Myocardial
catecholmines have been shown to be present in the particulate fraction as well as
in the soluble fraction obtained by differential centrifugation of cell free
suspension from homogenates of cardiac muscle (Potter and Axelrod, 1962; Wegman and
Kako, 1962; Campos Shideman, 1962). Howere, according to these investigatore the
ratio to that in the soluble fraction of myocardium varies considerably. This may
be attributed to a species and fraction procedure difference.
Present experiment was designed to determine the intracellular distribution of
myocardial catecholamines, with special reference to the animal species.
The heart was rapidly removed from animals under ether anesthesia and 5 volumes
of 0.38 M ice-cold sucose in a waring blender. The resultant suspension was passed
through a double layer of gauze to remove the fibrous tissue. The homogenate was
then centrifuged at 3-5โ for 10 minutes at 600 xg (low-speed centrifugation),
which brought down incompletely fragmented cells and nucli. A low-speed supernatant
was thus obtained, and was again centrifuged at 3-5โ for 30 minutes at 15,000 xg
(high-speed centrifugation), which fractionated into supernatant and sediment. The
concentration of catecholamines in each fraction obtained by the above differential
centrifugation, was determined spectrophotofluormetrically by the modified
procedure of the method described by Shore and Olin (1958).
1. Examination of the intracellular distribution of the myocardial catecholamines
of normal rabbits showed that a higher concentration of the aminos was present in
the high-speed supernatant fraction (0.40ug/gm) and the ratio of
supernatant/sediment was 4. The catecholamines present in the low-speed supernatant
was almost completely recovered in both fractions obtained by high-speed
centrifugation.
2. In the cardiac homogenate of normal cats, a similar intracellular distribution
of catecholamines was observed. Thus, the concentrations of amines in high-speed
supernatant and sediment were 0.48 and 0.09ug/gm respectively.
3.In the experiment with cardiac homogenate of normal rate, it was also found
that higher concentration of catecholamines was present in the high-speed
supernatant and the ratio of supernatant/sediment was 4.3 which was not
significantly different from those observed in the cardiac homogenates of normal
rabbits or cats.
The concentrations of catecholamines in the high-speed supernatant and sediment
fractions would not represent the actual distribution in vivo. However, these
values are reproducible and relatively constant under the described experimental
conditions. Therefore, these may be considered useful as a criteria for the study
of intracellular distribution of myocardial catecholamines. From the above results,
it may be concluded that there is no significant difference in the intracellular
distribution of myocardial catecholamines of normal rabbits, cats and rats.restrictio
- โฆ