Дисертації з теми "Bid Optimization"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Bid Optimization".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Yu, Zhenjian. "Strategic sourcing and bid optimization for ocean freight /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202004%20YU.
Повний текст джерелаWang, Qian. "Pre-bid network analysis for transportation procurement auction under stochastic demand." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41727.
Повний текст джерелаIncludes bibliographical references (p. 67-68).
Transportation procurement is one of the most critical sourcing decisions to be made in many companies. This thesis addresses a real-life industrial problem of creating package bids for a company's transportation procurement auction. The purpose of offering package bids is to increase the carriers' capacity and to improve the reliability of services. In this thesis, we investigate the possibility of forming packages using the company's own distribution network. Effective distribution of packages requires balanced cycles. A balanced cycle is a cycle containing no more than 3 nodes with equal loads (or volume of package) on every link in the cycle. We develop mixed-integer programs to find the maximum amount of network volume that can be covered by well-balanced cycles. These models are deterministic models that provide a rough guide on the optimal way of package formation when loads are known in advance. Since demand is random in real life, we perform a stochastic analysis of the problem using various techniques including simulation, probabilistic analysis and stochastic programming. Results from the stochastic analysis show that the effectiveness of package distribution depends on how we allocate the volumes on the lanes to create balanced cycles. If we always assign a fixed proportion of the lanes' volumes to the cycles, then it is only possible to have well-balanced cycles when the average volumes on the lanes are very large, validating the advantage of joint bids between several companies. However, if we assign a different proportion of the lanes' volumes to the cycles each time demand changes, then it is possible to create cycles that are balanced most of the time. An approximated solution method is provided to obtain a set of balanced cycles that can be bid out.
by Qian Wang.
S.M.
Aly, Mazen. "Automated Bid Adjustments in Search Engine Advertising." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210651.
Повний текст джерелаI digital marknadsföring tillåter de dominerande sökmotorerna en annonsör att ändra sina bud med hjälp av så kallade budjusteringar baserat på olika dimensioner i sökförfrågan, i syfte att kompensera för olika värden de dimensionerna medför. I det här arbetet tas en modell fram för att sätta budjusteringar i syfte att öka mängden konverteringar och samtidigt minska kostnaden per konvertering. En statistisk modell används för att välja kampanjer och dimensioner som behöver justeringar och flera olika tekniker för att bestämma justeringens storlek, som kan spänna från -90% till 900%, undersöks. Utöver detta tas en evalueringsmetod fram som använder en kampanjs historiska data för att utvärdera de olika metoderna och validera olika tillvägagångssätt. Vi studerar interaktionsproblemet mellan olika dimensioners budjusteringar och en lösning formuleras. Realtidsexperiment visar att vår modell för budjusteringar förbättrade prestandan i marknadsföringskampanjerna med statistisk signifikans. Konverteringarna ökade med 9% och kostnaden per konvertering minskade med 10%.
Mikheev, Sergej [Verfasser]. "Portfolio optimization in arbitrary dimensions in the presence of small bid-ask spreads / Sergej Mikheev." Kiel : Universitätsbibliothek Kiel, 2018. http://d-nb.info/1155760778/34.
Повний текст джерелаBalkan, Kaan. "Robust Optimization Approach For Long-term Project Pricing." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12612104/index.pdf.
Повний текст джерелаinflation rates. We propose a Robust Optimization (RO) approach that can deal with the uncertainties during the project lifecycle through the identification of several discrete scenarios. The bid project&rsquo
s performance measures, other than the monetary measures, for R&
D projects are identified and the problem is formulated as a multi-attribute utility project pricing problem. In our RO approach, the bid pricing problem is decomposed into two parts which are v solved sequentially: the Penalty-Model, and the RO model. In the Penalty-Model, penalty costs for the possible violations in the company&rsquo
s workforce level due to the bid project&rsquo
s workhour requirements are determined. Then the RO model searches for the optimum bid price by considering the penalty cost from the Penalty-Model, the bid project&rsquo
s performance measures, the probability of winning the bid for a given bid price and the deviations in the bid project&rsquo
s cost. Especially for the R&
D type projects, the model tends to place lower bid prices in the expected value solutions in order to win the bid. Thus, due to the possible deviations in the project cost, R&
D projects have a high probability of suffering from a financial loss in the expected value solutions. However, the robust solutions provide results which are more aware of the deviations in the bid project&rsquo
s cost and thus eliminate the financial risks by making a tradeoff between the bid project&rsquo
s benefits, probability of winning the bid and the financial loss risk. Results for the probability of winning in the robust solutions are observed to be lower than the expected value solutions, whereas expected value solutions have higher probabilities of suffering from a financial loss.
Lyu, Ke. "Studies on Auction Mechanism and Bid Generation in the Procurement of Truckload Transportation Services." Thesis, Troyes, 2021. http://www.theses.fr/2021TROY0032.
Повний текст джерелаTruckload transportation is a common mode of freight transportation, which accounts for a substantial portion of transportation industry, where shippers procure transportation services from carriers. Transportation service procurement is often realized by auction. Through designing effective auction mechanisms and efficient methods for solving related bid generation problems, shippers and carriers can save costs and increase profits respectively. This thesis studies three problems raised in the procurement of truckload transportation services realized by combinatorial auctions. Firstly, two two-phase combinatorial auction mechanisms are designed with supplementary bundles of requests offered for bid generated by the auctioneer and the carriers respectively in the second phase. Secondly, a column generation algorithm is proposed to solve the bid generation problem appeared in the combinatorial auction. Finally, the bid generation problem is extended to one that considers both multiple periods and uncertainty in truckload transportation service procurement. This stochastic optimization problem is formulated through scenario optimization and deterministic equivalence. To solve this model, a Benders decomposition approach is proposed
Mubark, Athmar. "Computer Science Optimization Of Reverse auction : Reverse Auction." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-68140.
Повний текст джерелаTaylor, Kendra C. "Sequential Auction Design and Participant Behavior." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7250.
Повний текст джерелаMüller, Sibylle D. "Bio-inspired optimization algorithms for engineering applications /." Zürich, 2002. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=14719.
Повний текст джерелаZuniga, Virgilio. "Bio-inspired optimization algorithms for smart antennas." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5766.
Повний текст джерелаFrança, Fabricio Olivetti de. "Algoritmos bio-inspirados aplicados a otimização dinamica." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259091.
Повний текст джерелаDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-14T19:14:33Z (GMT). No. of bitstreams: 1 Franca_FabricioOlivettide_M.pdf: 2824607 bytes, checksum: 3de6277fbb2c8c3460d62b4d81d14f73 (MD5) Previous issue date: 2005
Resumo: Esta dissertação propõe algoritmos bio-inspirados para a solução de problemas de otimização dinâmica, ou seja, problemas em que a superfície de otimização no espaço de busca sofre variações diversas ao longo do tempo. Com a variação, no tempo, de número, posição e qualidade dos ótimos locais, as técnicas de programação matemática tendem a apresentar uma acentuada degradação de desempenho, pois geralmente foram concebidas para tratar do caso estático. Algoritmos populacionais, controle dinâmico do número de indivíduos na população, estratégias de busca local e uso eficaz de memória são requisitos desejados para o sucesso da otimização dinâmica, sendo contemplados nas propostas de solução implementadas nesta dissertação. Os algoritmos a serem apresentados e comparados com alternativas competitivas presentes na literatura são baseados em funcionalidades e estruturas de processamento de sistemas imunológicos e de colônias de formigas. Pelo fato de considerarem todos os requisitos para uma busca eficaz em ambientes dinâmicos, o desempenho dos algoritmos imuno-inspirados se mostrou superior em todos os critérios considerados para comparação dos resultados dos experimentos.
Abstract: This dissertation proposes bio-inspired algorithms to solve dynamic optimization problems, i.e., problems for which the optimization surface on the search space suffers several changes over time. With such variation of number, position and quality of local optima, mathematical programming techniques may present degradation of performance, because they were usually conceived to deal with static problems. Population-based algorithms, dynamic control of the population size, local search strategies and an efficient memory usage are desirable requirements to a proper treatment of dynamic optimization problems, thus being incorporated into the solution strategies implemented here. The algorithms to be presented, and compared with competitive alternatives available in the literature, are based on functionalities and processing structures of immune systems and ant colonies. Due to the capability of incorporating all the requirements for an efficient search on dynamic environments, the immune-inspired approaches overcome the others in all the performance criteria adopted to evaluate the experimental results.
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Castro, Junior Olacir Rodrigues. "Bio-inspired optimization algorithms for multi-objective problems." reponame:Repositório Institucional da UFPR, 2017. http://hdl.handle.net/1884/46312.
Повний текст джерелаCoorientador : Roberto Santana Hermida
Tese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa: Curitiba, 06/03/2017
Inclui referências : f. 161-72
Área de concentração : Computer Science
Resumo: Problemas multi-objetivo (MOPs) são caracterizados por terem duas ou mais funções objetivo a serem otimizadas simultaneamente. Nestes problemas, a meta é encontrar um conjunto de soluções não-dominadas geralmente chamado conjunto ótimo de Pareto cuja imagem no espaço de objetivos é chamada frente de Pareto. MOPs que apresentam mais de três funções objetivo a serem otimizadas são conhecidos como problemas com muitos objetivos (MaOPs) e vários estudos indicam que a capacidade de busca de algoritmos baseados em Pareto é severamente deteriorada nesses problemas. O desenvolvimento de otimizadores bio-inspirados para enfrentar MOPs e MaOPs é uma área que vem ganhando atenção na comunidade, no entanto, existem muitas oportunidades para inovar. O algoritmo de enxames de partículas multi-objetivo (MOPSO) é um dos algoritmos bio-inspirados adequados para ser modificado e melhorado, principalmente devido à sua simplicidade, flexibilidade e bons resultados. Para melhorar a capacidade de busca de MOPSOs, seguimos duas linhas de pesquisa diferentes: A primeira foca em métodos de líder e arquivamento. Trabalhos anteriores apontaram que esses componentes podem influenciar no desempenho do algoritmo, porém a seleção desses componentes pode ser dependente do problema. Uma alternativa para selecioná-los dinamicamente é empregando hiper-heurísticas. Ao combinar hiper-heurísticas e MOPSO, desenvolvemos um novo framework chamado H-MOPSO. A segunda linha de pesquisa também é baseada em trabalhos anteriores do grupo que focam em múltiplos enxames. Isso é feito selecionando como base o framework multi-enxame iterado (I-Multi), cujo procedimento de busca pode ser dividido em busca de diversidade e busca com múltiplos enxames, e a última usa agrupamento para dividir um enxame em vários sub-enxames. Para melhorar o desempenho do I-Multi, exploramos duas possibilidades: a primeira foi investigar o efeito de diferentes características do mecanismo de agrupamento do I-Multi. A segunda foi investigar alternativas para melhorar a convergência de cada sub-enxame, como hibridizá-lo com um algoritmo de estimativa de distribuição (EDA). Este trabalho com EDA aumentou nosso interesse nesta abordagem, portanto seguimos outra linha de pesquisa, investigando alternativas para criar versões multi-objetivo de um dos EDAs mais poderosos da literatura, chamado estratégia de evolução baseada na adaptação da matriz de covariância (CMA-ES). Para validar o nosso trabalho, vários estudos empíricos foram conduzidos para investigar a capacidade de busca das abordagens propostas. Em todos os estudos, nossos algoritmos investigados alcançaram resultados competitivos ou melhores do que algoritmos bem estabelecidos da literatura. Palavras-chave: multi-objetivo, algoritmo de estimativa de distribuição, otimização por enxame de partículas, multiplos enxames, híper-heuristicas.
Abstract: Multi-Objective Problems (MOPs) are characterized by having two or more objective functions to be simultaneously optimized. In these problems, the goal is to find a set of non-dominated solutions usually called Pareto optimal set whose image in the objective space is called Pareto front. MOPs presenting more than three objective functions to be optimized are known as Many-Objective Problems (MaOPs) and several studies indicate that the search ability of Pareto-based algorithms is severely deteriorated in such problems. The development of bio-inspired optimizers to tackle MOPs and MaOPs is a field that has been gaining attention in the community, however there are many opportunities to innovate. Multi-objective Particle Swarm Optimization (MOPSO) is one of the bio-inspired algorithms suitable to be modified and improved, mostly due to its simplicity, flexibility and good results. To enhance the search ability of MOPSOs, we followed two different research lines: The first focus on leader and archiving methods. Previous works have pointed that these components can influence the algorithm performance, however the selection of these components can be problem-dependent. An alternative to dynamically select them is by employing hyper-heuristics. By combining hyper-heuristics and MOPSO, we developed a new framework called H-MOPSO. The second research line, is also based on previous works of the group that focus on multi-swarm. This is done by selecting as base framework the iterated multi swarm (I-Multi) algorithm, whose search procedure can be divided into diversity and multi-swarm searches, and the latter employs clustering to split a swarm into several sub-swarms. In order to improve the performance of I-Multi, we explored two possibilities: the first was to further investigate the effect of different characteristics of the clustering mechanism of I-Multi. The second was to investigate alternatives to improve the convergence of each sub-swarm, like hybridizing it to an Estimation of Distribution Algorithm (EDA). This work on EDA increased our interest in this approach, hence we followed another research line by investigating alternatives to create multi-objective versions of one of the most powerful EDAs from the literature, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). In order to validate our work, several empirical studies were conducted to investigate the search ability of the approaches proposed. In all studies, our investigated algorithms have reached competitive or better results than well established algorithms from the literature. Keywords: multi-objective, estimation of distribution algorithms, particle swarm optimization, multi-swarm, hyper-heuristics.
Takac, Martin. "Randomized coordinate descent methods for big data optimization." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9670.
Повний текст джерелаSturt, Bradley Eli. "Dynamic optimization in the age of big data." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127292.
Повний текст джерелаCataloged from the official PDF of thesis.
Includes bibliographical references (pages 241-249).
This thesis revisits a fundamental class of dynamic optimization problems introduced by Dantzig (1955). These decision problems remain widely studied in many applications domains (e.g., inventory management, finance, energy planning) but require access to probability distributions that are rarely known in practice. First, we propose a new data-driven approach for addressing multi-stage stochastic linear optimization problems with unknown probability distributions. The approach consists of solving a robust optimization problem that is constructed from sample paths of the underlying stochastic process. As more sample paths are obtained, we prove that the optimal cost of the robust problem converges to that of the underlying stochastic problem. To the best of our knowledge, this is the first data-driven approach for multi-stage stochastic linear optimization problems which is asymptotically optimal when uncertainty is arbitrarily correlated across time.
Next, we develop approximation algorithms for the proposed data-driven approach by extending techniques from the field of robust optimization. In particular, we present a simple approximation algorithm, based on overlapping linear decision rules, which can be reformulated as a tractable linear optimization problem with size that scales linearly in the number of data points. For two-stage problems, we show the approximation algorithm is also asymptotically optimal, meaning that the optimal cost of the approximation algorithm converges to that of the underlying stochastic problem as the number of data points tends to infinity. Finally, we extend the proposed data-driven approach to address multi-stage stochastic linear optimization problems with side information. The approach combines predictive machine learning methods (such as K-nearest neighbors, kernel regression, and random forests) with the proposed robust optimization framework.
We prove that this machine learning-based approach is asymptotically optimal, and demonstrate the value of the proposed methodology in numerical experiments in the context of inventory management, scheduling, and finance.
by Bradley Eli Sturt.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center
Chan, Cameron D. "MECHANICAL OPTIMIZATION AND BUCKLING ANALYSIS OF BIO-COMPOSITES." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/877.
Повний текст джерелаSpagna, Nicolò. "Design and optimization of bed transportation at Herlev hospital." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3390/.
Повний текст джерелаArifeen, N. "Process design and optimization of bio-ethanol production system." Thesis, University of Manchester, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.509174.
Повний текст джерелаTsang, Wai-pong Wilburn, and 曾瑋邦. "Bio-inspired algorithms for single and multi-objective optimization." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B42182104.
Повний текст джерелаChen, Longbiao. "Big data-driven optimization in transportation and communication networks." Electronic Thesis or Diss., Sorbonne université, 2018. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2018SORUS393.pdf.
Повний текст джерелаThe evolution of metropolitan structures and the development of urban systems have created various kinds of urban networks, among which two types of networks are of great importance for our daily life, the transportation networks corresponding to human mobility in the physical space, and the communication networks supporting human interactions in the digital space. The rapid expansion in the scope and scale of these two networks raises a series of fundamental research questions on how to optimize these networks for their users. Some of the major objectives include demand responsiveness, anomaly awareness, cost effectiveness, energy efficiency, and service quality. Despite the distinct design intentions and implementation technologies, both the transportation and communication networks share common fundamental structures, and exhibit similar spatio-temporal dynamics. Correspondingly, there exists an array of key challenges that are common in the optimization in both networks, including network profiling, mobility prediction, traffic clustering, and resource allocation. To achieve the optimization objectives and address the research challenges, various analytical models, optimization algorithms, and simulation systems have been proposed and extensively studied across multiple disciplines. Generally, these simulation-based models are not evaluated in real-world networks, which may lead to sub-optimal results in deployment. With the emergence of ubiquitous sensing, communication and computing diagrams, a massive number of urban network data can be collected. Recent advances in big data analytics techniques have provided researchers great potentials to understand these data. Motivated by this trend, we aim to explore a new big data-driven network optimization paradigm, in which we address the above-mentioned research challenges by applying state-of-the-art data analytics methods to achieve network optimization goals. Following this research direction, in this dissertation, we propose two data-driven algorithms for network traffic clustering and user mobility prediction, and apply these algorithms to real-world optimization tasks in the transportation and communication networks. First, by analyzing large-scale traffic datasets from both networks, we propose a graph-based traffic clustering algorithm to better understand the traffic similarities and variations across different area and time. Upon this basis, we apply the traffic clustering algorithm to the following two network optimization applications. 1. Dynamic traffic clustering for demand-responsive bikeshare networks. In this application, we dynamically cluster bike stations with similar usage patterns to obtain stable and predictable cluster-wise bike traffic demands, so as to foresee over-demand stations in the network and enable demand-responsive bike scheduling. Evaluation results using real-world data from New York City and Washington, D.C. show that our framework accurately foresees over-demand clusters (e.g. with 0.882 precision and 0.938 recall in NYC), and outperforms other baseline methods significantly. 2. Complementary traffic clustering for cost-effective C-RAN. In this application, we cluster RRHs with complementary traffic patterns (e.g., an RRH in residential area and an RRH in business district) to reuse the total capacity of the BBUs, so as to reduce the overall deployment cost. We evaluate our framework with real-world network data collected from the city of Milan, Italy and the province of Trentino, Italy. Results show that our method effectively reduces the overall deployment cost to 48.4\% and 51.7\% of the traditional RAN architecture in the two datasets, respectively, and consistently outperforms other baseline methods. Second, by analyzing large-scale user mobility datasets from both networks, we propose [...]
Tsang, Wai-pong Wilburn. "Bio-inspired algorithms for single and multi-objective optimization." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B42182104.
Повний текст джерелаMaronga, Savini. "On the optimization of the fluidized bed particulate coating process." Doctoral thesis, KTH, Chemical Engineering and Technology, 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2720.
Повний текст джерелаDifferent aspects that influence the fluidked bedparticulate coating process have been investigated. An easy touse procedure for creating temperature and humidity profilesfor the gas inside the bed was developed. The procedureinvolves measuring a limited number of points inside the bedand using these points generate more data points used for thecreation of the profiles. The profiles revealed that differentparts of the bed have a different involvement in the coatingprocess. Apart from showing the hydrodynamic conditions insidethe bed, the profiles can be used to optimize the size of thebed, to map the net migration of particles and to set thespraying rate limits.
The three-domain representation of the bed was used to modelthe coating process. The model showed that large beds and theexistence of stagnant region within the bed widen the toatingdistribution. Increasing the rate of transfer to the sprayingdomain or increasing the overall mixing of the bed Will havethe opposite effect of narrowing the coating distribution. Theunequal transfer between domains can be used to manipulate thetoating distribution. The combination of bed ske, differentrates of transfer between domains, size of spraying domain andthe rate of spraying can be used to obtain particles that arecoated to a particular distribution.The mechanism and kinetics of growth in a top sprayingprocess were determined by coating two poly-distributed seedparticles with a cellulose under different operatingconditions. The resulting particle distribution reveals thatnot all particles in the bed are equally coated. For the topspraying process, smaller particles Capture more toating thanlarger particles. A narrowing of the seed distribution wasfound to increase the chance of toating the large particles.The results also confirmed that particles are coated only aftervisiting the spraying region, which is small compared to therest of the bed. A growth model developed using theexperimental results introduces a segregation factor whichrepresent the probability of different particle sizes beingcoated. For the top spraying coating of lactose particle with acellulose, the segregation factor was found to be anexponential decaying function of the particle weight.
Keywords:granulation, coating, surface layering,segregation, coating uniformity, temperature protile, humidityprofile, growth kinetics, particle coating.
Wei, Kang. "Bio-inspired Reconfigurable Elastomer-liquid Lens: Design, Actuation and Optimization." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429657034.
Повний текст джерелаKhan, Mukhtaj. "Hadoop performance modeling and job optimization for big data analytics." Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11078.
Повний текст джерелаCurti, Nico <1992>. "Implementation and optimization of algorithms in Biomedical Big Data Analytics." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amsdottorato.unibo.it/9371/1/PhDThesis.pdf.
Повний текст джерелаSohangir, Soroosh. "MACHINE LEARNING ALGORITHM PERFORMANCE OPTIMIZATION: SOLVING ISSUES OF BIG DATA ANALYSIS." OpenSIUC, 2015. https://opensiuc.lib.siu.edu/dissertations/1111.
Повний текст джерелаZandi, Atashbar Nasim. "Modeling and Optimization of Biomass Supply Chains for Several Bio-refineries." Thesis, Troyes, 2017. http://www.theses.fr/2017TROY0038.
Повний текст джерелаBiomass can play a crucial role as one of the main sources of renewable energies. As logistics holds a significant share of biomass cost, efficient biomass supply chains must be designed to provide bio-refineries with adequate quantities of biomass at reasonable prices and appropriate times. This thesis focuses on modeling and optimization of multi-biomass supply chains for several bio-refineries. A data model is developed to list, analyze and structure the set of required data, in a logical way. The result is a set of tables that can be loaded into mathematical models for solving optimization problems. Then, a multi-period mixed integer linear programming model is proposed to optimize a multi-biomass supply chains for several bio-refineries, at the tactical and strategic level. Refineries can be already placed or located by the model. The aim is to minimize the total costs, including biomass production, storage, handling, refineries setup and transportation costs, while satisfying the demand of refineries in each period. Additionally, a multi-objective model is developed to optimize simultaneously the economic and environmental performance of biomass supply chains. The model is solved by using the ε-constraint method. Furthermore, large-scale tests on real data for two regions of France (Picardie & Champagne-Ardenne) are prepared to evaluate the proposed models. Finally, two-phase approaches are proposed to solve large-scale instances in reasonable running times, while evaluating the loss of optimality compared to the exact model
WILSON, GREGORY. "ANAEROBIC/AEROBIC BIODEGRADATION OF PENTACHLOROPHENOL USING GAC FLUIDIZED BED BIOREACTORS: OPTIMIZATION OF THE EMPTY BED CONTACT TIME." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1018531262.
Повний текст джерелаCasazza, Marco. "Algorithms for Optimization Problems with Fractional Resources." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD048/document.
Повний текст джерелаIn this thesis we consider a class of optimization problems having adistinctive feature : both discrete and continuous decisions need to betaken simultaneously. These problems arise in many practical applications,for example broadband telecommunications and green transportation problems, where resources are available, that can be fractionally consumed or assigned. These problems are proven of being harder than their purely discrete counterpart. We propose effective methodologies to tackle them. Our approach is to consider variants of classical combinatorial optimization problems belonging to three domains : packing, routing, and integrated routing / packing. Our results suggest that indeed effective approaches exist, reducing the computational effort required for solving the problem. Mostly, they arebased on exploiting the structure of optimal solutions to reduce the search space
In questa tesi affrontiamo una classe di problemi di ottimizzazione con una caratteristica in comune : sia le decisioni discrete che quelle continue devono essere prese simultaneamente. Questi problemi emergono in molti campi, come ad esempio le nelle telecomunicazioni abanda larga e in problemi di trasporto ecologico, dove le risorse disponibili possono essere consumate o assegnate in modo frazionario.Questi problemi sono generalmente più difficili da risolvere rispetto alla loro controparte puramente combinatoria. Noi proponiamo metodologie efficaci per affrontarli. Con il nostro approccio consideriamo varianti di problemi classici nel campo dell’ottimizzazione combinatoriache appartengono a tre domini : impaccamento, instradamento einstradamento / impaccamento integrati. I nostri risultati suggeriscono l’esistenza di approcci efficienti che riducono lo sforzo computazionale necessario per risolvere questi problemi. Nella maggior parte deicasi, tali approcci sono basati sullo sfruttamento di particolari proprietà della struttura delle soluzioni ottime in modo da ridurre lo spaziodi ricerca
Rajachidambaram, Sarojini Priyadarshini. "NANOCONTROLLER PROGRAM OPTIMIZATION USING ITE DAGS." UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/479.
Повний текст джерелаIlicak, Isil. "Bi-objective Bin Packing Problems." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/2/1079987/index.pdf.
Повний текст джерелаLee, Moon-bor Bob, and 李滿坡. "Optimization of highway networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31952677.
Повний текст джерелаVanden, Berg Andrew M. "Optimization-simulation framework to optimize hospital bed allocation in academic medical centers." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120223.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 99-100).
Congestion, overcrowding, and increasing patient wait times are major challenges that many large, academic centers currently face. To address these challenges, hospitals must effectively utilize available beds through proper strategic bed allocation and robust operational day-to-day bed assignment policies. Since patient daily demand for beds is highly variable, it is frequent that the physical capacity allocated to a given clinical service is not sufficient to accommodate all of the patients who belong to that service. This situation could lead to extensive wait time of patients in various locations in the hospital (e.g., the emergency department), as well as clinically and operationally undesirable misplacements of patients in hospital floors/beds that are managed by other clinical services than the ones to which the patients belong. In this thesis, we develop an optimization-simulation framework to optimize the bed allocation at Mass General Hospital. Detailed, data-driven simulation suggests that the newly proposed bed allocation would lead to significant reduction in patient intra-day wait time in the emergency department and other hospital locations, as well as a major reduction in the misplacements of patients in the Medicine service, which is the largest service in the hospital. We employ a two-pronged approach. First, we developed a detailed simulation setting of the entire hospital that could be used to assess the effectiveness of day-to-day operational bed assignment policies given a specific bed allocation. However, the simulation does not allow tractable optimization that seeks to find the best bed allocation among all possible allocations. This motivates the development of a network-flow/network design inspired mixed integer program that approximates the operational performance of bed allocations and allows us to effectively search for approximately the best allocation. The mixed integer program can be solved via a scenario sampling approach to provide candidate bed allocations. These are then tested and evaluated via the simulation setting. These tools facilitate expert discussions on how to modify the existing bed allocation at MGH to improve the day-to-day performance of the bed assignment process.
by Andrew M. Vanden Berg.
S.M.
Boyle, Kellie. "Optimization of Moving Bed Biofilm Reactor (MBBR) Operation for Brewery Wastewater Treatment." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/39147.
Повний текст джерелаMansuri, Dolly N. "Optimization of Formwork Management Using Building Information Modeling (BIM) and Cascading Tool." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470743739.
Повний текст джерелаDeBruyne, Sandra DeBruyne. "Bio-Inspired Evolutionary Algorithms for Multi-Objective Optimization Applied to Engineering Applications." University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1542282067378143.
Повний текст джерелаHahne, William. "Optimization of laser powder bed fusion process parameters for 316L stainless steel." Thesis, Uppsala universitet, Oorganisk kemi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-448263.
Повний текст джерелаNavarro-Brull, Francisco J. "Modeling, Simulation and Optimization of Multiphase Micropacked-Bed Reactors and Capillary Sonoreactors." Doctoral thesis, Universidad de Alicante, 2018. http://hdl.handle.net/10045/90920.
Повний текст джерелаPAMPARARO, GIOVANNI. "Nanostructured catalysts for the bio-ethanol conversion to acetaldehyde: development and optimization." Doctoral thesis, Università degli studi di Genova, 2022. http://hdl.handle.net/11567/1073525.
Повний текст джерелаJottreau, Benoît. "Financial models and price formation : applications to sport betting." Thesis, Paris Est, 2009. http://www.theses.fr/2009PEST1031.
Повний текст джерелаThis thesis is composed of four chapters. The first one deals with the pricing of financial products in a single jump model for the risky asset. This jump represents the bankrupcy of the quoted firm. We study the pricing of derivatives in the context of indifference of utility with an exponential utility. By means of dynamic programming we show that the bond price is solution of an ordinary differential equation and that stock price dependent options are solutions of an equation with partial derivatives of Hamilton-Jacobi-Bellman type generalizing the Black-Scholes one. We then try to quantify differences in the price obtained here and the one from Merton model without jump. The second chapter deals with a specific jump market : the soccer betting market. We recall the different model families for a soccer match and introduce some full model which allows to price the products recently born in this market in last ten years. Nevertheless the model complexity leads us to study a simplified model introduced by Dixon and Robinson from which we are able to derive closed formulas and simulate prices that we compare to market prices. We remark that implicit calibration gives pretty goof fit of market data. Third chapter developps the approach of Levitt [Lev04] on price formation in binary betting market held by a monopolistic market-maker operating in a one time step trading. We generalize Levitt results with european format of betting. We show that prices are distorded on the pressure of demand and offer, that phenomena introducing a market probability that allows to price products under this new measure. We identify some best model for demand and offer and market maker strategy and show that probability change is obvious in case of imperfect information about the value of the product. Fourth chapter generalizes this approach to the case of general payoffs and continuous time. The task is more complex and we just derive partial derivative equations from dynamic programming that enable us to give the bid-ask prices of the product traded by the market-maker. One result is that, in most models, bid-ask spread does not depend on the inventory held by the dealer whereas mid-quote price strongly reflects the unbalance of the dealer
Perin, Giorgio. "Biotechnological optimization of microalgae for the sustainable production of biocommodities." Doctoral thesis, Università degli studi di Padova, 2016. http://hdl.handle.net/11577/3424372.
Повний текст джерелаLe attuali tendenze di sviluppo economico mondiale si basano fortemente sullo sfruttamento di combustibili fossili, che sono responsabili di un netto rilascio di gas serra (ad esempio CO2) nell'atmosfera. Nel 2014, il gruppo intergovernativo di esperti sui cambiamenti climatici (IPCC), ha dichiarato che questo incremento netto di CO2 atmosferica è di origine antropogenica, e che porterà all’aumento della temperatura globale di > 2 °C, prima della fine di questo secolo. Quest'ultimo contribuirà fortemente alla modifica del comportamento del clima e degli oceani (ad esempio portando alla loro acidificazione ed ossigenazione) in modo permanente, con conseguente aumento delle pressioni demografiche sulla sicurezza alimentare e idrica, nonché sulla bio-diversità funzionale di diversi ecosistemi. Per evitare questo scenario apocalittico, lo sviluppo di fonti energetiche rinnovabili e pulite per sostenere una parte consistente dell'economia globale è una sfida inevitabile per la nostra società. Un'economia basata sulla biomassa vegetale potrebbe soddisfare questa esigenza, ma diversi studi hanno previsto un’inflazione dei prezzi alimentari e un concreto debito di carbonio, come conseguenza di questo scenario. Al contrario, lo sfruttamento della biomassa delle microalghe potrebbe in realtà evitare questi problemi e portare ad un effetto positivo sui livelli di CO2, portando al suo sequestro e fissazione in carbonio organico. Attualmente, le microalghe sono infatti i migliori organismi capaci di sequestrare la CO2, grazie a tassi fotosintetici più elevati rispetto alle piante. La loro capacità di crescere su terreni marginali e sfruttando le acque di scarto apre le porte per la loro applicazione come agenti in grado di mitigare l’impatto ambientale degli attuali processi industriali. Il loro impiego potrebbe essere infatti la chiave per lo sviluppo di un processo integrato in cui la biomassa dovrebbe essere usata per convertire la maggior dell'economia attuale verso processi rispettosi dell'ambiente. Nonostante questo scenario promettente, attualmente soprattutto specie di microalghe di tipo selvatico sono impiegate a questi scopi. La loro evoluzione in un ambiente naturale, diverso da quello artificiale sfruttato durante la coltivazione industriale intensiva, ostacola fortemente le produttività teoriche della biomassa, portando a valori insoddisfacenti. Lo sviluppo di un'economia basata sulle alghe infatti dipende dall’efficiente conversione dell'energia luminosa in biomassa e dall'ottimizzazione delle vie metaboliche per massimizzare la sintesi dei prodotti di interesse. Ancora lontani dallo sviluppo di una coltivazione industriale di microalghe economicamente competitiva ed energicamente sostenibile, questi organismi devono quindi subire un’ottimizzazione biotecnologica per raggiungere la soglia di competitività. Sebbene non ci sia una specie ideale che potrebbe servire a soddisfare tutti i bisogni umani, noi ci siamo concentrati sulla specie di acqua marina Nannochloropsis gaditana, che è un candidato promettente sia per indagini biologiche di base che applicative. La seguente tesi di dottorato è stato concepita per fornire un’investigazione molecolare sull’efficienza fotosintetica e la regolazione metabolica di N. gaditana, al fine di fornire i bersagli molecolari per il suo miglioramento biotecnologico. Il presupposto di questo lavoro sperimentale era l'ottimizzazione degli strumenti molecolari attualmente disponibili per la manipolazione genetica di N. gaditana e anche le informazioni molecolari disponibili sono state quindi significativamente migliorate. Nel capitolo II è stato eseguito un approccio di mutagenesi casuale al fine di isolare ceppi mutanti con fenotipi fotosintetici, possibilmente più adatti alle condizioni di crescita intensiva. I ceppi selezionati in effetti hanno mostrato un miglioramento della fotosintesi in condizioni di crescita limitanti, rappresentando anche degli strumenti biologici per migliorare le informazioni disponibili sugli elementi molecolari alla base del controllo dell’efficienza dell’uso della luce in questo organismo. Quando testato in condizioni di crescita su scala di laboratorio, il ceppo E2, selezionato per una riduzione del contenuto in clorofilla, ha infatti mostrato un miglioramento della produttività della biomassa, rappresentando quindi una conferma per gli approcci biotecnologici qui sviluppati, di essere in grado di migliorare le prestazioni fotosintetiche di questo organismo, nell'ambiente artificiale di un fotobioreattore. Tra i ceppi mutanti isolati, nel capitolo III, due principali fenotipi fotosintetici, la riduzione nel contenuto di clorofilla (ceppo E2) e l'impossibilità di attivare il meccanismo di NPQ (ceppo I48), sono stati scelti come criteri di selezione per migliorare, rispettivamente, i meccanismi di penetrazione della luce e di conversione dell'energia luminosa in una cultura intensiva. Entrambi infatti hanno mostrato una produttività della biomassa maggiore nelle culture che simulano le condizioni industriali, dimostrando il vantaggio teorico dato dal loro sfruttamento. Tuttavia, quando le condizioni di crescita sono state cambiate, variando la disponibilità di luce, i mutanti selezionati hanno alterato il loro comportamento. Non erano in grado di essere più produttivi del WT in tutte le condizioni testate. Questo spiegherebbe perché i dati pubblicati fino ad oggi per gli stessi mutanti, isolati in altre specie, spesso forniscano risultati contrastanti. Abbiamo quindi concluso che i mutanti fotosintetici possono modulare il loro fenotipo in relazione alle condizioni di crescita e alcune di queste potrebbero infatti evidenziare i loro svantaggi piuttosto che i loro benefici. Pertanto, i futuri approcci di ingegneria genetica dovranno essere adattati adeguatamente alle condizioni di crescita utilizzate. La strategia di genetica diretta qui sviluppata potrebbe aprire le porte verso l'individuazione delle basi molecolari che regolano la fotosintesi in questa specie promettente. Nel capitolo IV il ceppo mutante I48 è stato ulteriormente indagato per individuare le basi genetiche responsabili del suo fenotipo. Grazie al ri-sequenziamento del suo intero genoma abbiamo identificato una variante di splicing nel sito di splicing donatore al 5’ del 4 ° introne del gene Naga_100173g12, che codifica per la proteina LHCX1. Questa mutazione ha causato la ritenzione della sequenza dell’introne, portando ad un prodotto proteico tronco, che viene probabilmente degradato. L'assenza della proteina LHCX1 si correla fortemente con l'incapacità di attivare l’NPQ, dal momento che questo gruppo di proteine è ben noto per essere coinvolto nell'attivazione di tale meccanismo. Tuttavia, la futura complementazione del fenotipo servirà per validare questa conclusione. Inoltre, la proteina LHCX1 è stata trovata co-localizzata con il PSI in N. gaditana, quindi il ceppo I48 potrebbe anche servire come strumento ottimale per indagare ulteriormente il ruolo biologico di questa associazione. Per sviluppare un’efficace strategia di ottimizzazione biotecnologica, le informazioni relative alla regolazione del metabolismo di N. gaditana devono essere notevolmente arricchite. Capire la direzione dei flussi metabolici potrebbe permettere di colpire in particolare solo quelli che sono coinvolti nell’accumulo di un determinato prodotto, senza influenzare altre vie metaboliche, cosa che potrebbe portare ad un possibile impatto negativo sulla crescita. Nel capitolo V un'analisi integrata con approcci genomici, biochimici e fisiologici ci ha aiutato a decifrare il rimodellamento metabolico di N. gaditana, che porta il suo metabolismo verso una maggiore produzione di lipidi in condizioni di luce in eccesso. Quest'ultima condizione infatti induce l'accumulo di di-acilgliceroli (DAG) e tri-acilgliceroli (TAG), insieme alla sovra-regolazione di geni coinvolti nella loro biosintesi. Abbiamo visto l'induzione di geni del complesso citosolico dell’acido grasso sintasi (FAS1) e la sub-regolazione di quelli del cloroplasto (FAS2). L’accumulo di lipidi è accompagnato dalla regolazione di trasportatori di trioso fosfati / fosfato inorganico attraverso le membrane del cloroplasto, inducendo la ripartizione metabolica del carbonio tra compartimenti cellulari e favorendo il citoplasma ed il reticolo endoplasmatico a spese del cloroplasto. Ciò ha evidenziato la flessibilità del metabolismo di N. gaditana al fine di rispondere alle esigenze ambientali. Nel capitolo VI le informazioni acquisite da quest'ultimo capitolo sono state sfruttate per testare le potenzialità di questa specie promettente, anche come piattaforma di espressione di proteine. Abbiamo costruito un sistema modulare per la sovra-espressione di proteine in cui le sequenze regolatrici sono state scelte tra quelle che inducono un elevato livello di trascrizione o che sono altamente regolate dalla disponibilità di luce. N. gaditana si è rivelata essere un organismo molto promettente per l'espressione di proteine, data la maggiore attività luciferasica osservata, rispetto alla specie di riferimento per tali applicazioni, C. reinhardtii. È stato sviluppato un metodo per testare l'efficacia di diverse sequenze regolatrici nel guidare l'espressione di proteine così come sono stati preparati diversi vettori di espressione, pronti per essere testati. L'indagine della regolazione del metabolismo di N. gaditana, svolta nel capitolo V, ha mostrato una fine regolazione dei suoi componenti dell'apparato fotosintetico, in diverse condizioni di luce. Concentrandosi sulle proteine antenna, coinvolte nella cattura delle luce (light-harvesting complex (LHC) proteins) abbiamo identificato una nuova proteina LHCX in questa specie, chiamata LHCX3 (ID del gene: Naga_101036g3), la cui sequenza codificante non era annotata in modo corretto. Nel capitolo VII, la corretta sequenza codificante di questo gene è stata studiata ulteriormente e convalidata sperimentalmente con tecniche molecolari. La proteina LHCX3 ha rivelato la presenza di un dominio simile a quello di tipo fasciclina I, all’N-terminale, e sono stati eseguiti un’analisi di sequenza insieme ad uno studio evolutivo preliminare per dedurre il ruolo biologico di questa associazione. Poiché il metabolismo delle alghe si basa interamente sulla disponibilità di luce, è fondamentale indagare l'effetto dell’intensità della luce sulla crescita per studiare la loro applicazione industriale. Nel capitolo VIII, abbiamo sviluppato una piattaforma su micro-scala, che abbiamo chiamato micro-fotobioreattore, per indagare facilmente l'impatto dell’intensità della luce sulla crescita di N. gaditana. Siamo stati in grado di testare simultaneamente l'effetto di diversi regimi di luce, anche sulle prestazioni fotosintetiche, in un sistema integrato che potrebbe essere associato a studi sull’impatto delle sostanze nutritive, accelerando il processo di caratterizzazione di N. gaditana. Nella tesi sono state incluse anche tre sezioni di appendice, in cui alcune delle tecniche sperimentali sfruttate in questo lavoro sono state applicate a diversi organismi, con l'obiettivo comune di indagare l’efficienza dell’uso della luce e gli elementi molecolari coinvolti nella sua regolazione. Nell’appendice I, è stato descritto lo sviluppo di un modello matematico per la previsione dei dati di crescita e di fluorescenza, nella specie Nannochloropsis salina. Il lavoro è stato svolto in collaborazione con il Prof. Fabrizio Bezzo del dipartimento di ingegneria industriale dell'università di Padova. Lo sviluppo di modelli di previsione del comportamento che rappresentino i fenomeni che influenzano la crescita delle alghe, potrebbe essere molto utile nella progettazione e ottimizzazione dei sistemi di produzione a livello industriale. Il modello sviluppato descrive bene la crescita di N. salina in un ampio intervallo di intensità di luce, e potrebbe essere ulteriormente implementato per descrivere anche l'influenza sulla crescita di altri parametri, come la disponibilità di nutrienti ed il mescolamento. Nell’appendice II, il monitoraggio della fluorescenza della clorofilla in vivo è stato sfruttato per studiare le caratteristiche fotosintetiche di piante di riso, esposte a condizioni di stress salino. I risultati presentati sono parte di un progetto più ampio (in collaborazione con la Prof. Fiorella Lo Schiavo del dipartimento di biologia dell'università di Padova), con l'obiettivo di rappresentare il rimodellamento fisiologico, biochimico e molecolare, subito da una delle principali colture destinate ad usi alimentari nel mondo, in risposta a condizioni di stress salino. La descrizione dell'impatto degli stress ambientali sulla fotosintesi è fondamentale per controllare la produttività della biomassa delle piante poiché il loro metabolismo dipende interamente dalla fotosintesi per la crescita. Abbiamo osservato l'attivazione del meccanismo di NPQ in piante tolleranti il sale, sottolineando l'importanza del monitoraggio delle caratteristiche fotosintetiche per prevedere le prestazioni delle piante, direttamente sul campo. Nell’ appendice III, sono stati isolati i tilacoidi di Chlamydomonas reinhardtii marcati con atomi 13C - 15N, sia dal ceppo cw15 che dal ceppo mutante npq2, al fine di studiare la loro struttura e la dinamica delle proteine e dei lipidi costituenti, in situ, applicando la tecnica dell’NMR allo stato solido, in collaborazione con il gruppo del Prof. Anjali Pandit dell'Istituto di chimica di Leiden. Queste analisi serviranno per studiare il rimodellamento delle membrane fotosintetiche che passano da uno stato attivo (ceppo cw15) ad uno stato foto-protettivo (ceppo mutante npq2), durante il passaggio verso condizioni di luce in eccesso, con lo scopo finale di comprendere i processi biochimici che regolano quest'evento.
Kalavri, Vasiliki. "Performance Optimization Techniques and Tools for Distributed Graph Processing." Doctoral thesis, KTH, Programvaruteknik och Datorsystem, SCS, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-192471.
Повний текст джерелаQC 20160919
Karppanen, E. (Erkki). "Advanced control of an industrial circulating fluidized bed boiler using fuzzy logic." Doctoral thesis, University of Oulu, 2000. http://urn.fi/urn:isbn:9514255194.
Повний текст джерела李國誠 and Kwok-shing Lee. "Convergences of stochastic optimization algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B3025632X.
Повний текст джерелаLü, Lin, and 吕琳. "Geometric optimization for shape processing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46483640.
Повний текст джерелаBoisard, Olivier. "Optimization and implementation of bio-inspired feature extraction frameworks for visual object recognition." Thesis, Dijon, 2016. http://www.theses.fr/2016DIJOS016/document.
Повний текст джерелаIndustry has growing needs for so-called “intelligent systems”, capable of not only ac-quire data, but also to analyse it and to make decisions accordingly. Such systems areparticularly useful for video-surveillance, in which case alarms must be raised in case ofan intrusion. For cost saving and power consumption reasons, it is better to perform thatprocess as close to the sensor as possible. To address that issue, a promising approach isto use bio-inspired frameworks, which consist in applying computational biology modelsto industrial applications. The work carried out during that thesis consisted in select-ing bio-inspired feature extraction frameworks, and to optimize them with the aim toimplement them on a dedicated hardware platform, for computer vision applications.First, we propose a generic algorithm, which may be used in several use case scenarios,having an acceptable complexity and a low memory print. Then, we proposed opti-mizations for a more global framework, based on precision degradation in computations,hence easing up its implementation on embedded systems. Results suggest that whilethe framework we developed may not be as accurate as the state of the art, it is moregeneric. Furthermore, the optimizations we proposed for the more complex frameworkare fully compatible with other optimizations from the literature, and provide encourag-ing perspective for future developments. Finally, both contributions have a scope thatgoes beyond the sole frameworks that we studied, and may be used in other, more widelyused frameworks as well
Duespohl, Dale W. "Modeling and optimization of a cross-flow, moving-bed, flue gas desulfurization reactor." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1179511746.
Повний текст джерелаBentley, Jason A. "Systematic process development by simultaneous modeling and optimization of simulated moving bed chromatography." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47531.
Повний текст джерелаPrice, Dorielle T. "Optimization of Bio-Impedance Sensor for Enhanced Detection and Characterization of Adherent Cells." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4208.
Повний текст джерелаVaneeckhaute, Céline. "Nutrient recovery from bio-digestion waste : from field experimentation to model-based optimization." Doctoral thesis, Université Laval, 2015. http://hdl.handle.net/20.500.11794/26116.
Повний текст джерелаLa prise de conscience croissante de l’épuisement des ressources naturelles, la demande croissante de nutriments et d’énergie pour la production alimentaire et les normes de plus en plus strictes de décharge des nutriments et de fertilisation, ont donné lieu à une attention accrue pour la récupération des nutriments à partir des déchets municipaux et agricoles. Cette thèse de doctorat vise à stimuler la transition vers une bio-économie en fournissant des (moyens à développer des) stratégies durables pour la récupération des nutriments à partir des déchets organiques après la production de bio-énergie par la digestion anaérobie. Une attention particulière est accordée à la valorisation des produits récupérés comme substituts renouvelables aux engrais chimiques et/ou comme engrais organo-minéraux durables dans l'agriculture. Trois phases de recherche complémentaires ont été exécutées: 1) l'inventaire des technologies et la classification des produits, 2) l'évaluation de la valeur des produits, 3) la modélisation et l’optimisation des procédés. Dans la première phase, une revue systématique des technologies et une classification des produits ont été réalisées. Dans la seconde phase, la caractérisation des produits et des analyses de bilan de masse dans des stations de récupération des ressources de l’eau et des déchets (StaRRED) à grande échelle ont été exécutées. Une évaluation économique et écologique de différents scénarios de bio-fertilisation a été menée et les scénarios les plus durables ont été sélectionnés pour une évaluation agronomique réalisée ultérieurement sur le terrain et à l'échelle de la serre. Dans la troisième phase, une librairie générique de modèles pour la récupération des nutriments a été élaborée visant à modéliser la quantité et la qualité d'engrais. Une meilleure compréhension de la performance et des interactions des processus unitaires a été obtenue par des analyses de sensibilité globale. Les modèles ont été utilisés avec succès comme un outil pour la configuration et l'optimisation des chaînes de traitement. Sur la base de toutes les connaissances acquises, une feuille de route générique pour la mise en place des stratégies de récupération des nutriments en fonction des marchés et des législations des engrais, et de la caractérisation des déchets a été développée. En tant que telle, la présente thèse développe les concepts de fermeture maximale des cycles des nutriments dans une approche du berceau-au-berceau. Le travail apporte des preuves importantes de l'impact positif des produits récupérés sur l'économie, l'agronomie et l'écologie de la production végétale intensive. En outre, cette thèse offre des informations et des outils fondamentaux pour faciliter la mise en œuvre et l'optimisation des stratégies durables de récupération des nutriments. Ces résultats ouvrent de nouvelles possibilités pour une croissance économique durable axée sur les ressources biologiques et créent ainsi une situation gagnant-gagnant pour l'environnement, la société et l'économie en Belgique, au Canada, et au-delà.
The increasing awareness of natural resource depletion, the increasing demand of nutrients and energy for food production, and the more and more stringent nutrient discharge and fertilization levels, have resulted in an increased attention for nutrient recovery from municipal and agricultural wastes. This PhD dissertation aims at stimulating the transition to a bio-based economy by providing (tools to develop) sustainable strategies for nutrient recovery from organic wastes following bio-energy production through anaerobic digestion (= bio-digestion waste). Particular attention is paid to the valorization of the recovered products as renewable substitutes for chemical fertilizers and/or as sustainable organo-mineral fertilizers in agriculture. Three complementary research phases were conducted: 1) technology inventory and product classification, 2) product value evaluation, 3) process modelling and optimization. In the first phase, a systematic technology review and product classification was performed. In phase 2, product characterizations and mass balance analyses at full-scale waste(water) resource recovery facilities (WRRFs) were executed. An economic and ecological evaluation of different bio-based fertilization scenarios was conducted and the most sustainable scenarios were selected for subsequent agronomic evaluation at field and greenhouse scale. In phase 3, a generic nutrient recovery model library was developed aiming at fertilizer quantity and quality as model outputs. Increased insights in unit process performance and interactions were obtained through global sensitivity analyses. The models were successfully used as a tool for treatment train configuration and optimization. Based on all acquired knowledge, a generic roadmap for setting up nutrient recovery strategies as function of fertilizer markets, legislations, and waste characterization was established. As such, the present dissertation further develops the concepts of maximally closing nutrient cycles in a cradle-to-cradle approach. The work reveals important evidence of the positive impact of recovered products on the economy, agronomy, and ecology of intensive plant production. Moreover, it provides the fundamental information and tools to facilitate the implementation and optimization of sustainable nutrient recovery strategies. All of this may open up new opportunities for sustainable and more bio-based economic growth and thus create a win-win situation for the environment, the society, and the economy in Belgium, Canada, and beyond.
Vyhnalek, Brian. "Bio-Inspired Optimization of Ultra-Wideband Patch Antennas Using Graphics Processing Unit Acceleration." Cleveland State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=csu1398262685.
Повний текст джерела