A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

The present paper proposes a new hybrid multi-population genetic algorithm (HMPGA) as an approach to solve the multi-level capacitated lot sizing problem with backlogging. This method combines a multi-population based metaheuristic using fix-and-optimize heuristic and mathematical programming techniques. A total of four test sets from the MULTILSB (Multi-Item Lot-Sizing with Backlogging) library are solved and the results are compared with those reached by two other methods recently published. The results have shown that HMPGA had a better performance for most of the test sets solved, specially when longer computing time is given. © 2012 Elsevier Ltd.

Multi-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company

Goal Programming (GP) is an important analytical approach devised to solve many realworld problems. The first GP model is known as Weighted Goal Programming (WGP). However, Multi-Choice Aspirations Level (MCAL) problems cannot be solved by current GP techniques. In this paper, we propose a Multi-Choice Mixed Integer Goal Programming model (MCMI-GP) for the aggregate production planning of a Brazilian sugar and ethanol milling company. The MC-MIGP model was based on traditional selection and process methods for the design of lots, representing the production system of sugar, alcohol, molasses and derivatives. The research covers decisions on the agricultural and cutting stages, sugarcane loading and transportation by suppliers and, especially, energy cogeneration decisions; that is, the choice of production process, including storage stages and distribution. The MCMIGP allows decision-makers to set multiple aspiration levels for their problems in which the more/higher, the better and the less/lower, the better in the aspiration levels are addressed. An application of the proposed model for real problems in a Brazilian sugar and ethanol mill was conducted; producing interesting results that are herein reported and commented upon. Also, it was made a comparison between MCMI GP and WGP models using these real cases. © 2013 Elsevier Inc.

Análise cinemática da saída na natação através de um sistema bi-dimensional

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A bi-objective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Engineering Agent-Oriented Technologies and Programming Languages for Computer Programming and Software Development

Mainstream hardware is becoming parallel, heterogeneous, and distributed on every desk, every home and in every pocket. As a consequence, in the last years software is having an epochal turn toward concurrency, distribution, interaction which is pushed by the evolution of hardware architectures and the growing of network availability. This calls for introducing further abstraction layers on top of those provided by classical mainstream programming paradigms, to tackle more effectively the new complexities that developers have to face in everyday programming. A convergence it is recognizable in the mainstream toward the adoption of the actor paradigm as a mean to unite object-oriented programming and concurrency. Nevertheless, we argue that the actor paradigm can only be considered a good starting point to provide a more comprehensive response to such a fundamental and radical change in software development. Accordingly, the main objective of this thesis is to propose Agent-Oriented Programming (AOP) as a high-level general purpose programming paradigm, natural evolution of actors and objects, introducing a further level of human-inspired concepts for programming software systems, meant to simplify the design and programming of concurrent, distributed, reactive/interactive programs. To this end, in the dissertation first we construct the required background by studying the state-of-the-art of both actor-oriented and agent-oriented programming, and then we focus on the engineering of integrated programming technologies for developing agent-based systems in their classical application domains: artificial intelligence and distributed artificial intelligence. Then, we shift the perspective moving from the development of intelligent software systems, toward general purpose software development. Using the expertise maturated during the phase of background construction, we introduce a general-purpose programming language named simpAL, which founds its roots on general principles and practices of software development, and at the same time provides an agent-oriented level of abstraction for the engineering of general purpose software systems.

Applying the reactive programming paradigm: Toward a more declarative application development approach

After almost 10 years from “The Free Lunch Is Over” article, where the need to parallelize programs started to be a real and mainstream issue, a lot of stuffs did happened: • Processor manufacturers are reaching the physical limits with most of their approaches to boosting CPU performance, and are instead turning to hyperthreading and multicore architectures; • Applications are increasingly need to support concurrency; • Programming languages and systems are increasingly forced to deal well with concurrency. This thesis is an attempt to propose an overview of a paradigm that aims to properly abstract the problem of propagating data changes: Reactive Programming (RP). This paradigm proposes an asynchronous non-blocking approach to concurrency and computations, abstracting from the low-level concurrency mechanisms.

Setting Inventory Levels of CONWIP Flow Lines via Linear Programming

This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011) for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.

Short-term Functional and Patient Outcome of the Bi-cruciate Stabilized Total Knee Replacement: Prospective Consecutive Case-series

Background: Total knee replacement is the gold standard treatment for patients suffering from advanced symptomatic knee osteoarthritis. The main goals of knee prosthetics are pain reduction and restoration of knee motion. The new prostheses on the market such as the bi-cruciate stabilized Journey knee implant, promise a reconstruction of total physiological function of the knee with physiological range of motion and therefore high patient satisfaction. Purpose: The aim of this study was to analyze the patient-based Knee Injury and Osteoarthritis Outcome Score (KOOS) outcome after total knee replacement with new physiological bi-cruciate stabilized Journey knee prosthesis. Study Design: Prospective, consecutive case-series. Patients: Ninety nine patients, who received bi-cruciate stabilized Journey total knee prosthesis between January 1st 2006 and May 31st 2012, were included in the study. A single surgeon operated all patients. There were 61.1% females and the overall average age was 68 years (range 41-83 years). Left knee was replaced in 55.6%. Methods: The patients filled in KOO’s questionnaire pre- and 1 year postoperative. Range of motion (ROM) was studied preoperatively and at 1-year follow-ups. The pre- and postoperative KOOS subscores and ROM were compared using the Wilcoxon signed rank test. Results: There are significant improvements of all KOOS subscores. Ninety percent of patients have reached the minimum clinically relevant 10 points in symptoms, 94.5% in pain, 94.5% in activities of daily living, 84.9% in sport and recreation, and 90% in knee related quality of life. Postoperative, the average passive ROM was 131° (range 110-145°) and the average active ROM 122° (range 105-135°). The highest correlation coefficients ROM and the KOOS were observed for the activity and pain subscores. Very low or no correlation was seen for the sport subscore. Conclusions: Bi-cruciate stabilized knee prosthetic offers a solid outcome 1 year postoperative based on the results measured with the KOOS evaluation questionnaire. The Patients showed a generalized improvement in all domains measured in the KOOS of minimally 35, and up to over 52 points, what can be described as statistically significant. Patients described the level of functionality close to double compared to the preoperative status.

Recent Increases in Atmospheric Concentrations of Bi, U, Cs, S and Ca from a 350-Year Mount Everest Ice Core Record

High-resolution major and trace elements (Sr, Cs, Ba, La, Ce, Pr, Nd, Sm, Eu, Tb, Dy, Ho, Er, Tm, Yb, Lu, Bi, U, Tl, Al, S, Ca, Ti, V, Cr, Mn, Fe, and Co) quantified in a Mount Everest ice core ( 6518 m above sea level) spanning the period 1650-2002 AD provides the first Asian record of trace element concentrations from the pre-industrial era, and the first continuous high-resolution Asian record from which natural baseline concentrations and subsequent changes due to anthropogenic activities can be examined. Modern concentrations of most elements remain within the pre-industrial range; however, Bi, U, and Cs concentrations and their enrichment factors (EF) have increased since the similar to 1950s, and S and Ca concentrations and their EFs have increased since the late 1980s. A comparison of the Bi, U, Cs, S, and Ca data with other ice core records and production data indicates that the increase in atmospheric concentrations of trace elements is widespread, but that enrichment varies regionally. Likely sources for the recent enrichment of these elements include mining, metal smelting, oil and coal combustion, and end uses for Bi, and mining and refinement for U and Cs. The source of the synchronous enrichment of Ca and S is less certain, but may be related to land use and environmental change.

SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization

SOMS is a general surrogate-based multistart algorithm, which is used in combination with any local optimizer to find global optima for computationally expensive functions with multiple local minima. SOMS differs from previous multistart methods in that a surrogate approximation is used by the multistart algorithm to help reduce the number of function evaluations necessary to identify the most promising points from which to start each nonlinear programming local search. SOMS’s numerical results are compared with four well-known methods, namely, Multi-Level Single Linkage (MLSL), MATLAB’s MultiStart, MATLAB’s GlobalSearch, and GLOBAL. In addition, we propose a class of wavy test functions that mimic the wavy nature of objective functions arising in many black-box simulations. Extensive comparisons of algorithms on the wavy testfunctions and on earlier standard global-optimization test functions are done for a total of 19 different test problems. The numerical results indicate that SOMS performs favorably in comparison to alternative methods and does especially well on wavy functions when the number of function evaluations allowed is limited.

Contents of Ag, Bi, In, and Tl in suspended and aerosol matter at Station DM8-579 in the Peru Basin, Southeast Pacific

A new electrothermal atomizer for use in direct determination of Ag, Bi, In, and Tl in marine, riverine, and aeolian particulate matter on membrane filters is described. A sample capsule and atomization cell are heated separately. That is why it is possible to separate and optimize decomposition of a sample, vaporization of elements and atomization of their vapors. Noise reduction and design, which localizes the vapors in a light absorption zone, decrease detection limits of these four elements by factor of at least 3 to 10. Some analytical results are given.

Designing a high performance parallel logic programming system

Compilation techniques such as those portrayed by the Warren Abstract Machine(WAM) have greatly improved the speed of execution of logic programs. The research presented herein is geared towards providing additional performance to logic programs through the use of parallelism, while preserving the conventional semantics of logic languages. Two áreas to which special attention is given are the preservation of sequential performance and storage efficiency, and the use of low overhead mechanisms for controlling parallel execution. Accordingly, the techniques used for supporting parallelism are efficient extensions of those which have brought high inferencing speeds to sequential implementations. At a lower level, special attention is also given to design and simulation detail and to the architectural implications of the execution model behavior. This paper offers an overview of the basic concepts and techniques used in the parallel design, simulation tools used, and some of the results obtained to date.