Does an incremental filling technique reduce polymerization shrinkage stresses

It is widely accepted that volumetric contraction and solidification during the polymerization process of restorative composites in combination with bonding to the hard tissue result in stress transfer and inward deformation of the cavity walls of the restored tooth. Deformation of the walls decreases the size of the cavity during the filling process. This fact has a profound influence on the assumption-raised and discussed in this paper-that an incremental filling technique reduces the stress effect of composite shrinkage on the tooth. Developing stress fields for different incremental filling techniques are simulated in a numerical analysis. The analysis shows that, in a restoration with a well-established bond to the tooth-as is generally desired-incremental filling techniques increase the deformation of the restored tooth. The increase is caused by the incremental deformation of the preparation, which effectively decreases the total amount of composite needed to fill the cavity. This leads to a higher-stressed tooth-composite structure. The study also shows that the assessment of intercuspal distance measurements as well as simplifications based on generalization of the shrinkage stress state cannot be sufficient to characterize the effect of polymerization shrinkage in a tooth-restoration complex. Incremental filling methods may need to be retained for reasons such as densification, adaptation, thoroughness of cure, and bond formation. However, it is very difficult to prove that incrementalization needs to be retained because of the abatement of shrinkage effects.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Uniqueness criteria for continuous-time Markov chains with general transition structures

We derive necessary and sufficient conditions for the existence of bounded or summable solutions to systems of linear equations associated with Markov chains. This substantially extends a famous result of G. E. H. Reuter, which provides a convenient means of checking various uniqueness criteria for birth-death processes. Our result allows chains with much more general transition structures to be accommodated. One application is to give a new proof of an important result of M. F. Chen concerning upwardly skip-free processes. We then use our generalization of Reuter's lemma to prove new results for downwardly skip-free chains, such as the Markov branching process and several of its many generalizations. This permits us to establish uniqueness criteria for several models, including the general birth, death, and catastrophe process, extended branching processes, and asymptotic birth-death processes, the latter being neither upwardly skip-free nor downwardly skip-free.

Bivariate distribution modeling with tree diameter and height data

The Logit-Logistic (LL), Johnson's SB, and the Beta (GBD) are flexible four-parameter probability distribution models in terms of the (skewness-kurtosis) region covered, and each has been used for modeling tree diameter distributions in forest stands. This article compares bivariate forms of these models in terms of their adequacy in representing empirical diameter-height distributions from 102 sample plots. Four bivariate models are compared: SBB, the natural, well-known, and much-used bivariate generalization of SB; the bivariate distributions with LL, SB, and Beta as marginals, constructed using Plackett's method (LL-2P, etc.). All models are fitted using maximum likelihood, and their goodness-of-fits are compared using minus log-likelihood (equivalent to Akaike's Information Criterion, the AIC). The performance ranking in this case study was SBB, LL-2P, GBD-2P, and SB-2P