Efficacy of Profile .04 taper series 29 in removing filling materials during root canal retreatment-an in vitro study

Objective. The aim of this study was to compare Profile .04 taper series 29 instruments and hand files for gutta-percha removal. Study design. Twenty maxillary central incisors with a single straight canal were instrumented and filled. The teeth were divided into 2 groups of 10 specimens each, according to gutta-percha removal techniques: Group 1- Profile series 29 and Group 2- hand files and solvent. The amount of time for gutta-percha removal and the number of fractured instruments were evaluated. Radiographs were taken and the teeth were grooved longitudinally and split. The area of residual debris was measured using computer software. Results. The time for filling material removal was significantly shorter when Profile series 29 was used (P = .00). Regarding cleanliness, there were no statistical differences in the teeth halves evaluations (P = .05). Hand instruments cleaned the canals significantly better than Profiles, in the radiographic analysis considering the whole canal. Overall, the radiographic analysis showed a smaller percentage of residual debris than the teeth halves analysis. Conclusion. The Profile series 29 instruments proved to be faster than hand instruments in removing root filling materials; however, hand instruments yielded better root canal cleanliness. Some residual debris was not visualized by radiographs. (Oral Surg Oral Med Oral Pathol Oral Radiol Endod 2009; 108: e46-e50)

The effects of normalisation on the ability of business end-users to detect data anomalies: An experimental evaluation

With the proliferation of relational database programs for PC's and other platforms, many business end-users are creating, maintaining, and querying their own databases. More importantly, business end-users use the output of these queries as the basis for operational, tactical, and strategic decisions. Inaccurate data reduce the expected quality of these decisions. Implementing various input validation controls, including higher levels of normalisation, can reduce the number of data anomalies entering the databases. Even in well-maintained databases, however, data anomalies will still accumulate. To improve the quality of data, databases can be queried periodically to locate and correct anomalies. This paper reports the results of two experiments that investigated the effects of different data structures on business end-users' abilities to detect data anomalies in a relational database. The results demonstrate that both unnormalised and higher levels of normalisation lower the effectiveness and efficiency of queries relative to the first normal form. First normal form databases appear to provide the most effective and efficient data structure for business end-users formulating queries to detect data anomalies.

An in vitro study of non-axial forces upon the retention of an O-ring attachment

Objective The purpose of this study was to evaluate the retention force of an O-ring attachment system in different inclinations to the ideal path of insertion, using devices to compensate angulations. Material and methods Two implants were inserted into an aluminum base, and ball attachments were screwed to implants. Cylinders with O-rings were placed on ball attachments and connected to the test device using positioners to compensate implant angulations (0 degrees, 7 degrees, and 14 degrees). Plexiglass bases were used to simulate implant angulations. The base and the test device were positioned in a testing apparatus, which simulated insertion/removal of an overdenture. A total of 2900 cycles, simulating 2 years of overdenture use, were performed and 36 O-rings were tested. The force required for each cycle was recorded with computer software. Longitudinal sections of ball attachment-positioner-cylinder with O-rings of each angulation were obtained to analyze the relationship among them, and O-ring sections tested in each angulation were compared with an unused counterpart. A mixed linear model was used to analyze the data, and the comparison was performed by orthogonal contrasts (alpha=0.05). Results At 0 degrees, the retention force decreased significantly over time, and the retention force was significantly different in all comparisons, except from 12 to 18 months. When the implants were positioned at 7 degrees, the retention force was statistically different at 0 and 24 months. At 14 degrees, significant differences were found from 6 and 12 to 24 months. Conclusions Within the limitations of this study, it was concluded that O-rings for implant/attachments perpendicular to the occlusal plane were adequately retentive over the first year and that the retentive capacity of O-ring was affected by implant inclinations despite the proposed positioners. To cite this article:Rodrigues RCS, Faria ACL, Macedo AP, Sartori IAM, de Mattos MGC, Ribeiro RF. An in vitro study of non-axial forces upon the retention of an O-ring attachment.Clin. Oral Impl. Res. 20, 2009; 1314-1319.doi: 10.1111/j.1600-0501.2009.01742.x.

Specification, refinement and verification of concurrent systems - An integration of Object-Z and CSP

This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to he used directly within the CSP part of the specification. In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used fur the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the the CSP operators together with the logic for Object-Z.

Multi-threading and message communication in Qu-Prolog

This paper presents the multi-threading and internet message communication capabilities of Qu-Prolog. Message addresses are symbolic and the communications package provides high-level support that completely hides details of IP addresses and port numbers as well as the underlying TCP/IP transport layer. The combination of the multi-threads and the high level inter-thread message communications provide simple, powerful support for implementing internet distributed intelligent applications.

Using clusters of computers for large QU-GENE simulation experiments

The QU-GENE Computing Cluster (QCC) is a hardware and software solution to the automation and speedup of large QU-GENE (QUantitative GENEtics) simulation experiments that are designed to examine the properties of genetic models, particularly those that involve factorial combinations of treatment levels. QCC automates the management of the distribution of components of the simulation experiments among the networked single-processor computers to achieve the speedup.

Materialized view selection under the maintenance time constraint

A data warehouse is a data repository which collects and maintains a large amount of data from multiple distributed, autonomous and possibly heterogeneous data sources. Often the data is stored in the form of materialized views in order to provide fast access to the integrated data. One of the most important decisions in designing a data warehouse is the selection of views for materialization. The objective is to select an appropriate set of views that minimizes the total query response time with the constraint that the total maintenance time for these materialized views is within a given bound. This view selection problem is totally different from the view selection problem under the disk space constraint. In this paper the view selection problem under the maintenance time constraint is investigated. Two efficient, heuristic algorithms for the problem are proposed. The key to devising the proposed algorithms is to define good heuristic functions and to reduce the problem to some well-solved optimization problems. As a result, an approximate solution of the known optimization problem will give a feasible solution of the original problem. (C) 2001 Elsevier Science B.V. All rights reserved.

Integrating technology to improve the efficiency of qualitative data analysis - A note on methods

Qualitative data analysis (QDA) is often a time-consuming and laborious process usually involving the management of large quantities of textual data. Recently developed computer programs offer great advances in the efficiency of the processes of QDA. In this paper we report on an innovative use of a combination of extant computer software technologies to further enhance and simplify QDA. Used in appropriate circumstances, we believe that this innovation greatly enhances the speed with which theoretical and descriptive ideas can be abstracted from rich, complex, and chaotic qualitative data. © 2001 Human Sciences Press, Inc.

Agents as multi-threaded logical objects

In this paper we describe a distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program. The key features of the language, such as static and dynamic object methods and multiple inheritance, are illustrated through a series of small examples. We show how we can implement object servers, allowing remote spawning of objects, which we can use as staging posts for mobile agents. We give as an example an information gathering mobile agent that can be queried about the information it has so far gathered whilst it is gathering new information. Finally we define a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic, handling multiple queries and information updates concurrently. We believe that the combination of the concurrent OO and the LP programming paradigms produces a powerful tool for quickly implementing rational multi-agent applications on the internet.

A formal model of real-time program compilation

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.