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.

Clinical significance of lifetime panic disorder in the course of bipolar disorder type I

Objectives: The aim of the study was to analyze the impact of lifetime panic disorder (PD) diagnosis in a sample of patients with bipolar disorder type I (BPI), evaluating clinical and demographic variables. Methods: Ninety-five outpatients from the Bipolar Disorder Research Program at the Institute of Psychiatry of the University of Sao Paulo Medical School were enrolled. Twenty-seven BPI patients with PD were compared to 68 BPI patients without any anxiety disorders regarding clinical and demographic variables. Results: Compared to BPI patients without any anxiety disorders, patients with BPI + PD presented significantly higher number of mood episodes (18.9 +/- 13.8 vs 8.5 +/- 7.8; P < .001), depressive episodes (10.8 +/- 8.2 vs 4.6 +/- 4,8; P = .001), and manic episodes (7.4 +/- 7.3 vs 3.6 +/- 3.6; P = .008). Patients with BPI + PD had more frequently a depressive episode as their first one compared to BPI patients without anxiety disorders (94.1% vs 57.5%; P = .011). Patients with BPI + PD had more comorbidity with lifetime diagnosis of drug abuse or dependence (33.3% vs 8.8%; P = .010) and eating disorders (29.6% vs 6.0%; P = .004). Conclusions: The higher number of mood episodes in general presented by patients with BPI + PD when compared with BPI patients without any anxiety disorders, along with the higher frequencies of drug misuse and eating disorders, indicates that PD comorbidity is associated with a poorer Course and outcome of BPI. The higher frequency of depression as the onset mood episode and the higher number of manic episodes in the group with PD may have important treatment implications and should be further investigated. (C) 2009 Elsevier Inc. All rights reserved.

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.

Objective characterization of the course of the parasellar internal carotid artery using mathematical tools

Background Along the internal carotid artery (ICA), atherosclerotic plaques are often located in its cavernous sinus (parasellar) segments (pICA). Studies indicate that the incidence of pre-atherosclerotic lesions is linked with the complexity of the pICA; however, the pICA shape was never objectively characterized. Our study aims at providing objective mathematical characterizations of the pICA shape. Methods and results Three-dimensional (3D) computer models, reconstructed from contrast enhanced computed tomography (CT) data of 30 randomly selected patients (60 pICAs) were analyzed with modern visualization software and new mathematical algorithms. As objective measures for the pICA shape complexity, we provide calculations of curvature energy, torsion energy, and total complexity of 3D skeletons of the pICA lumen. We further measured the posterior knee of the so-called ""carotid siphon"" with a virtual goniometer and performed correlations between the objective mathematical calculations and the subjective angle measurements. Conclusions Firstly, our study provides mathematical characterizations of the pICA shape, which can serve as objective reference data for analyzing connections between pICA shape complexity and vascular diseases. Secondly, we provide an objective method for creating Such data. Thirdly, we evaluate the usefulness of subjective goniometric measurements of the angle of the posterior knee of the carotid siphon.

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.

Asymmetric phase-transfer catalytic sulfanylation of some 2-methylsulfinyl cyclanones. Modeling of the stereochemical course of the aldol reaction of (SS,2S)-2-methylsulfinyl-2-methylsulfanylcyclohexanone

Increased diastereoisomeric excesses are obtained for the sulfanylation reactions of some 2-methylsulfinyl cyclanones under phase-transfer catalysis using the chiral catalyst QUIBEC instead of TEBA. The optically pure (SS,2S)-2-methylsulfinyl-2-methylsulfanylcyclohexanone thus prepared reacts with ethyl acetate lithium enolate affording, after hydrolysis, (R)-2-[(ethoxycarbonyl)methyl]-2-hydroxycyclohexanone in 60% ee. Density functional theory calculations (at the B3LYP/6-311++G(d,p) level) can successfully explain the origin of this result as the kinetically favored axial attack of the nucleophile to the carbonyl group of the most stable conformer of the cyclanone, in which the CH(3)SO and CH(3)S groups are at the equatorial and axial positions, respectively. (C) 2010 Elsevier Ltd. All rights reserved.

Developing and Facilitating a Successful Hybrid Statistics Course

This presentation will outline an effective model for a Hybrid Statistics course. The course continues to be very successful, incorporating on-line instruction, testing, blogs, and above all, a data analysis project driven trajectory motivating students to engage more aggressively in the class and rise up to the challenge of writing an original research paper. Obstacles, benefits and successes of this endeavor will be addressed.

Camtasia Mania: Using Video in Exemplary Online Course Design

This basis of our presentation is to share a method of creating a fully online course experience for the student. The LMS (Learning Management System) in our presentation will be Blackboard. Our presentation will include the course design (following a weekly syllabus or course weekly module, the various content areas of the course and most importantly, the rich media included in the course. Our presentation will also include the creation process via CAMTASIA, video production software.

“Flipped Classroom” for Teaching Business Research in a Business Management Course

This presentation will report on a cross-department collaboration between the library and the business/economics department at Lehman College to conduct information literacy instruction as a “flipped classroom.”

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.

Rate Scheduling for HSDPA in UMTS

The introduction of a new technology High Speed Downlink Packet Access (HSDPA) in the Release 5 of the 3GPP specifications raises the question about its performance capabilities. HSDPA is a promising technology which gives theoretical rates up to 14.4 Mbits. The main objective of this thesis is to discuss the system level performance of HSDPAMainly the thesis exploration focuses on the Packet Scheduler because it is the central entity of the HSDPA design. Due to its function, the Packet Scheduler has a direct impact on the HSDPA system performance. Similarly, it also determines the end user performance, and more specifically the relative performance between the users in the cell.The thesis analyzes several Packet Scheduling algorithms that can optimize the trade-off between system capacity and end user performance for the traffic classes targeted in this thesis.The performance evaluation of the algorithms in the HSDPA system are carried out under computer aided simulations that are assessed under realistic conditions to predict the results as precise on the algorithms efficiency. The simulation of the HSDPA system and the algorithms are coded in C/C++ language

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

University Scheduling using Genetic Algorithm

The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible and optimizedschedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this studyis to investigate the performance of Genetic Algorithm on general scheduling problem underpredefined constraints and check the validity of results, and then having comparative analysiswith other available approaches like Tabu search, simulated annealing, direct and indirectheuristics [2] and expert system. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems and later analysis will prove this argument. The programis written in C++ and analysis is done by using variation in various parameters.

BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on which a number of tasksare to be scheduled that the program’s execution time is minimized. According to [10], thetasks scheduling problem is a key factor for a parallel multiprocessor system to gain betterperformance. A task can be partitioned into a group of subtasks and represented as a DAG(Directed Acyclic Graph), so the problem can be stated as finding a schedule for a DAG to beexecuted in a parallel multiprocessor system so that the schedule can be minimized. Thishelps to reduce processing time and increase processor utilization. The aim of this thesis workis to check and compare the results obtained by Bee Colony algorithm with already generatedbest known results in multi processor task scheduling domain.