An optimization approach for the job shop scheduling problem

This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.

A new approach to the initial value problem

5th Portuguese Conference on Automatic Control, September, 5-7, 2002, Aveiro, Portugal

From cheating to teaching: a path for conversion of illegal gambling machines

Video poker machines, a former symbol of fraud and gambling in Brazil, are now being converted into computer-based educational tools for Brazilian public primary schools and also for governmental and non-governmental institutions dealing with communities of poverty and social exclusion, in an attempt to reduce poverty risks (decrease money spent on gambling) and promote social inclusion (increase access and motivation to education). Thousands of illegal gambling machines are seized by federal authorities, in Brazil, every year, and usually destroyed at the end of the criminal apprehension process. This paper describes a project developed by the University of Southern Santa Catarina, Brazil, responsible for the conversion process of gambling machines, and the social inclusion opportunities derived from it. All project members worked on a volunteer basis, seeking to promote social inclusion of Brazilian young boys and girls, namely through digital inclusion. So far, the project has been able to convert over 200 gambling machines and install them in over 40 public primary schools, thus directly benefiting more than 12,000 schoolchildren. The initial motivation behind this project was technology based, however the different options arising from the conversion process of the gambling machines have also motivated a rather innovative and unique experience in allowing schoolchildren and young people with special (educational) needs to access to computer-based pedagogical applications. The availability of these converted machines also helps to place Information and Communication Technologies (ICT) in the very daily educational environment of these children and youngsters, thus serving social and cultural inclusion aspects, by establishing a dialogue with the community and their technological expectations, and also directly contributing to their digital literacy.

Brownian bridge and other path-dependent Gaussian processes vectorial simulation

The iterative simulation of the Brownian bridge is well known. In this article, we present a vectorial simulation alternative based on Gaussian processes for machine learning regression that is suitable for interpreted programming languages implementations. We extend the vectorial simulation of path-dependent trajectories to other Gaussian processes, namely, sequences of Brownian bridges, geometric Brownian motion, fractional Brownian motion, and Ornstein-Ulenbeck mean reversion process.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Inferência de percursos dos utentes de um transporte coletivo

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Redes de Comunicações e Multimédia

On the requirements of interpolating polynomials for path motion constraints

In the framework of multibody dynamics, the path motion constraint enforces that a body follows a predefined curve being its rotations with respect to the curve moving frame also prescribed. The kinematic constraint formulation requires the evaluation of the fourth derivative of the curve with respect to its arc length. Regardless of the fact that higher order polynomials lead to unwanted curve oscillations, at least a fifth order polynomials is required to formulate this constraint. From the point of view of geometric control lower order polynomials are preferred. This work shows that for multibody dynamic formulations with dependent coordinates the use of cubic polynomials is possible, being the dynamic response similar to that obtained with higher order polynomials. The stabilization of the equations of motion, always required to control the constraint violations during long analysis periods due to the inherent numerical errors of the integration process, is enough to correct the error introduced by using a lower order polynomial interpolation and thus forfeiting the analytical requirement for higher order polynomials.

The role of Public Health Laboratory in the problem os salmonellosis in São Paulo, Brazil

From 1950 to 1990 a total of 45,862 strains (31,517 isolates from human sources, and 14,345 of non-human origin) were identified at Instituto Adolfo Lutz. No prevalence of any serovars was seen during the period 1950-66 among human sources isolates. Important changing pattern was seen in 1968, when S. Typhimurim surprisingly increased becoming the prevalent serovar in the following decades. During the period of 1970-76, S. Typhimurium represented 77.7% of all serovars of human origin. Significant rise in S. Agona isolation as well as in the number of different serovars among human sources strains were seen in the late 70' and the 80's. More than one hundred different serovars were identified among non-human origin strains. Among serovars isolated from human sources, 74.9%, 15.5%, and 3.7% were recovered from stool, blood, and cerebrospinal fluid cultures, respectively. The outbreak of meningitis by S. Grumpensis in the 60's, emphasizes the concept that any Salmonella serovars can be a cause of epidemics, mainly of the nosocomial origin. This evaluation covering a long period shows the important role of the Public Health Laboratory in the surveillance of salmonellosis, one of the most frequent zoonosis in the world.

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

Using interval graphs in an order processing optimization problem

In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.

Intranasal sensitization with Blomia Tropicalis antigens induces allergic responses in mice characterized by elevated antigen-specific and non-specific serum ige and peripheral blood eosinophil counts

In order to evaluate the potential allergenicity of Blomia tropicalis (Bt) antigen, IgE production of both specific and non-specific for Bt antigen was monitored in BALB/c mice after exposure to the antigen by nasal route. It was evidenced that B. tropicalis contains a functional allergen in its components. The allergenic components, however, when administered intranasally without any adjuvant, did not function to induce IgE response within a short period. On the other hand, intranasal inoculation of Bt antigens augmented serum IgE responses in mice pretreated by a subcutaneous priming injection of the same antigens. Inoculation of Bt antigen without subcutaneous priming injections induced IgE antibody production only when the antigen was continuously administered for a long period of over 24 weeks. Even when the priming injection was absent, the Bt antigen inoculated with cholera toxin (CT) as a mucosal adjuvant also significantly augmented the Bt antigen-specific IgE responses depending on the dose of CT co-administered. The present study also demonstrated that Bt antigen/CT-inoculated mice showed increased non-specific serum IgE level and peripheral blood eosinophil rates without noticeable elevations of the total leukocyte counts. The immunoblot analysis demonstrated 5 main antigenic components reactive to IgE antibodies induced. These components at about 44-64 kDa position were considered to be an important candidate antigen for diagnosis of the mite-related allergy.

On the Scalability of Constructive Interference in Low-Power Wireless Networks

12th European Conference on Wireless Sensor Networks (EWSN 2015). 9 to 11, Feb, 2015. Porto, Portugal

Risk Factors for Latex Sensitization in Children with Spina Bifida

Background: Children with spina bifida represent the major risk group for latex sensitization. Purpose: To determine the prevalence of latex sensitization in these children and to identify risk factors. Material and methods: We studied 57 patients with spina bifida. The mean age was 5.6 years and the male/female ratio was 0.8/1. In all patients a questionnaire, skin prick test (SPT) with latex (UCBStallergènes, Lofarma and ALK-Abelló), common aeroallergens and fruits (UCB-Stallergènes) and serum determination of total IgE (AlaSTAT) were performed. Results: The prevalence of latex sensitization was 30 %; only two sensitized children (12 %) had symptoms after exposure. Risk factors for latex sensitization were age 5 years (p = 0.008; OR = 6.0; 95% CI = 1.7-22.1), having at least four previous surgical interventions (p < 0.0001; OR = 18.5; 95% CI = 3.6-94.8), having undergone surgery in the first 3 months of life (p = 0.008; OR = 5.4; 95% CI = 0.7-29.2) and total serum IgE 44 IU/ml (p = 0.03; OR = 3.8; 95 %CI = 1.1-13.1). Multiple logistic regression analysis showed that only a history of four or more surgical interventions (p < 0.0001; OR = 26.3; 95 %CI = 2.9-234.2) and total serum IgE 44 IU/ml (p = 0.02; OR = 8.6; 95% CI = 1.4-53.4) were independently associated with latex sensitization. Sex, family and personal allergic history, hydrocephalus with ventriculoperitoneal shunt, cystourethrograms, intermittent bladder catheterization and atopy were not related to latex sensitization. Conclusions: In children with spina bifida, significant and independent risk factors identified for latex sensitization were multiple interventions and higher levels of total serum IgE. A prospective study will clarify the clinical evolution of assymptomatic children sensitized to latex.

Hybrid link-state path-vector protocol ++

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores Mestrado Integrado em Engenharia Electrotécnica e de Computadores