Three-dimensional packings with rotations

We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal packings where 90 degrees rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 2.64, and 4.89, respectively. These algorithms are for the more general case in which the bounded dimensions of the bin given in the input are not necessarily equal (that is, we consider bins for which the length. the width and the height are not necessarily equal). Moreover, we show that these problems-in the general version-are as hard to approximate as the corresponding oriented version. (C) 2009 Elsevier Ltd. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Newton`s iterates can converge to non-stationary points

In this note we discuss the convergence of Newton`s method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hessian is positive definite at each step and yet the iterates converge to a non-stationary point. These examples answer a question posed by Fletcher in his 1987 book Practical methods of optimization.

Software maintenance project delays prediction using Bayesian Networks

Managing software maintenance is rarely a precise task due to uncertainties concerned with resources and services descriptions. Even when a well-established maintenance process is followed, the risk of delaying tasks remains if the new services are not precisely described or when resources change during process execution. Also, the delay of a task at an early process stage may represent a different delay at the end of the process, depending on complexity or services reliability requirements. This paper presents a knowledge-based representation (Bayesian Networks) for maintenance project delays based on specialists experience and a corresponding tool to help in managing software maintenance projects. (c) 2006 Elsevier Ltd. All rights reserved.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Improving ultimate convergence of an augmented Lagrangian method

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving nonlinear programming problems. Their reputation decreased in the last 10 years due to the comparative success of interior-point Newtonian algorithms, which are asymptotically faster. In this research, a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its `pure` counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the interior-point method is replaced by the Newtonian resolution of a Karush-Kuhn-Tucker (KKT) system identified by the augmented Lagrangian algorithm. The software used in this work is freely available through the Tango Project web page:http://www.ime.usp.br/similar to egbirgin/tango/.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Reliability properties under a stopping time shift

Considering a series representation of a coherent system using a shift transform of the components lifetime T-i, at its critical level Y-i, we study two problems. First, under such a shift transform, we analyse the preservation properties of the non-parametric distribution classes and secondly the association preserving property of the components lifetime under such transformations. (c) 2007 Elsevier B.V. All rights reserved.

Elementary Petri net inside RFID distributed database (PNRD)

Usually, a Petri net is applied as an RFID model tool. This paper, otherwise, presents another approach to the Petri net concerning RFID systems. This approach, called elementary Petri net inside an RFID distributed database, or PNRD, is the first step to improve RFID and control systems integration, based on a formal data structure to identify and update the product state in real-time process execution, allowing automatic discovery of unexpected events during tag data capture. There are two main features in this approach: to use RFID tags as the object process expected database and last product state identification; and to apply Petri net analysis to automatically update the last product state registry during reader data capture. RFID reader data capture can be viewed, in Petri nets, as a direct analysis of locality for a specific transition that holds in a specific workflow. Following this direction, RFID readers storage Petri net control vector list related to each tag id is expected to be perceived. This paper presents PNRD cornerstones and a PNRD implementation example in software called DEMIS Distributed Environment in Manufacturing Information Systems.

On Approximate KKT Condition and its Extension to Continuous Variational Inequalities

In this work, we introduce a necessary sequential Approximate-Karush-Kuhn-Tucker (AKKT) condition for a point to be a solution of a continuous variational inequality, and we prove its relation with the Approximate Gradient Projection condition (AGP) of Garciga-Otero and Svaiter. We also prove that a slight variation of the AKKT condition is sufficient for a convex problem, either for variational inequalities or optimization. Sequential necessary conditions are more suitable to iterative methods than usual punctual conditions relying on constraint qualifications. The AKKT property holds at a solution independently of the fulfillment of a constraint qualification, but when a weak one holds, we can guarantee the validity of the KKT conditions.

IS SPLENECTOMY A DYSLIPIDEMIC INTERVENTION? EXPERIMENTAL RESPONSE OF SERUM LIPIDS TO DIFFERENT DIETS AND OPERATIONS

Spleen removal may be recommended during organ transplantation in ABO-incompatible recipients as well as for hypoperfusion of the grafted liver, besides conventional surgical indications, but elevation of serum lipids has been observed in certain contexts. Aiming to analyze the influence of two dietary regimens on lipid profile, an experimental study was conducted. Methods: Male Wistar rats (n = 86, 333.0 +/- 32.2 g) were divided in four groups: group 1: controls; group 2: sham operation; group 3: total splenectomy; group 4: subtotal splenectomy with upper pole preservation; subgroups A (cholesterol reducing chow) and B (cholesterol-rich mixture) were established, and diet was given during 90 days. Total cholesterol (Tchol), high-density lipoprotein (HDL), low-density lipoprotein (LDL), very-low-density lipoprotein (VLDL), and triglycerides were documented. Results: After total splenectomy, hyperlipidemia ensued with cholesterol-reducing chow. Tchol, LDL, VLDL, triglycerides, and HDL changed from 56.4 +/- 9.2, 24.6 +/- 4.7, 9.7 +/- 2.2, 48.6 +/- 11.1, and 22.4 +/- 4.3 mg/dL to 66.9 +/- 11.4, 29.9 +/- 5.9, 10.9 +/- 2.3, 54.3 +/- 11.4, and 26.1 +/- 5.1 mg/dL, respectively. Upper pole preservation inhibited abnormalities of Tchol, HDL, VLDL, and triglycerides, and LDL decreased (23.6 +/- 4.9 vs. 22.1 +/- 5.1, P = 0.002). Higher concentrations were triggered by splenectomy and cholesterol-enriched diet (Tchol 59.4 +/- 10.1 vs. 83.9 +/- 14.3 mg/dL, P = 0.000), and upper-pole preservation diminished without abolishing hyperlipidemia (Tchol 55.9 +/- 10.0 vs. 62.3 +/- 7.8, P = 0.002). Conclusions: After splenectomy, hyperlipidemia occurred with both diets. Preservation of the upper pole tended to correct dyslipidemia in modality A and to attenuate it in subgroup B. (c) 2008 Wiley-Liss, Inc. Microsurgery 29:154-160, 2009.

Forced convection to laminar flow of liquid egg yolk in circular and annular ducts

The steady-state heat transfer in laminar flow of liquid egg yolk - an important pseudoplastic fluid food - in circular and concentric annular ducts was experimentally investigated. The average convection heat transfer coefficients, determined by measuring temperatures before and after heating sections with constant temperatures at the tube wall, were used to obtain simple new empirical expressions to estimate the Nusselt numbers for fully established flows at the thermal entrance of the considered geometries. The comparisons with existing correlations for Newtonian and non-Newtonian fluids resulted in excellent agreement. The main contribution of this work is to supply practical and easily applicable correlations, which are, especially for the case of annulus, rather scarce and extensively required in the design of heat transfer operations dealing with similar shear-thinning products. In addition, the experimental results may support existing theoretical analyses.

Innovation and entrepreneurship in scientific research

This research wants to lay emphasis on topics that historicize and rescue concepts, in addition, shows the relation between innovation and socioeconomic development resulted; reviews the legal framework to stimulate new innovation into Brazilian society; considers the definition and the entrepreneur university's new paradigm; and finally, this research highlights the importance of teaching entrepreneur at universities, with straight society benefits. The results suggests that innovation is directly enrolled with a successful development of certain society, as well, is actually the biggest business competitive differential into corporative universe. In one way of getting results of social advancement to inform entrepreneur research practice, it appears that entrepreneurs concepts, necessarily, must be incorporated into the array of Science/Technology/Innovation for the effective development of supported formula. This article develops a thought about actual scientific researches paradigm, the way that is built on today, and if it's sufficient to effectively get the results that society expects from main bodies to create human resource and researches, especially those with innovation aspects, at Brazilian economic improvement.