Ink-Jet Printing of Color Optical Filters for LCD Applications

At the age of multi-media, portable electronic devices such as mobile phones, personal digital assistant and handheld gaming systems have increased the demand for high performance displays with low cost production. Inkjet printing color optical filters (COF) for LCD applications seem to be an interesting alternative to decrease the production costs. The advantage of inkjet printing technology is to be fast, accurate, easy to run and cheaper than other technologies. In this master thesis work, we used various disciplines such as optical microscopy, rheology, inkjet printing, profilometering and colorimetry. The specific aim of the thesis was to investigate the feasibility of using company-A pigment formulation in inkjet production of COF for active matrix LCD applications. Ideal viscosity parameters were determined from 10 to 20mPa·s for easy inkjet printing at room temperature. The red pigments used are fully dispersed into the solvent and present an excellent homogenous repartition after printing. Thickness investigations revealed that the printed COF were equal or slightly thicker than typically manufactured ones. The colorimetry investigations demonstrated color coordinates very close to the NTSC red standard. LED backlighting seems to be a valuable solution to combine with the printed COF regarding to the spectrum and color analysis. The results on this thesis will increase the understanding of inkjet printing company-A pigments to produce COF for LCD applications.

Load balancing solution and evaluation of F5 content switch equipment

The Thesis focused on hardware based Load balancing solution of web traffic through a load balancer F5 content switch. In this project, the implemented scenario for distributing HTTPtraffic load is based on different CPU usages (processing speed) of multiple member servers.Two widely used load balancing algorithms Round Robin (RR) and Ratio model (weighted Round Robin) are implemented through F5 load balancer. For evaluating the performance of F5 content switch, some experimental tests has been taken on implemented scenarios using RR and Ratio model load balancing algorithms. The performance is examined in terms of throughput (bits/sec) and Response time of member servers in a load balancing pool. From these experiments we have observed that Ratio Model load balancing algorithm is most suitable in the environment of load balancing servers with different CPU usages as it allows assigning the weight according to CPU usage both in static and dynamic load balancing of servers.

A stopping rule while searching for optimal solution of facility-location

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small branch of the literature suggests using statistical principles to estimate the minimum and use the estimate for either stopping or evaluating the quality of the solution. In this paper we use test-problems taken from Baesley's OR-library and apply Simulated Annealing on these p-median problems. We do this for the purpose of comparing suggested methods of minimum estimation and, eventually, provide a recommendation for practioners. An illustration ends the paper being a problem of locating some 70 distribution centers of the Swedish Post in a region.

Network density and the p-median solution

The p-medianmodel is commonly used to find optimal locations of facilities for geographically distributed demands. So far, there are few studies that have considered the importance of the road network in the model. However, Han, Håkansson, and Rebreyend (2013) examined the solutions of the p-median model with densities of the road network varying from 500 to 70,000 nodes. They found as the density went beyond some 10,000 nodes, solutions have no further improvements but gradually worsen. The aim of this study is to check their findings by using an alternative heuristic being vertex substitution, as a complement to their using simulated annealing. We reject the findings in Han et al (2013). The solutions do not further improve as the nodes exceed 10,000, but neither do the solutions deteriorate.