Efficient but destructive: a test of the dental wash technique using secondary electron microscopy

The Boyadjian et al dental wash technique provides, in certain contexts, the only chance to analyze and quantify the use of plants by past populations and is therefore an important milestone for the reconstruction of paleodiet. With this paper we present recent investigations and results upon the influence of this method on teeth. A series of six teeth from a three thousand years old Brazilian shellmound (Jabuticabeira II) was examined before and after dental wash. The main focus was documenting the alteration of the surfaces and microstructures. The status of all teeth were documented using macrophotography, optical light microscopy, and atmospheric Secondary Electron Microscopy (aSEM) prior and after applying the dental wash technique. The comparison of pictures taken before and after dental wash showed the different degrees of variation and damage done to the teeth but, also, provided additional information about microstructures, which have not been visible before. Consequently we suggest that dental wash should only be carried out, if absolutely necessary, after dental pathology, dental morphology and microwear studies have been accomplished. (C) 2010 Elsevier Ltd. All rights reserved.

Efficiency of wear and decalcification technique for estimating the age of estuarine dolphin Sotalia guianensis

Most techniques used for estimating the age of Sotalia guianensis (van B,n,den, 1864) (Cetacea; Delphinidae) are very expensive, and require sophisticated equipment for preparing histological sections of teeth. The objective of this study was to test a more affordable and much simpler method, involving of the manual wear of teeth followed by decalcification and observation under a stereomicroscope. This technique has been employed successfully with larger species of Odontoceti. Twenty-six specimens were selected, and one tooth of each specimen was worn and demineralized for growth layers reading. Growth layers were evidenced in all specimens; however, in 4 of the 26 teeth, not all the layers could be clearly observed. In these teeth, there was a significant decrease of growth layer group thickness, thus hindering the layers count. The juxtaposition of layers hindered the reading of larger numbers of layers by the wear and decalcification technique. Analysis of more than 17 layers in a single tooth proved inconclusive. The method applied here proved to be efficient in estimating the age of Sotalia guianensis individuals younger than 18 years. This method could simplify the study of the age structure of the overall population, and allows the use of the more expensive methodologies to be confined to more specific studies of older specimens. It also enables the classification of the calf, young and adult classes, which is important for general population studies.

Components Separation Technique With Limited Subcutaneous Undermining A Cadaver Study

The purpose of this study is to evaluate the influence of the undermining of the subcutaneous tissue on the tension of the abdominal wall, after the components separation of the abdominal muscles. Twenty adult cadavers were studied. The resistance of the medial advancement of both anterior and posterior recti sheaths was represented by the traction index and measured in 2 levels-3 cm above and 2 cm below the umbilicus. Traction indices were compared in the following 3 consecutive dissection situations: (1) after the subcutaneous tissue undermining laterally to the semilunaris line; (2) after the dissection of the rectus muscle from its posterior sheath associated with the release of the external oblique muscle; (3) after the subcutaneous tissue undermining laterally to the anterior axillary line. Friedman and Spearman tests were used to compare the results. There was no statistical significant difference between the subcutaneous tissue undermining laterally to the semilunaris line and that laterally to the anterior axillary line, when associated with the musculoaponeurotic dissections. In conclusion, limited subcutaneous undermining does not influence the tension of closure of the musculoaponeurotic layer after the components separation technique in cadavers.

An incremental space to visualize dynamic data sets

In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We have developed an inherently incremental technique (incBoard) that maintains a coherent disposition of elements from a dynamic multidimensional data set on a 2D grid as the set changes. Here, we introduce a novel layout that uses pairwise similarity from grid neighbors, as defined in incBoard, to reposition elements on the visual space, free from constraints imposed by the grid. The board continues to be updated and can be displayed alongside the new space. As similar items are placed together, while dissimilar neighbors are moved apart, it supports users in the identification of clusters and subsets of related elements. Densely populated areas identified in the incSpace can be efficiently explored with the corresponding incBoard visualization, which is not susceptible to occlusion. The solution remains inherently incremental and maintains a coherent disposition of elements, even for fully renewed sets. The algorithm considers relative positions for the initial placement of elements, and raw dissimilarity to fine tune the visualization. It has low computational cost, with complexity depending only on the size of the currently viewed subset, V. Thus, a data set of size N can be sequentially displayed in O(N) time, reaching O(N (2)) only if the complete set is simultaneously displayed.

A novel approach for distributed application scheduling based on prediction of communication events

The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. This, however, required new methods for process scheduling and distribution, considering the network latency, communication cost, heterogeneous environments and distributed computing constraints. An efficient distribution of processes over such environments requires an adequate scheduling strategy, as the cost of inefficient process allocation is unacceptably high. Therefore, a knowledge and prediction of application behavior is essential to perform effective scheduling. In this paper, we overview the evolution of scheduling approaches, focusing on distributed environments. We also evaluate the current approaches for process behavior extraction and prediction, aiming at selecting an adequate technique for online prediction of application execution. Based on this evaluation, we propose a novel model for application behavior prediction, considering chaotic properties of such behavior and the automatic detection of critical execution points. The proposed model is applied and evaluated for process scheduling in cluster and grid computing environments. The obtained results demonstrate that prediction of the process behavior is essential for efficient scheduling in large-scale and heterogeneous distributed environments, outperforming conventional scheduling policies by a factor of 10, and even more in some cases. Furthermore, the proposed approach proves to be efficient for online predictions due to its low computational cost and good precision. (C) 2009 Elsevier B.V. All rights reserved.

Least square projection: A fast high-precision multidimensional projection technique and its application to document mapping

The problem of projecting multidimensional data into lower dimensions has been pursued by many researchers due to its potential application to data analyses of various kinds. This paper presents a novel multidimensional projection technique based on least square approximations. The approximations compute the coordinates of a set of projected points based on the coordinates of a reduced number of control points with defined geometry. We name the technique Least Square Projections ( LSP). From an initial projection of the control points, LSP defines the positioning of their neighboring points through a numerical solution that aims at preserving a similarity relationship between the points given by a metric in mD. In order to perform the projection, a small number of distance calculations are necessary, and no repositioning of the points is required to obtain a final solution with satisfactory precision. The results show the capability of the technique to form groups of points by degree of similarity in 2D. We illustrate that capability through its application to mapping collections of textual documents from varied sources, a strategic yet difficult application. LSP is faster and more accurate than other existing high-quality methods, particularly where it was mostly tested, that is, for mapping text sets.

An evaluation of three upwinding approximations for numerical modeling the flow in tubular membrane of Newtonian and non-Newtonian fluids

In this paper, the laminar fluid flow of Newtonian and non-Newtonian of aqueous solutions in a tubular membrane is numerically studied. The mathematical formulation, with associated initial and boundary conditions for cylindrical coordinates, comprises the mass conservation, momentum conservation and mass transfer equations. These equations are discretized by using the finite-difference technique on a staggered grid system. Comparisons of the three upwinding schemes for discretization of the non-linear (convective) terms are presented. The effects of several physical parameters on the concentration profile are investigated. The numerical results compare favorably with experimental data and the analytical solutions. (C) 2011 Elsevier Inc. All rights reserved.

PedVis: A Structured, Space-Efficient Technique for Pedigree Visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population`s ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree`s structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user`s ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

Resampling Strategies for Deforming MLS Surfaces

Moving-least-squares (MLS) surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-uniform. Previous work by the authors dealt with algebraic MLS surfaces, and proposed a resampling strategy based on defining the new points at the intersections of the MLS surface with a suitable set of rays. That strategy has very low memory requirements and is easy to parallelize. In this article new resampling strategies with reduced CPU-time cost are explored. The basic idea is to choose as set of rays the lines of a regular, Cartesian grid, and to fully exploit this grid: as data structure for search queries, as spatial structure for traversing the surface in a continuation-like algorithm, and also as approximation grid for an interpolated version of the MLS surface. It is shown that in this way a very simple and compact resampling technique is obtained, which cuts the resampling cost by half with affordable memory requirements.

Front tracking with moving-least-squares surfaces

The representation of interfaces by means of the algebraic moving-least-squares (AMLS) technique is addressed. This technique, in which the interface is represented by an unconnected set of points, is interesting for evolving fluid interfaces since there is]to surface connectivity. The position of the surface points can thus be updated without concerns about the quality of any surface triangulation. We introduce a novel AMLS technique especially designed for evolving-interfaces applications that we denote RAMLS (for Robust AMLS). The main advantages with respect to previous AMLS techniques are: increased robustness, computational efficiency, and being free of user-tuned parameters. Further, we propose a new front-tracking method based on the Lagrangian advection of the unconnected point set that defines the RAMLS surface. We assume that a background Eulerian grid is defined with some grid spacing h. The advection of the point set makes the surface evolve in time. The point cloud can be regenerated at any time (in particular, we regenerate it each time step) by intersecting the gridlines with the evolved surface, which guarantees that the density of points on the surface is always well balanced. The intersection algorithm is essentially a ray-tracing algorithm, well-studied in computer graphics, in which a line (ray) is traced so as to detect all intersections with a surface. Also, the tracing of each gridline is independent and can thus be performed in parallel. Several tests are reported assessing first the accuracy of the proposed RAMLS technique, and then of the front-tracking method based on it. Comparison with previous Eulerian, Lagrangian and hybrid techniques encourage further development of the proposed method for fluid mechanics applications. (C) 2008 Elsevier Inc. All rights reserved.

An implicit technique for solving 3D low Reynolds number moving free surface flows

This paper describes the development of an implicit finite difference method for solving transient three-dimensional incompressible free surface flows. To reduce the CPU time of explicit low-Reynolds number calculations, we have combined a projection method with an implicit technique for treating the pressure on the free surface. The projection method is employed to uncouple the velocity and the pressure fields, allowing each variable to be solved separately. We employ the normal stress condition on the free surface to derive an implicit technique for calculating the pressure at the free surface. Numerical results demonstrate that this modification is essential for the construction of methods that are more stable than those provided by discretizing the free surface explicitly. In addition, we show that the proposed method can be applied to viscoelastic fluids. Numerical results include the simulation of jet buckling and extrudate swell for Reynolds numbers in the range [0.01, 0.5]. (C) 2008 Elsevier Inc. All rights reserved.

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

Numerical solution of the PTT constitutive equation for unsteady three-dimensional free surface flows

This work deals with the development of a numerical technique for simulating three-dimensional viscoelastic free surface flows using the PTT (Phan-Thien-Tanner) nonlinear constitutive equation. In particular, we are interested in flows possessing moving free surfaces. The equations describing the numerical technique are solved by the finite difference method on a staggered grid. The fluid is modelled by a Marker-and-Cell type method and an accurate representation of the fluid surface is employed. The full free surface stress conditions are considered. The PTT equation is solved by a high order method, which requires the calculation of the extra-stress tensor on the mesh contours. To validate the numerical technique developed in this work flow predictions for fully developed pipe flow are compared with an analytic solution from the literature. Then, results of complex free surface flows using the FIT equation such as the transient extrudate swell problem and a jet flowing onto a rigid plate are presented. An investigation of the effects of the parameters epsilon and xi on the extrudate swell and jet buckling problems is reported. (C) 2010 Elsevier B.V. All rights reserved.

Numerical Solution of the Upper-Convected Maxwell Model for Three-Dimensional Free Surface Flows

This work presents a finite difference technique for simulating three-dimensional free surface flows governed by the Upper-Convected Maxwell (UCM) constitutive equation. A Marker-and-Cell approach is employed to represent the fluid free surface and formulations for calculating the non-Newtonian stress tensor on solid boundaries are developed. The complete free surface stress conditions are employed. The momentum equation is solved by an implicit technique while the UCM constitutive equation is integrated by the explicit Euler method. The resulting equations are solved by the finite difference method on a 3D-staggered grid. By using an exact solution for fully developed flow inside a pipe, validation and convergence results are provided. Numerical results include the simulation of the transient extrudate swell and the comparison between jet buckling of UCM and Newtonian fluids.

Study of sodium tellurite glass using the thermally stimulated depolarization current technique (TSDC)

In order to have a better understanding of the role of the structure and the defects involved in the polarization processes in an 85TeO(2)-15Na(2)O mol% glass, we used the thermally stimulated depolarization currents (TSDC technique). The TSDC of the non-irradiated sample presented a strong negative peak of current at the temperature of 340 K, preceded by a relatively weak positive peak at about 300 K. after different d.c. voltages of 1200, 1500 and 2000 V were applied. No response was obtained with 1000 V. but the peak intensity increased considerably for voltages above 1200 V. After gamma-irradiation of 25 and 50 KGy doses, a depolarization of the negative peak was observed in the sample submitted to 25 KGy, whereas for the sample irradiated with 50 KGy, six TSDC peaks appeared at regular intervals of 5 KGy, in the temperature range of 100 and 300 K. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.