971 resultados para Market capture, queuing, ant colony optimization


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A PhD Dissertation, presented as part of the requirements for the Degree of Doctor of Philosophy from the NOVA - School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work aimed at the development of a (bio)polymeric monolithic support for biopharmaceuticals purification and/or capture. For that, it was assured that functional groups on its surface were ready to be involved in a plethora of chemical reactions for incorporation of the desired and most suitable ligand. Using cryogelation as preparation method a screening on multiple combinations of materials was performed in order to create a potentially efficient support with the minimal footprint, i.e. a monolithic support with reasonable mechanical properties, highly permeable, biocompatible, ready to use, with gravitational performance and minimal unspecific interactions towards the target molecules, but also biodegradable and produced from renewable materials. For the pre-selection all monoliths were characterized physico-chemically and morphologically; one agarose-based and two chitosan-based monoliths were then subjected to further characterizations before and after their modification with magnetic nanoparticles. These three specimens were finally tested towards adenovirus and the recovery reached 84% for the chitosan-GMA plain monolith prepared at -80°C. Monoliths based on chitosan and PVA were prepared in the presence and absence of magnetic particles, and tested for the isolation of GFP directly from crude cellular extracts. The affinity ligand A4C7 previously selected for GFP purification was synthesized on the monolith. The results indicated that the solid-phase synthesis of the ligand directly onto the monolith might require optimization and that the large pores of the monoliths are unsuitable for the purification of small proteins, such as GFP.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Optimization of the RAPD reaction for characterizing Salmonella enterica serovar Typhi strains was studied in order to ensure the reproducibility and the discriminatory power of this technique. Eight Salmonella serovar Typhi strains isolated from various regions in Brazil were examined for the fragment patterns produced using different concentrations of DNA template, primer, MgCl2 and Taq DNA polymerase. Using two different low stringency thermal cycle profiles, the RAPD fingerprints obtained were compared. A set of sixteen primers was evaluated for their ability to produce a high number of distinct fragments. We found that variations associated to all of the tested parameters modified the fingerprinting patterns. For the strains of Salmonella enterica serovar Typhi used in this experiment, we have defined a set of conditions for RAPD-PCR reaction, which result in a simple, fast and reproducible typing method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação para obtenção do grau de Mestre em Engenharia Química e Bioquímica

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.