An analysis of pre-reading strategies in deaf/hard of hearing students

This literature review evaluates print knowledge ability in normally hearing pre-readers with and without specific language impairments. It then discusses implications of print knowledge ability in students who are deaf or hard of hearing and early intervention strategies.

Knowledge of basic concepts in deaf/hard of hearing children

Basic concept knowledge of children who were deaf/hard of hearing was tested using the Bracken Basic Concept Scale: 3rd Edition. These children were given both the receptive and expressive portions of the test. Results indicate delays in overall basic concept knowledge in children who are deaf compared to their normal-hearing peers.

Hard tissue formation adjacent to implants of various size and configuration immediately placed into extraction sockets: an experimental study in dogs

Objectives To evaluate the influence of implant size and configuration on osseointegration in implants immediately placed into extraction sockets. Material and methods Implants were installed immediately into extraction sockets in the mandibles of six Labrador dogs. In the control sites, cylindrical transmucosal implants (3.3 mm diameter) were installed, while in the test sites, larger and conical (root formed, 5 mm diameter) implants were installed. After 4 months of healing, the resorptive patterns of the alveolar crest were evaluated histomorphometrically. Results With one exception, all implants were integrated in mineralized bone, mainly composed of mature lamellar bone. The alveolar crest underwent resorption at the control as well as at the test implants. This resorption was more pronounced at the buccal aspects and significantly greater at the test (2.7 +/- 0.4 mm) than at the control implants (1.5 +/- 0.6 mm). However, the control implants were associated with residual defects that were deeper at the lingual than at the buccal aspects, while these defects were virtually absent at test implants. Conclusions The installment of root formed wide implants immediately into extraction sockets will not prevent the resorption of the alveolar crest. In contrast, this resorption is more marked both at the buccal and lingual aspects of root formed wide than at standard cylindrical implants. To cite this article:Caneva M, Salata LA, de Souza SS, Bressan E, Botticelli D, Lang NP. Hard tissue formation adjacent to implants of various size and configuration immediately placed into extraction sockets: an experimental study in dogs.Clin. Oral Impl. Res. 21, 2010; 885-895.doi: 10.1111/j.1600-0501.2010.01931.x.

In Vivo Comparison of Hard Tissue Regeneration with Human Mesenchymal Stem Cells Processed with Either the FICOLL Method or the BMAC Method

Objective: To compare new bone formation in maxillary sinus augmentation procedures using biomaterial associated with mesenchymal stem cells (MSCs) separated by two different isolation methods. Background: In regenerative medicine open cell concentration systems are only allowed for clinical application under good manufacturing practice conditions. Methods: Mononuclear cells, including MSCs, were concentrated with either the synthetic poylsaccharid (FICOLL) method (classic open system-control group, n = 6 sinus) or the bone marrow aspirate concentrate (BMAC) method (closed system-test group, n = 12 sinus) and transplanted in combination with biomaterial. A sample of the cells was characterized by their ability to differentiate. After 4.1 months (SD +/- 1.0) bone biopsies were obtained and analyzed. Results: The new bone formation in the BMAC group was 19.9% (90% confidence interval [CI], 10.9-29), and in the FICOLL group was 15.5% (90% CI, 8.6-22.4). The 4.4% difference was not significant (90% CI, -4.6-13.5; p = 0.39). MSCs could be differentiated into osteogenic, chondrogenic, and adipogenic lineages. Conclusion: MSCs harvested from bone marrow aspirate in combination with bovine bone matrix particles can form lamellar bone and provide a reliable base for dental implants. The closed BMAC system is suited to substitute the open FICOLL system in bone regeneration procedures.

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.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry`s own practice. (c) 2006 Elsevier Ltd. 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.

The long wavelength limit of hard thermal loop effective actions

We derive a closed form expression for the long wavelength limit of the effective action for hard thermal loops in an external gravitational field. It is a function of the metric, independent of time derivatives. It is compared and contrasted with the static limit, and with the corresponding limits in an external Yang-Mills field. (C) 2009 Elsevier B.V. All rights reserved.

Femtosecond laser ablation on dental hard tissues-Analysis of ablated profile near an interface using local effective intensity

This study evaluated the process of ablation produced by a Ti:Sapphire femtosecond laser under different average powers taking place at the enamel/dentin interface. Based on the geometry of ablated microcavities the effective intensity for ablation was obtained. This study shows the validity for the local effective intensity analysis and allows a quantification of the variation in the ablation geometry taking place at the interface of two naturally different materials. It shows that the variation of the diameter of the ablated region as a function of the cavity depth comes essentially from a mechanism of effective intensity attenuation, as a result of a series of complex effects. Additionally, our data are sufficient to predict that a discontinuity on the ablation profile will occur on the interface between two biological media: enamel-dentin, showing a suddenly jump on the ablated cavity dimensions.

Scheduling Grid Applications with Software Requirements

The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. One way to provide such environments is to use virtualization on demand. This paper presents two schedulers based on integer linear programming which schedule virtual machines (VMs) in grid resources and tasks on these VMs. The schedulers differ from previous work by the joint scheduling of tasks and VMs and by considering the impact of the available bandwidth on the quality of the schedule. Experiments show the efficacy of the schedulers in scenarios with different network configurations.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.