Scheduling problems for parallel dedicated machines under multiple resource constraints

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.

Support vector machines for regression and applications to software quality prediction

Software metrics are the key tool in software quality management. In this paper, we propose to use support vector machines for regression applied to software metrics to predict software quality. In experiments we compare this method with other regression techniques such as Multivariate Linear Regression, Conjunctive Rule and Locally Weighted Regression. Results on benchmark dataset MIS, using mean absolute error, and correlation coefficient as regression performance measures, indicate that support vector machines regression is a promising technique for software quality prediction. In addition, our investigation of PCA based metrics extraction shows that using the first few Principal Components (PC) we can still get relatively good performance.

Scheduling parallel dedicated machines with the speeding-up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Preemptive scheduling on uniform parallel machines with controllable job processing times

In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.

Caged birds and cloning machines: how student imagery 'speaks' to us about cultures of schooling and student participation

With the advent of the United Nations Convention on the Rights of the Child (CRC), there is an increasing requirement that schools ensure children and young people's views are voiced, listened to and taken seriously on matters of significance. Encouraging these shifts by law is one thing; changing the culture in schools is another. For a significant proportion of schools, actively engaging students' voices on how they experience education poses a significant challenge and crucial gaps may exist between the rhetoric espoused and a school's readiness for genuine student involvement. This ethnographic study illuminates tensions that persist between headteachers' espoused views of how students are valued and students' creative images of their actual post-primary schooling experience. If cultures of schooling are to nurture the true spirit of democratic pupil participation implied by changes in the law, there is a need to develop genuine processes of student engagement in which students and staff can collaborate towards greater shared understandings of a school's priorities.

HTS Machines as Enabling Technology for All-Electric Airborne Vehicles

Environmental protection has now become paramount as evidence mounts to support the thesis of human activity-driven global warming. A global reduction of the emissions of pollutants into the atmosphere is therefore needed and new technologies have to be considered. A large part of the emissions come from transportation vehicles, including cars, trucks and airplanes, due to the nature of their combustion-based propulsion systems. Our team has been working for several years on the development of high power density superconducting motors for aircraft propulsion and fuel cell based power systems for aircraft. This paper investigates the feasibility of all-electric aircraft based on currently available technology. Electric propulsion would require the development of high power density electric propulsion motors, generators, power management and distribution systems. The requirements in terms of weight and volume of these components cannot be achieved with conventional technologies; however, the use of superconductors associated with hydrogen-based power plants makes possible the design of a reasonably light power system and would therefore enable the development of all-electric aero-vehicles. A system sizing has been performed both for actuators and for primary propulsion. Many advantages would come from electrical propulsion such as better controllability of the propulsion, higher efficiency, higher availability and less maintenance needs. Superconducting machines may very well be the enabling technology for all-electric aircraft development.

Improved conjugate gradient implementation for least squares support vector machines

As a promising method for pattern recognition and function estimation, least squares support vector machines (LS-SVM) express the training in terms of solving a linear system instead of a quadratic programming problem as for conventional support vector machines (SVM). In this paper, by using the information provided by the equality constraint, we transform the minimization problem with a single equality constraint in LS-SVM into an unconstrained minimization problem, then propose reduced formulations for LS-SVM. By introducing this transformation, the times of using conjugate gradient (CG) method, which is a greatly time-consuming step in obtaining the numerical solution, are reduced to one instead of two as proposed by Suykens et al. (1999). The comparison on computational speed of our method with the CG method proposed by Suykens et al. and the first order and second order SMO methods on several benchmark data sets shows a reduction of training time by up to 44%. (C) 2011 Elsevier B.V. All rights reserved.