No description available.

No description available.

Title from PDF of title page. / Document formatted into pages; contains 62 pages. / Thesis (M.S.E.E.)--University of South Florida, 2003. / Includes bibliographical references. / Text (Electronic thesis) in PDF format. / ABSTRACT: The rapid growth of the Internet, in the last few years, has generated a need to enhance the existing IP networks in the areas of availability, dependability and scalability in order to provide a mission critical networking environment. In contemporary IP networks, data packets are routed as a function of the destination address and a single metric such as hop-count or delay. This approach tends to cause message traffic to converge onto the same link, which significantly increases congestion and leads to unbalanced network resource utilization. One solution to this problem is provided by Traffic Engineering (TE), which uses, bandwidth guaranteed, Explicitly Routed Label Switched Paths (ER-LSPs). Due to the dramatic increase in the backbone speeds, current research focuses more on traffic engineering with LSPs for clear control over the traffic distribution in the network. / ABSTRACT: However, the growing popularity of the Internet is driving the Internet Service Providers to adapt new technologies in order to support multiple classes of applications with different characteristics and performance requirements. Multi-Protocol Label Switching (MPLS), which was proposed by the IETF provides essential facilities for traffic engineering and reliable QoS services for the Internet. MPLS networks provide the required flexibility for operators to manage their traffic with ER-LSPs. Even though conventional routing algorithms support the ER-LSP setup in MPLS networks, they are not efficient in link residual capacity information updates and limit resource utilization, which eventually leads to LSP failures and unbalanced network resource utilization. This thesis proposes a new architecture with a cluster based distributed routing algorithm to setup bandwidth guaranteed ER-LSPs in MPLS backbone networks. / ABSTRACT: The proposed routing algorithm confines the route discovery region in order to reduce the routing overhead and computes all possible routes from ingress node to egress node. Based on LSP requirements and network load conditions, the egress node selects the most suitable path from the available paths in order to setup the LSP. This routing scheme optimizes network resource utilization by evenly distributing traffic throughout the network. The Resource Reservation Protocol (RSVP) works in conjunction with the routing protocol for resource reservation and label distribution along the LSP. / System requirements: World Wide Web browser and PDF reader. / Mode of access: World Wide Web.

In this work an intersection between optimization methods and animal cell culture modeling is considered. We present optimization based methods for analyzing and building models of cell culture; models that could be used when designing the environment cells are cultivated in, i.e., medium. Since both the medium and cell line considered are complex, designing a good medium is not straightforward. Developing a model of cell metabolism is a step in facilitating medium design. In order to develop a model of the metabolism the methods presented in this work make use of an underlying metabolic reaction network and extracellular measurements. External substrates and products are connected via the relevant elementary flux modes (EFMs). Modeling from EFMs is generally limited to small networks, because the number of EFMs explodes when the underlying network size increases. The aim of this work is to enable modeling with more complex networks by presenting methods that dynamically identify a subset of the EFMs. In papers A and B we consider a model consisting of the EFMs along with the flux over each mode. In paper A we present how such a model can be decided by an optimization technique named column generation. In paper B the robustness of such a model with respect to measurement errors is considered. We show that a robust version of the underlying optimization problem in paper A can be formed and column generation applied to identify EFMs dynamically. In papers C and D a kinetic macroscopic model is considered. In paper C we show how a kinetic macroscopic model can be constructed from the EFMs. This macroscopic model is created by assuming that the flux along each EFM behaves according to Michaelis-Menten type kinetics. This modeling method has the ability to capture cell behavior in varied types of media, however the size of the underlying network is a limitation. In paper D this limitation is countered by developing an approximation algorithm, that can dynamically identify EFMs for a kinetic model. / I denna avhandling betraktar vi korsningen mellan optimeringsmetoder och modellering av djurcellodling.Vi presenterar optimeringsbaserade metoder för att analysera och bygga modeller av cellkulturer. Dessa modeller kan användas vid konstruktionen av den miljö som cellerna ska odlas i, dvs, medium.Eftersom både mediet och cellinjen är komplexa är det inte okomplicerat att utforma ett bra medium. Att utveckla en modell av cellernas ämnesomsättning är ett steg för att underlätta designen av mediet. För att utveckla en modell av metabolismen kommer de metoder som används i detta arbete att utnyttja ett underliggande metaboliskt reaktions\-nätverk och extracellulära mätningar. Externa substrat och produkter är sammankopplade via de relevanta elementära metaboliska vägarna (EFM).Modellering med hjälp av EFM är i allmänhet begränsad till små nätverk eftersom antalet EFM exploderar när de underliggande nätverket ökar i storlek. Målet med detta arbete är att möjliggöra modellering med mer komplexa nätverk genom att presentera metoder som dynamiskt identifierar en delmängd av EFM. I artikel A och B betraktar vi en modell som består av EFM och ett flöde över varje EFM.I artikel A presenterar vi hur en sådan modell kan bestämmas med hjälp av en optimeringsteknik som kallas kolumngenerering.I artikel A undersöker vi hur robust en sådan modell är med avseende till mätfel. Vi visar att en robust version av det underliggande optimeringsproblemet i artikel A kan konstrueras samt att kolumngenerering kan appliceras för att identifiera EFM dynamiskt. Artikel C och D behandlar en kinetisk makroskopisk modell. Vi visar i artikel C hur en sådan modell kan konstrueras från EFM.Denna makroskopiska modell är skapad genom att anta att flödet genom varje EFM beter sig enligt Michaelis-Menten-typ av kinetik. Denna modelleringsmetod har förmågan att fånga cellernas beteende i olika typer av media, men storleken på nätverket är en begränsning.I artikel D hanterar vi denna begränsing genom att utveckla en approximationsalgoritm som identifierar EFM dynamiskt för en kinetisk modell. / <p>QC 20150827</p>

Monitoring and controlling smart grid assets in a timely and reliable manner is highly desired for emerging smart grid applications. Wireless Sensor Networks (WSNs) are anticipated to be widely utilized in a broad range of smart grid applications due to their numerous advantages along with their successful adoption in various critical areas including military and health care. Despite these advantages, the use of WSNs in such critical applications has brought forward a new challenge of ful lling the Quality of Service (QoS) requirements of these applications. Providing QoS support is a challenging issue due to highly resource constrained nature of sensor nodes, unreliable wireless links and harsh operation environments. In this thesis we critically investigate the problem of QoS provisioning in WSNs. We identify challenges, limitations and requirements for applying QoS provisioning for WSNs in smart grid applications. We nd that the topic of data prioritization techniques at the MAC layer to provide delay bounds in condition monitoring applications is not well developed. We develop six novel QoS schemes that provide data di erentiation and reduce the latency of high priority tra c in a smart grid context. These schemes are namely; Delay-Responsive Cross layer (DRX), Fair and Delay-aware Cross layer (FDRX), Delay-Responsive Cross layer with Linear backo (LDRX), Adaptive Realistic and Stable Model (ARSM), Adaptive Inter-cluster head Delay Control (AIDC) and QoS-aware GTS Allocation (QGA). Furthermore, we propose a new Markov-based model for IEEE 802.15.4 MAC namely, Realistic and Stable Markovbased (RSM). RSM considers actual network conditions and enhances the stability of the WSNs. We show through analytical and simulation results that all of the presented schemes reduce the end-to-end delay while maintaining good energy consumption and data delivery values.

Made available in DSpace on 2014-12-17T15:48:07Z (GMT). No. of bitstreams: 1 RomeritoCA_DISSERT.pdf: 1649773 bytes, checksum: 9a9fd0e3782657fe6d014020cdc8fb90 (MD5) Previous issue date: 2013-02-01 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / This work presents a algorithmic study of Multicast Packing Problem considering a multiobjective approach. The first step realized was an extensive review about the problem. This review serverd as a reference point for the definition of the multiobjective mathematical model. Then, the instances used in the experimentation process were defined, this instances were created based on the main caracteristics from literature. Since both mathematical model and the instances were definined, then several algoritms were created. The algorithms were based on the classical approaches to multiobjective optimization: NSGA2 (3 versions), SPEA2 (3 versions). In addition, the GRASP procedures were adapted to work with multiples objectives, two vesions were created. These algorithms were composed by three recombination operators(C1, C2 e C3), two operator for build solution, a mutation operator and a local search procedure. Finally, a long experimentation process was performed. This process has three stages: the first consisted of adjusting the parameters; the second was perfomed to indentify the best version for each algorithm. After, the best versions for each algorithm were compared in order to identify the best algorithm among all. The algorithms were evaluated based on quality indicators and Hypervolume Multiplicative Epsilon / O presente trabalho apresenta um estudo algor?tmico do Multicast Packing Problem levando em considera??o uma abordagem multiobjetivo. Para tal, faz-se uma extensa revis?o sobre o problema em quest?o. Esta revis?o serviu como ponto de refer?ncia para defini??o de um modelo matem?tico multiobjetivo, tendo em vista que n?o h? na literatura nenhum trabalho que tenha tratado o tema neste aspecto. Em seguida, define-se os casos de teste utilizados no processo de experimenta??o dos algoritmos. Uma vez que tanto modelo matem?tico multiobjetivo quanto os casos de teste foram criados, ent?o desenvolve-se v?rios algoritmos com base nas abordagens cl?ssicas para problemas de otimiza??o multiobjetivo: NSGA2 (3 vers?es) e SPEA2 (3 vers?es). Al?m disso, adaptou-se a metaheur?stica GRASP (2 vers?es) para aplica??o considerando o modelo proposto. Estes algoritmos foram compostos por tr?s operadores de recombina??o (C1, C2, C3), dois operadores de constru??o de solu??o, um operador de muta??o e um operador de busca local. Por fim, um extenso processo de experimenta??o dos algoritmos ? realizado. Este processo possui tr?s etapas: a primeira etapa consistiu de ajustar os par?metros que cada algoritmo necessita, neste caso o ajuste de par?metro foi realizado para todas as vers?es do SPEA2, NSGA2 e GRASP; A segunda etapa consistiu de verificar, para cada algoritmo, qual a melhor vers?o. Por fim, as melhores vers?es de cada algoritmo, no total 3 vers?es, foram comparadas entre si visando identificar qual o melhor algoritmo dentre todos. Os algoritmos foram avaliados com base nos indicadores de qualidade Hypervolume e Epsilon Multiplicativo. Os resultados dos experimentos foram avaliados atrav?s de testes estat?sticos n?o-param?tricos (teste de Mann-Whitney e teste de Friedman). A avalia??o dos resultados foi favor?ravel ao NSGA2-C2 segundo a metodologia de avalia??o utilizada

[pt] Atualmente mais da metade da população mundial mora em cidades. O deslocamento na região urbana, mediante a utilização de transporte público se dificulta devido ao planejamento deficiente das rotas e redes de transporte, longos tempos de viagem, aumento do custo das passagens, dos tempos de espera, etc. Como consequência, a busca de operações mais eficientes no sistema de transporte público urbano tem aumentado visando atender as necessidades de transporte de forma mais sustentável. Após a revisão da literatura relacionada ao problema de desenho de rede de transporte público urbano, foi escolhido o método proposto por Aquino, (1980), aplicável para redes de ônibus urbanos. Por médio da modernização do programa do método escolhido e as melhorias nele, o número de rotas que define a rede conectada diminuiu. O número de transbordos na rede foi minimizado até zera-lo com um menor conjunto de rotas. Análise de indicadores e de rentabilidade das rotas que minimizam o número de transbordo na rede, permite ao planejador ter uma visão geral do comportamento dessas rotas possibilitando tomar decisões mantendo os requerimentos iniciais e o objetivo de estudo. O programa do método desenvolvido, adaptado a uma linguagem moderna, Cmais mais, oferece, tanto ao meio acadêmico quanto ao profissional, uma ferramenta de fácil aplicação para dar solução ao Problema de Desenho de Rede de Transporte Público Urbano. Contribuindo potencialmente ao incremento da eficiência do processo de planejamento e, portanto, à redução de não conformidades do serviço de transporte resultando em economia dos custos para as empresas prestadoras deste serviço. / [en] Nowadays, more than half of the world s population lives in cities. Displacement in the urban area through the use of public transportation is hampered by poor planning of transport routes and networks, long travel times, increased ticket costs and waiting times, etc. As a consequence, the search for more efficient operations in the urban public transport system has increased in order to meet the transport needs in a more sustainable way. After the literature review related to the urban public transport network design problem, the method proposed by Aquino (1980), applicable to urban bus networks, was chosen. By means of the program s modernization of the chosen method and the improvements in it, the number of routes defining the connected network has decreased. The overflow number on the network has been minimized to zero with a smaller set of routes. Analysis of indicators and profitability of the routes that minimize the number of transfer in the network, allows the planner to have an overview of the behavior of these routes allowing to make decisions keeping the initial requirements and the objective of study. The developed method program, adapted to a modern language, C plus plus, offers both an academic and a professional environment an easy application tool to solve the Urban Public Transport Network Design Problem. Potentially contributing to the increase of the efficiency of the planning process and, therefore, to the reduction of nonconformities of the transport service, resulting in cost savings for the companies that provide this service.

The supply function has an important role to support the business to create a customer value. Two important parts of this process is to have the warehouses and production sites in the right location and to have the right items stocked at the right level.   This thesis is concerned with those two parts of the supply chain management. Three different areas of inventory control are dealt with. In the first part we consider the classical dynamic lot size problem without backlogging. The second part deals with estimation of holding and shortage costs in two-level distribution inventory systems. In the third part of the thesis we consider the localisation problem in a multi-level supply network system where items are consolidated at a warehouse and distributed to customers on routes.   Within the area of inventory control we have evaluated a method earlier suggested by Axsäter (1988), the method is evaluated using a set of test problems and compared other heuristic methods, including the well-known Silver-Meal’s method (Silver and Meal, 1973).  The result shows that the method suggested by Axsäter does perform better than the other methods. In the latest contribution we point to the important differences between Least Period Cost and Silver-Meal when several periods have zero demand. In the area of inventory control we have also studied a two-echelon inventory system where we present methods for estimating the shortage- and stockholding costs in such inventory systems.   The second part subject of the thesis concerns supply network optimization. We present a MIP formulation of the problem and evaluate in detail the approximation of the distribution cost when customers are delivered on multi-stop routes. An improved method for estimating the distribution is presented.   Besides this introductory overview five research papers are included in the thesis. The first and the last paper consider evaluation of dynamic lot sizing heuristics. The second and third paper deals with cost evaluation of a stochastic two-echelon inventory system and the forth paper with evaluation of methods for estimating distribution costs in a supply network.

Monitoring and controlling smart grid assets in a timely and reliable manner is highly desired for emerging smart grid applications. Wireless Sensor Networks (WSNs) are anticipated to be widely utilized in a broad range of smart grid applications due to their numerous advantages along with their successful adoption in various critical areas including military and health care. Despite these advantages, the use of WSNs in such critical applications has brought forward a new challenge of ful lling the Quality of Service (QoS) requirements of these applications. Providing QoS support is a challenging issue due to highly resource constrained nature of sensor nodes, unreliable wireless links and harsh operation environments. In this thesis we critically investigate the problem of QoS provisioning in WSNs. We identify challenges, limitations and requirements for applying QoS provisioning for WSNs in smart grid applications. We nd that the topic of data prioritization techniques at the MAC layer to provide delay bounds in condition monitoring applications is not well developed. We develop six novel QoS schemes that provide data di erentiation and reduce the latency of high priority tra c in a smart grid context. These schemes are namely; Delay-Responsive Cross layer (DRX), Fair and Delay-aware Cross layer (FDRX), Delay-Responsive Cross layer with Linear backo (LDRX), Adaptive Realistic and Stable Model (ARSM), Adaptive Inter-cluster head Delay Control (AIDC) and QoS-aware GTS Allocation (QGA). Furthermore, we propose a new Markov-based model for IEEE 802.15.4 MAC namely, Realistic and Stable Markovbased (RSM). RSM considers actual network conditions and enhances the stability of the WSNs. We show through analytical and simulation results that all of the presented schemes reduce the end-to-end delay while maintaining good energy consumption and data delivery values.

The aim of this work is to create a functional specification of mobile application newly emerging asocial network for generating meetings with friends. Generating will be divided into two phases. In the first phase, we will use a mathematical model which will generate appointments with those friends that the user meets the least. In the second phase, we will use a mathematical model and multi-criteria decision making process for invitation of maximum number of friends to this meeting. Using graph theory, we will develope an algorithm which will optimize the computing system over all its users. And finally, we will define functionality for meeting friends in partner establishments in the city, which will use the principle of finding the shortest path.