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.

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.

TL dosimetry of natural quartz sensitized by heat-treatment and high dose irradiation

The aim of this paper is to report the sensitization of the TL peak appearing at 270 degrees C in the glow curve of natural quartz by using the combined effect of heat-treatments and irradiation with high gamma doses. For this, thirty discs with 6 x 1 mm(2) were prepared from plates parallell to a rhombolledral crystal face. The specimens were separated into four lots according to its TL read out between 160 and 320 degrees C. One lot was submitted to gamma doses of Co-60 radiation starting at 2 kGy and going up until a cumulative dose of 25 kGy. The other three lots were initially heal-treated at 500, 800 and 1000 degrees C and then irradiated with a single dose of 25kGy. The TL response of each lot was determined as a function of test-doses ranging from 0.1 to 30 mGy. As a result, it was observed that heat-treatments themselves did not produce the strong peak at 270 degrees C that was observed after the administration of high gamma doses. This peak is associated with the optical absorption band appearing at 470 rim which is due to the formation of [AlO4]degrees acting as electron-hole recombination centers. The formation of the 270 degrees C peak was preliminary analyzed in relation to aluminum- and oxygen-vacancy-related centers found in crystalline quartz. (C) 2008 Elsevier Ltd. All rights reserved.

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.

Interactions between Bacteriophage DNA and Cationic Biomimetic Particles

The interaction between giant bacteriophage DNA and cationic biomimetic particles was characterized from sizing by dynamic light-scattering, zeta-potential analysis, turbidimetry, determination of colloid stability, visualization from atomic force microscopy (AFM), and determination of cytotoxicity against E. coli from colony forming unities counting. First, polystyrene sulfate (PSS) particles with different sizes were covered by a dioctadecyldimethylammonium bromide (DODAB) bilayer yielding the so-called cationic biomimetic particles (PSS/DODAB). These cationic particles are highly organized, present a narrow size distribution and were obtained over a range of particle sizes. Thereafter, upon adding lambda, T5 or T2-DNA to PSS/DODAB particles, supramolecular assemblies PSS/DODAB/DNA were obtained and characterized over a range of DNA concentrations and particle sizes (80-700 nm). Over the low DNA concentration range, PSS/DODAB/DNA assemblies were cationic, colloidally stable with moderate polydispersity and highly cytotoxic against E. coli. From DNA concentration corresponding to charge neutralization, neutral or anionic supramolecular assemblies PSS/DODAB/DNA exhibited low colloid stability, high polydispersity and moderate cytotoxicity. Some nucleosome mimetic assemblies were observed by AFM at charge neutralization (zeta-potential equal to zero).