Syfte: Studiens syfte var att jämföra två linsrengöringsmetoders påverkan på hornhinnan. Studien jämförde tillverkarens rekommenderade användningsinstruktioner för Opti-Free® Express®, med den alternativa rengöringsmetoden att gnugga linserna, något som ofta rekommenderas av optiker. Metod: Deltagarna sågs vid två tillfällen för utvärdering av eventuell påverkan på hornhinnan. Värdena som återfanns vid första tillfället fungerade som ett utgångsvärde. Samtliga fynd dokumenterades, graderades och poängräknades efter vilken typ av staining samt utbredning. Cornea delades in i fem regioner; centralt, superiort, inferiort, nasalt och temporalt. Typen staining som återfanns poängsattes enligt; mikropunktata (25), makropunktata (50), coalesced (75) och patch (100). Medelvärden för respektive deltagares ögon räknades ut genom att muliplicera poängen given för typen funnen staining med den procentuella utbredningen i varje region. Därefter dividera med fem för att få ett medelvärde utbrett över hela ögat. Deltagarna fick ett nytt par linser och blev därefter instruerade att under två veckors tid rengöra höger och vänster lins separat. Det ena sättet att rengöra var att följa tillverkarens rekommenderade instruktioner, något som innebär sköljning i fem sekunder per linssida. Det andra sättet var genom att gnugga linserna i en L-formad rörelse fem gånger per sida och därefter skölja linsen i fem sekunder. Efter två veckors tid undersöktes deltagarna på nytt. Funna värden sammanställdes och jämfördes sedan med varandra samt utgångsvärdena. Resultat: I de ögon vars linser gnuggades minskade medelvärdet av mängden staining från ursprungligen 140179 till 12185 (p = 0,68). Ursprungsvärdet för de ögon vars linser sköljdes var 125149, något som efter två veckor ökade till 214179 (p = 0,03). Medelvärdena efter två veckor för de båda rengöringsmetoderna uppkom till 12185 för gnugg respektive 214179 för skölj, jämförelser drogs emellan grupperna (p = 0,046). Slutsats: I de ögon vars linser rengjordes genom sköljning återfanns en högre grad av påverkan på hornhinnan. Mängd funnen staining var större i dessa ögon än i de ögon vars linser rengjordes genom gnuggning. Skillnaden var av statistisk signifikans. / The aim of this study was to compare the impact of contact lens cleaning on cornea using two different methods. The study compared the manufacturer’s recommended usage for Opti-Free® Express®, with the alternative cleaning method that involves rubbing the lens, a method often recommended by Optometrists. The participants were seen twice to evaluate the cornea. The values found on the first visit were used as baseline values. The participants were given a new pair of contact lenses and were told to clean them in two different ways for the upcoming two weeks. The first method was to follow the recommended instructions by the manufacturer. A method that involves rinsing the lens for five seconds per side. The alternative method was to rub both sides in shape of the letter L. This procedure was repeated five times per side followed by rinsing for five seconds. The participants were seen for a second visit after two weeks. Evaluations were once again made. The values found were compared with the baseline values as well with each other.  In those cases where the lenses had been cleaned by rubbing, the value of found staining decreased from 140179 at the baseline to 12185 after two weeks (p = 0,68). The baseline value for the eyes where the lenses were cleaned by rinsing was 125149. Those values increased to 214179 after two weeks (p = 0,03). A comparison between the two groups later values showed that there was a statistically significant difference between the two types of cleaning, where the eyes that were only rinsed contained a higher amount of staining (p = 0,046). In those eyes where lenses had been cleaned only by rinsing there were found a higher amount of staining compared to the ones cleaned by rubbing. The difference in found staining between the two cleaning methods were statistically significant.

The Bertrand Duopoly model for demand in economics is a well-used model. Although this model has important insights towards pricing strategy, it does not accurately depict true market behaviors. In this paper, we will examine the advantages and disadvantages of the current model and its assumptions.We then take a whole new approach towards modeling this phenomena, using Poisson processes to model the demand of goods. We will discuss why this is a better approach and explain how we can extend this to better understand pricing strategies and market dynamics. We then apply our findings to the newsvendor problem, a commonly used problem in inventory management. Using non-homogeneous Poisson processes we explain how to find an optimal pricing strategy and an optimal inventory level for the newsvendor problem.In this paper we explain how to extend the newsvendor problem to a newsvendor duopoly problem. Again we show how to find the optimal pricing strategies and inventory levels for multiple goods in a market. Having found the optimal pricing strategy and inventory level, we then examine the market dynamics in more details. We explore monopolistic and duopolistic markets where the goods range from complements to substitutes and homogeneous to differentiated goods. We discuss how to model the progression of the inventory probabilities and then explain how to price inventory options.

The rise in population causes serious issues in larger cities since the electrical grid is becoming overloaded. Simultaneously, the demand on more sustainable energy production and the use of renewable energy sources increase. Renewable energy based off-grid electrical systems are a possible solution to decrease the magnitude of these issues. The purpose of this thesis is to compare solar cells, solar thermal collectors and PVT (Photovoltaic thermal hybrid solar collectors) and design the most suitable combination of solar panels for a selfsufficient multi-family house in Jönköping, Sweden. The solar panels were compared from a cost and energy production perspective, then a suitable renewable energy system with all three types of panels was constructed and optimized using Opti-CE, which is a MATLABbased software. During the course of this thesis, an interview was made with Hans-Olof Nilsson who is a co-founder of Nilsson Energy and owner of a self-sufficient off-grid house. The results show that PVT-panels have higher energy production per area and 22% higher LCC (life cycle cost) than regular solar cells in combination with solar thermal collectors. Optimization results indicate that the house cannot be self-sufficient by installing solar panels on the given roof area only, rather the area of installed solar collectors should be increased to a minimum of 1497𝑚2 . With the given roof area of 900𝑚2 the house can only be self-sufficient a maximum of 75% of the time. The results also indicate that the introduction of compact systems with the simultaneous decrease of cost will make renewable off-grid energy systems more attractive in the future.

This diploma thesis deals with the monitoring of the movement of machines on the land and their influence on soil compaction. In the practical part, measurements and observation were carried out in the company Rolnická společnost Lesonice a.s Within two years, the values of individual sets were measured on the selected land and the values were compared between each other. Every year, other soil technology was implemented. 1st year minimalization technology for soil cultivation 2nd year StripTiil's Soil Technology, controlled motion across the land with designed Opti Trail plot lines.

It is known that Sweden is categorised by being one of the regions that experience low solar radiation because it is located in the northern hemisphere that has a low potential of solar radiation during the colder seasons. The government of Sweden aim to promote a more sustainable future by applying more renewable initiative in the energy sector. One of the initiatives is by applying more renewable energy where PV panels will play a greater role in our society and in the energy sector. However, the produced energy from the PV panels is unpredictable due to changes in radiation throughout the day. One great way to tackle this issue is by combining PV panels with different energy storage system. This thesis evaluates an off-grid rowhouse in Eskilstuna Sweden where the PV panels are combined with a heat pump, thermal storage tank, including batteries and hydrogen system. The yearly electrical demand is met by utilizing PV panels, battery system for short term usage and hydrogen system for long-term usage during the colder seasons. The yearly thermal demand is met by the thermal storage tank. The thermal storage tank is charged by heat losses from the hydrogen system and thermal energy from heat pump.The calculations were simulated in Excel and MATLAB where OPTI-CE is composed with different components in the energy system. Furthermore, the off-grid household was evaluated from an economic outlook with respect to today’s market including the potential price decrease in 2030.The results indicated that the selected household is technically practicable to produce enough energy. The PV panels produces 13 560 kWh annually where the total electrical demand reaches 6 125 kWh yearly (including required electricity for the heat pump). The annual energy demand in terms of electricity and thermal heat reaches 12 500 kWh which is covered by the simulated energy system. The overproduction is stored in the batteries and hydrogen storage for later use. The back-up diesel generator does not need to operate, indicating that energy system supplies enough energy for the off-grid household. The thermal storage tank stores enough thermal energy regarding to the thermal load and stores most of the heat during the summer when there are high heat losses due to the charge of the hydrogen system. The simulated energy system has a life cycle cost reaching approximately k$318 with a total lifetime of 25 years. A similar off-grid system has the potential to reduce the life cycle cost to k$195 if the energy system is built in 2030 with a similar lifespan. The reduction occurs due to the potential price reduction for different components utilized in the energy system.

<p>The problem under consideration is an unconstrained optimization&nbsp;problem with the objective function in the form of mathematical ex-pectation. The expectation is with respect to the random variable that represents the uncertainty. Therefore, the objective &nbsp;function is in fact deterministic. However, nding the analytical form of that objective function can be very dicult or even impossible. This is the reason why the sample average approximation is often used. In order to obtain reasonable good approximation of the objective function, we have to use relatively large sample size. We assume that the sample is generated at the beginning of the optimization process and therefore we can consider this sample average objective function as the deterministic one. However, applying some deterministic method on that sample average function from the start can be very costly. The number of evaluations of the function under expectation is a common way of measuring the cost of an algorithm. Therefore, methods that vary the sample size throughout the optimization process are developed. Most of them are trying to determine the optimal dynamics of increasing the sample size.</p><p>The main goal of this thesis is to develop the clas of methods that&nbsp;can decrease the cost of an algorithm by decreasing the number of&nbsp;function evaluations. The idea is to decrease the sample size whenever&nbsp;it seems to be reasonable - roughly speaking, we do not want to impose&nbsp;a large precision, i.e. a large sample size when we are far away from the&nbsp;solution we search for. The detailed description of the new methods&nbsp;<br />is presented in Chapter 4 together with the convergence analysis. It&nbsp;is shown that the approximate solution is of the same quality as the&nbsp;one obtained by dealing with the full sample from the start.</p><p>Another important characteristic of the methods that are proposed&nbsp;here is the line search technique which is used for obtaining the sub-sequent iterates. The idea is to nd a suitable direction and to search&nbsp;along it until we obtain a sucient decrease in the &nbsp;function value. The&nbsp;sucient decrease is determined throughout the line search rule. In&nbsp;Chapter 4, that rule is supposed to be monotone, i.e. we are imposing&nbsp;strict decrease of the function value. In order to decrease the cost of&nbsp;the algorithm even more and to enlarge the set of suitable search directions, we use nonmonotone line search rules in Chapter 5. Within that chapter, these rules are modied to t the variable sample size framework. Moreover, the conditions for the global convergence and the R-linear rate are presented.&nbsp;</p><p>In Chapter 6, numerical results are presented. The test problems&nbsp;are various - some of them are academic and some of them are real&nbsp;world problems. The academic problems are here to give us more&nbsp;insight into the behavior of the algorithms. On the other hand, data&nbsp;that comes from the real world problems are here to test the real&nbsp;applicability of the proposed algorithms. In the rst part of that&nbsp;chapter, the focus is on the variable sample size techniques. Different&nbsp;implementations of the proposed algorithm are compared to each other&nbsp;and to the other sample schemes as well. The second part is mostly&nbsp;devoted to the comparison of the various line search rules combined&nbsp;with dierent search directions in the variable sample size framework.&nbsp;The overall numerical results show that using the variable sample size&nbsp;can improve the performance of the algorithms signicantly, especially&nbsp;when the nonmonotone line search rules are used.</p><p>The rst chapter of this thesis provides the background material&nbsp;for the subsequent chapters. In Chapter 2, basics of the nonlinear&nbsp;optimization are presented and the focus is on the line search, while&nbsp;Chapter 3 deals with the stochastic framework. These chapters are&nbsp;here to provide the review of the relevant known results, while the&nbsp;rest of the thesis represents the original contribution.&nbsp;</p> / <p>U okviru ove teze posmatra se problem optimizacije bez ograničenja pri čcemu je funkcija cilja u formi matematičkog očekivanja. Očekivanje se odnosi na slučajnu promenljivu koja predstavlja neizvesnost. Zbog toga je funkcija cilja, u stvari, deterministička veličina. Ipak, odredjivanje analitičkog oblika te funkcije cilja može biti vrlo komplikovano pa čak i nemoguće. Zbog toga se za aproksimaciju često koristi uzoračko očcekivanje. Da bi se postigla dobra aproksimacija, obično je neophodan obiman uzorak. Ako pretpostavimo da se uzorak realizuje pre početka procesa optimizacije, možemo posmatrati uzoračko očekivanje kao determinističku funkciju. Medjutim, primena nekog od determinističkih metoda direktno na tu funkciju&nbsp; moze biti veoma skupa jer evaluacija funkcije pod ocekivanjem često predstavlja veliki tro&scaron;ak i uobičajeno je da se ukupan tro&scaron;ak optimizacije meri po broju izračcunavanja funkcije pod očekivanjem. Zbog toga su razvijeni metodi sa promenljivom veličinom uzorka. Većcina njih je bazirana na odredjivanju optimalne dinamike uvećanja uzorka.</p><p>Glavni cilj ove teze je razvoj algoritma koji, kroz smanjenje broja izračcunavanja funkcije, smanjuje ukupne tro&scaron;skove optimizacije. Ideja je da se veličina uzorka smanji kad god je to moguće. Grubo rečeno, izbegava se koriscenje velike preciznosti&nbsp; (velikog uzorka) kada smo daleko od re&scaron;senja. U čcetvrtom poglavlju ove teze opisana je nova klasa metoda i predstavljena je analiza konvergencije. Dokazano je da je aproksimacija re&scaron;enja koju dobijamo bar toliko dobra koliko i za metod koji radi sa celim uzorkom sve vreme.</p><p>Jo&scaron; jedna bitna karakteristika metoda koji su ovde razmatrani je primena linijskog pretražzivanja u cilju odredjivanja naredne iteracije. Osnovna ideja je da se nadje odgovarajući pravac i da se duž njega vr&scaron;si pretraga za dužzinom koraka koja će dovoljno smanjiti vrednost funkcije. Dovoljno smanjenje je odredjeno pravilom linijskog pretraživanja. U čcetvrtom poglavlju to pravilo je monotono &scaron;to znači da zahtevamo striktno smanjenje vrednosti funkcije. U cilju jos većeg smanjenja tro&scaron;kova optimizacije kao i pro&scaron;irenja skupa pogodnih pravaca, u petom poglavlju koristimo nemonotona pravila linijskog pretraživanja koja su modifikovana zbog promenljive velicine uzorka. Takodje, razmatrani su uslovi za globalnu konvergenciju i R-linearnu brzinu konvergencije.</p><p>Numerički rezultati su predstavljeni u &scaron;estom poglavlju. Test problemi su razliciti - neki od njih su akademski, a neki su realni. Akademski problemi su tu da nam daju bolji uvid u pona&scaron;anje algoritama. Sa druge strane, podaci koji poticu od stvarnih problema služe kao pravi test za primenljivost pomenutih algoritama. U prvom delu tog poglavlja akcenat je na načinu ažuriranja veličine uzorka. Različite varijante metoda koji su ovde predloženi porede se medjusobno kao i sa drugim &scaron;emama za ažuriranje veličine uzorka. Drugi deo poglavlja pretežno je posvećen poredjenju različitih pravila linijskog pretraživanja sa različitim pravcima pretraživanja u okviru promenljive veličine uzorka. Uzimajuci sve postignute rezultate u obzir dolazi se do zaključcka da variranje veličine uzorka može značajno popraviti učinak algoritma, posebno ako se koriste nemonotone metode linijskog pretraživanja.</p><p>U prvom poglavlju ove teze opisana je motivacija kao i osnovni pojmovi potrebni za praćenje preostalih poglavlja. U drugom poglavlju je iznet pregled osnova nelinearne optimizacije sa akcentom na metode linijskog pretraživanja, dok su u trećem poglavlju predstavljene osnove stohastičke optimizacije. Pomenuta poglavlja su tu radi pregleda dosada&scaron;njih relevantnih rezultata dok je originalni doprinos ove teze predstavljen u poglavljima 4-6.</p>

Submitted by JÉSSICA ANTONIO DELGADO null (jessica_dellgado@hotmail.com) on 2016-08-05T13:36:45Z No. of bitstreams: 1 DISSERTACAO_FINAL0308.pdf: 4117025 bytes, checksum: 0bc23567e553d5dba25e546bbeba3e55 (MD5) / Rejected by Ana Paula Grisoto (grisotoana@reitoria.unesp.br), reason: Solicitamos que realize uma nova submissão seguindo as orientações abaixo: A data de defesa informada na capa e folha de rosto do trabalho está diferente da data que consta na folha de aprovação. Corrija estas informações e realize uma nova submissão contendo o arquivo correto. Agradecemos a compreensão. on 2016-08-09T17:15:33Z (GMT) / Submitted by JÉSSICA ANTONIO DELGADO null (jessica_dellgado@hotmail.com) on 2016-08-09T20:16:39Z No. of bitstreams: 1 DISSERTACAO_FINAL0908.pdf: 4117292 bytes, checksum: 2fa555b044c52407e59e19d3d51f664d (MD5) / Approved for entry into archive by Ana Paula Grisoto (grisotoana@reitoria.unesp.br) on 2016-08-10T14:41:21Z (GMT) No. of bitstreams: 1 delgado_ja_me_bauru.pdf: 4117292 bytes, checksum: 2fa555b044c52407e59e19d3d51f664d (MD5) / Made available in DSpace on 2016-08-10T14:41:21Z (GMT). No. of bitstreams: 1 delgado_ja_me_bauru.pdf: 4117292 bytes, checksum: 2fa555b044c52407e59e19d3d51f664d (MD5) Previous issue date: 2016-06-10 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Este trabalho propõe uma abordagem que utiliza uma combinação de métodos baseados na função barreira logarítmica e barreira logarítmica modificada para a resolução do problema de Fluxo de Potência Ótimo Reativo. Na abordagem proposta as restrições de desigualdade são transformadas em igualdade introduzindo as variáveis de folga, as quais são tratadas pela função barreira logarítmica ou pela função barreira logarítmica modificada e as restrições de igualdade são tratadas pelos multiplicadores de Lagrange. Estes métodos são utilizados em duas etapas. Inicialmente aplica-se o método baseado na função barreira logarítmica até que um critério de transição seja satisfeita. Depois aplica-se o método baseado na função barreira logarítmica modificada até que a condição de convergência seja satisfeita. Testes numéricos utilizando os sistemas elétricos de 3 barras e IEEE 14, 30, 57 e 118 barras indicam que o método é eficiente na resolução do problema Fluxo de Potência Ótimo Reativo. Uma comparação dos resultados obtidos pela abordagem proposta com os dos métodos de barreira logarítmica e de barreira logarítmica modificada separadamente é realizada. / This work proposes an approach that uses a combination of methods based on loga-rithmic barrier function and modi˝ed logarithmic barrier function for the resolution of the reactive optimal power ˛ow problem. In this proposed approach the inequality cons-traints are transformed into equalities by adding the slack variables, which are handled by logarithmic barrier function or modified logarithmic barrier function, and the equality constraints are handled by means of Lagrange multipliers. These methods are used in two steps. Initially, the method based on the logarithmic barrier function is applied until the stop condition is satisfied. After the method based on modified logarithmic barrier function is used until the convergence condition is satisfied. Numerical tests carried out with the 3 bus, IEEE 14, 30, 57 and 118 bus electrical systems indicate that the proposed approach is efficient in the resolution of the reactive optimal power flow problem. The results obtained by the proposed approach were compared with the logarithmic barrier method and the logarithmic barrier method modified, separately.