Methods for Hypothesis Testing in Animal Carcinogenicity Experiments

Thesis (Ph.D.)--University of Washington, 2016-08

Search Based Clustering for Protecting Software with Diversified Updates

Reverse engineering is usually the stepping stone of a variety of at-tacks aiming at identifying sensitive information (keys, credentials, data, algo-rithms) or vulnerabilities and flaws for broader exploitation. Software applica-tions are usually deployed as identical binary code installed on millions of com-puters, enabling an adversary to develop a generic reverse-engineering strategy that, if working on one code instance, could be applied to crack all the other in-stances. A solution to mitigate this problem is represented by Software Diversity, which aims at creating several structurally different (but functionally equivalent) binary code versions out of the same source code, so that even if a successful attack can be elaborated for one version, it should not work on a diversified ver-sion. In this paper, we address the problem of maximizing software diversity from a search-based optimization point of view. The program to protect is subject to a catalogue of transformations to generate many candidate versions. The problem of selecting the subset of most diversified versions to be deployed is formulated as an optimisation problem, that we tackle with different search heuristics. We show the applicability of this approach on some popular Android apps.

Trazer a biblioteca no bolso: os serviços para dispositivos móveis nas bibliotecas académicas

Introdução – Os serviços de comunicação móvel para tablets, smartphones, e-book readers desenvolveram-se de forma extremamente rápida nos últimos anos assumindo-se como uma rede de aprendizagem privilegiada para os estudantes. Em 2012, 55% dos estudantes do ensino superior possuíam um smarthphone, 62% dispunham de um ipod e 21% tinham de um tablet. 67% usavam-nos em contexto académico. Objetivo – Apresentar de forma sucinta a resposta das bibliotecas de ensino superior ao crescimento da utilização dos dispositivos móveis e como é que os parceiros das bibliotecas, em especial os editores, estão a potenciar essa utilização. Métodos – A partir de uma seleção e análise de bibliografia sobre a temática realizou-se uma pesquisa na internet, nos sites de bibliotecas de ensino superior e nas páginas dos editores que permitisse aferir evidências. Resultados – Identificaram-se cinco serviços e 23 recursos. Discussão – Um primeiro serviço prende-se com a adaptação dos conteúdos dos websites das bibliotecas de forma a serem lidos por qualquer tipo de dispositivos. Outro serviço identificado foi a disponibilização do catálogo da biblioteca online tornando-o acessível aos dispositivos móveis, permitindo a pesquisa e a localização de informação, a reserva ou a renovação de documentos. Identificou-se o desenvolvimento de algumas coleções especificamente para os dispositivos móveis. Constatou-se a utilização de códigos QR para divulgar normas de funcionamento da biblioteca, recursos, o mapa, o contacto do serviço de referência e para geolocalização. Por fim verificou-se a utilização de SMS para informar os utilizadores sobre reservas, prazos de empréstimo, entre outras informações. O recurso mais comum na maioria dos sites analisados foi a disponibilização de uma versão do website para dispositivos móveis de que são exemplos a Cambridge Journals Online mobile, o EBSCOhost mobile, o SpringerLink, a OVIDToday, o UpToDate, a PubChase e a BrowZine. Com o objetivo de tornar os seus produtos acessíveis on-the go, oferecem inúmeras possibilidades, nomeadamente de pesquisa, de acesso a textos integrais, de elaboração de listas de interesse personalizadas, de leitura offline, entre outras que podemos encontrar na aplicação da EBSCOhost mobile, na JAMA Network, na OVIDToday, no portal de Periódicos CAPES ou na plataforma Ebrary da ProQuest. Em ferramentas como a UpToDate ou os aplicativos da Elsevier e da Micromedex é disponibilizada informação baseada na evidência e recomendações que podem ser aplicadas em consulta. Os gestores de referências bibliográficas como o Mendeley e o Zotero também acompanharam esta tendência e desenvolveram aplicações para dispositivos móveis. Para além disso funcionam de forma integrada com outras aplicações como a Browzine e a Pubchase. Conclusão – O recurso às tecnologias móveis é uma forma das bibliotecas manterem canais de comunicação com os utilizadores, mas embora existam muitas vantagens no uso das tecnologias móveis a implementação destes serviços implica um esforço financeiro e humano que nem todas as bibliotecas serão capazes de cumprir. Encontrar a forma de gerir este processo é o desafio que se impõe no futuro.

Opportunities and challenges of content marketing as a way of digital marketing communications

Tämän tutkimuksen tavoitteena on tunnistaa sisältömarkkinoinnin mahdollisuuksia ja haasteita digitaalisessa markkinointiviestinnässä. Lisäksi tavoitteena on antaa yksiselitteinen määritelmä sisältömarkkinoinnille sekä selvittää, miten se eroaa muista markkinointiviestinnän keinoista. Sisältömarkkinointi on strateginen markkinointiviestinnän keino, johon kuuluu asiakkaan kannalta mielenkiintoisen ja hyödyllisen sisällön tuottaminen ja jakaminen. Sisältömarkkinointi tarjoaa keinon muodostaa brändimielikuvia luonnollisin keinoin ilman mainoksen leimaa, jota osa kuluttajista välttelee tietoisesti jopa mainosten esto-ohjelmien avulla. Perinteiset markkinointiviestinnän keinot pyrkivät usein lyhyen aikavälin myyntituloksiin, kun taas sisältömarkkinointi pyrkii maksimoimaan asiakkaan koko elinkaaren arvon. Onnistunut sisältömarkkinointi vaatii yrityksiltä kärsivällisyyttä sekä asiakkaiden kokonaisvaltaista tuntemista.

A Research of Resource Scheduling Algorithm Based on Hadoop

With the development of electronic devices, more and more mobile clients are connected to the Internet and they generate massive data every day. We live in an age of “Big Data”, and every day we generate hundreds of million magnitude data. By analyzing the data and making prediction, we can carry out better development plan. Unfortunately, traditional computation framework cannot meet the demand, so the Hadoop would be put forward. First the paper introduces the background and development status of Hadoop, compares the MapReduce in Hadoop 1.0 and YARN in Hadoop 2.0, and analyzes the advantages and disadvantages of them. Because the resource management module is the core role of YARN, so next the paper would research about the resource allocation module including the resource management, resource allocation algorithm, resource preemption model and the whole resource scheduling process from applying resource to finishing allocation. Also it would introduce the FIFO Scheduler, Capacity Scheduler, and Fair Scheduler and compare them. The main work has been done in this paper is researching and analyzing the Dominant Resource Fair algorithm of YARN, putting forward a maximum resource utilization algorithm based on Dominant Resource Fair algorithm. The paper also provides a suggestion to improve the unreasonable facts in resource preemption model. Emphasizing “fairness” during resource allocation is the core concept of Dominant Resource Fair algorithm of YARM. Because the cluster is multiple users and multiple resources, so the user’s resource request is multiple too. The DRF algorithm would divide the user’s resources into dominant resource and normal resource. For a user, the dominant resource is the one whose share is highest among all the request resources, others are normal resource. The DRF algorithm requires the dominant resource share of each user being equal. But for these cases where different users’ dominant resource amount differs greatly, emphasizing “fairness” is not suitable and can’t promote the resource utilization of the cluster. By analyzing these cases, this thesis puts forward a new allocation algorithm based on DRF. The new algorithm takes the “fairness” into consideration but not the main principle. Maximizing the resource utilization is the main principle and goal of the new algorithm. According to comparing the result of the DRF and new algorithm based on DRF, we found that the new algorithm has more high resource utilization than DRF. The last part of the thesis is to install the environment of YARN and use the Scheduler Load Simulator (SLS) to simulate the cluster environment.

Development of the edible blend films with good mechanical and barrier properties from pea starch and guar gum

The individual and interactive impacts of guar gum and glycerol on the pea starch-based edible film characteristics were examined using three factors with three level Box–Behnken response surface design. The results showed that density and elongation at break were only significantly (p < 0.05) affected by pea starch and guar gum in a positive linear fashion. The quadratic regression coefficient of pea starch showed a significant effect (p < 0.05) on thickness, density, puncture force, water vapour permeability, and tensile strength. While tensile strength and Young modulus affected by the quadratic regression coefficient of glycerol and guar gum, respectively. The results were analysed using Pareto analysis of variance (ANOVA) and the developed predictive equations for each response variable presented reliable and satisfactory fit with high coefficient of determination (R2) values (≥ 0.96). The optimized conditions with the goal of maximizing mechanical properties and minimizing water vapour permeability were 2.5 g pea starch, 0.3 g guar gum and 25 % (w/w) glycerol based on the dry film matter in 100 ml of distilled water. Generally, changes in the concentrations of pea starch, guar gum and glycerol resulted in changes in the functional properties of film.

Desenvolvimento de um sistema para planeamento e controlo da produção

Atualmente o sector industrial está inserido num mercado cada vez mais competitivo, onde é exigida uma estratégia empresarial que possa garantir a sua permanência e destaque no atual mercado. Por esta razão, um planeamento e controlo da produção adequado torna-se essencial para o bom funcionamento de uma empresa. Através destes sistemas é possível atuar de forma positiva na produção, rentabilizando-se o sector produtivo da empresa que contribui para o aumento da qualidade de serviço e também para o crescimento económico da empresa. Com um planeamento da produção adequado, uma organização dispondo das mesmas capacidades, é capaz de produzir quantidades iguais num menor intervalo de tempo. Por outro lado, um controlo da produção preciso é imprescindível para o fornecimento da informação correta quando necessária. No sentido de otimização, uma empresa apresentou algumas sugestões de melhoria a nível do planeamento e controlo da produção. Este trabalho surge assim com o intuito de dar resposta às propostas apresentadas. Para tal, no desenvolvimento desta dissertação, criou-se uma ferramenta dotada de dois algoritmos e um sistema de controlo para aquisição de informação de forma automatizada. Em suma, o sistema proposto apresenta a capacidade de construção de boas soluções para o planeamento, conciliada com um sistema de aquisição de dados bastante prático e e caz. Mantendo sempre a exibilidade necessária para um sistema deste género.

Dynamic Resource Allocation in Wireless Heterogeneous Networks

Deployment of low power basestations within cellular networks can potentially increase both capacity and coverage. However, such deployments require efficient resource allocation schemes for managing interference from the low power and macro basestations that are located within each other’s transmission range. In this dissertation, we propose novel and efficient dynamic resource allocation algorithms in the frequency, time and space domains. We show that the proposed algorithms perform better than the current state-of-art resource management algorithms. In the first part of the dissertation, we propose an interference management solution in the frequency domain. We introduce a distributed frequency allocation scheme that shares frequencies between macro and low power pico basestations, and guarantees a minimum average throughput to users. The scheme seeks to minimize the total number of frequencies needed to honor the minimum throughput requirements. We evaluate our scheme using detailed simulations and show that it performs on par with the centralized optimum allocation. Moreover, our proposed scheme outperforms a static frequency reuse scheme and the centralized optimal partitioning between the macro and picos. In the second part of the dissertation, we propose a time domain solution to the interference problem. We consider the problem of maximizing the alpha-fairness utility over heterogeneous wireless networks (HetNets) by jointly optimizing user association, wherein each user is associated to any one transmission point (TP) in the network, and activation fractions of all TPs. Activation fraction of a TP is the fraction of the frame duration for which it is active, and together these fractions influence the interference seen in the network. To address this joint optimization problem which we show is NP-hard, we propose an alternating optimization based approach wherein the activation fractions and the user association are optimized in an alternating manner. The subproblem of determining the optimal activation fractions is solved using a provably convergent auxiliary function method. On the other hand, the subproblem of determining the user association is solved via a simple combinatorial algorithm. Meaningful performance guarantees are derived in either case. Simulation results over a practical HetNet topology reveal the superior performance of the proposed algorithms and underscore the significant benefits of the joint optimization. In the final part of the dissertation, we propose a space domain solution to the interference problem. We consider the problem of maximizing system utility by optimizing over the set of user and TP pairs in each subframe, where each user can be served by multiple TPs. To address this optimization problem which is NP-hard, we propose a solution scheme based on difference of submodular function optimization approach. We evaluate our scheme using detailed simulations and show that it performs on par with a much more computationally demanding difference of convex function optimization scheme. Moreover, the proposed scheme performs within a reasonable percentage of the optimal solution. We further demonstrate the advantage of the proposed scheme by studying its performance with variation in different network topology parameters.

Uma abordagem evolucionária e espacial para o jogo da autorregulação de processos de trocas sociais em sistemas multiagentes

Interações sociais são frequentemente descritas como trocas sociais. Na literatura, trocas sociais em Sistemas Multiagentes são objeto de estudo em diversos contextos, nos quais as relações sociais são interpretadas como trocas sociais. Dentre os problemas estudados, um problema fundamental discutido na literatura e a regulação¸ ao de trocas sociais, por exemplo, a emergência de trocas equilibradas ao longo do tempo levando ao equilíbrio social e/ou comportamento de equilíbrio/justiça. Em particular, o problema da regulação de trocas sociais e difícil quando os agentes tem informação incompleta sobre as estratégias de troca dos outros agentes, especificamente se os agentes tem diferentes estratégias de troca. Esta dissertação de mestrado propõe uma abordagem para a autorregulacao de trocas sociais em sistemas multiagentes, baseada na Teoria dos Jogos. Propõe o modelo de Jogo de Autorregulacão ao de Processos de Trocas Sociais (JAPTS), em uma versão evolutiva e espacial, onde os agentes organizados em uma rede complexa, podem evoluir suas diferentes estratégias de troca social. As estratégias de troca são definidas através dos parâmetros de uma função de fitness. Analisa-se a possibilidade do surgimento do comportamento de equilíbrio quando os agentes, tentando maximizar sua adaptação através da função de fitness, procuram aumentar o numero de interações bem sucedidas. Considera-se um jogo de informação incompleta, uma vez que os agentes não tem informações sobre as estratégias de outros agentes. Para o processo de aprendizado de estratégias, utiliza-se um algoritmo evolutivo, no qual os agentes visando maximizar a sua função de fitness, atuam como autorregulares dos processos de trocas possibilitadas pelo jogo, contribuindo para o aumento do numero de interações bem sucedidas. São analisados 5 diferentes casos de composição da sociedade. Para alguns casos, analisa-se também um segundo tipo de cenário, onde a topologia de rede é modificada, representando algum tipo de mobilidade, a fim de analisar se os resultados são dependentes da vizinhança. Alem disso, um terceiro cenário é estudado, no qual é se determinada uma política de influencia, quando as medias dos parâmetros que definem as estratégias adotadas pelos agentes tornam-se publicas em alguns momentos da simulação, e os agentes que adotam a mesma estratégia de troca, influenciados por isso, imitam esses valores. O modelo foi implementado em NetLogo.

Food and fuel microalgae applications: insights from portuguese experience [Resumo]

Microalgae have a wide range of application fields, from food to fuels, to pharmaceuticals & fine chemicals, aquaculture and environmental bioremediation, among others. Spirulina and Chlorella have been used as food sources since ancient times, due to their high and balanced nutritional value. Our research group in Lisbon has developed a range of food products (emulsions, gelled desserts, biscuits and pastas) enriched with freshwater and marine microalgae (Spirulina, Chlorella, Haematococcus, Isochrysis and Diacronema). The developed products presented attractive and stable colours, high resistance to oxidation and enhanced rheological properties. Some of these products will be prepared at the Post-Congress Course “Functional Foods Development” at the University of Antofagasta. More recently, a great interest has arisen on using microalgae for biofuel production. The same group has also been exploring several marine and freshwater species for biofuel production (e.g., biodiesel, bioethanol, biohydrogen and biomethane) within a biorefinery approach, in order to obtain high and low-value co-products using integral biomass maximizing the energy revenue. Namely, supercritical fluid extraction of Nannochloropsis sp. allowed the recovery of valuable carotenoids and lipids, prior to bioH2 production through dark fermentation of the residual biomass. Also, Scenedesmus obliquus residues after sugars (for bioethanol) and lipids (for biodiesel) extraction has been anaerobically digested attaining high biomethane yields. Regarding sustainability issues, the current trend of our group is now focused on using liquid effluents and high CO2 levels for low cost microalgae growth, contributing to a lower water demand, primary energy consumption and global warming potential by reducing the need for potable water and fertilizers (P, N) and increasing CO2 mitigation. Microalgae biomass has been successfully used for urban wastewater treatment with subsequent bioH2 production, in a biorefinery approach. Presently, ammonium-rich raw effluents from piggeries and poultry industry are being effectively used for microalgae growth avoiding any pre-treatment step.

Leveraging Multiple Features for Image Retrieval and Matching

The goal of image retrieval and matching is to find and locate object instances in images from a large-scale image database. While visual features are abundant, how to combine them to improve performance by individual features remains a challenging task. In this work, we focus on leveraging multiple features for accurate and efficient image retrieval and matching. We first propose two graph-based approaches to rerank initially retrieved images for generic image retrieval. In the graph, vertices are images while edges are similarities between image pairs. Our first approach employs a mixture Markov model based on a random walk model on multiple graphs to fuse graphs. We introduce a probabilistic model to compute the importance of each feature for graph fusion under a naive Bayesian formulation, which requires statistics of similarities from a manually labeled dataset containing irrelevant images. To reduce human labeling, we further propose a fully unsupervised reranking algorithm based on a submodular objective function that can be efficiently optimized by greedy algorithm. By maximizing an information gain term over the graph, our submodular function favors a subset of database images that are similar to query images and resemble each other. The function also exploits the rank relationships of images from multiple ranked lists obtained by different features. We then study a more well-defined application, person re-identification, where the database contains labeled images of human bodies captured by multiple cameras. Re-identifications from multiple cameras are regarded as related tasks to exploit shared information. We apply a novel multi-task learning algorithm using both low level features and attributes. A low rank attribute embedding is joint learned within the multi-task learning formulation to embed original binary attributes to a continuous attribute space, where incorrect and incomplete attributes are rectified and recovered. To locate objects in images, we design an object detector based on object proposals and deep convolutional neural networks (CNN) in view of the emergence of deep networks. We improve a Fast RCNN framework and investigate two new strategies to detect objects accurately and efficiently: scale-dependent pooling (SDP) and cascaded rejection classifiers (CRC). The SDP improves detection accuracy by exploiting appropriate convolutional features depending on the scale of input object proposals. The CRC effectively utilizes convolutional features and greatly eliminates negative proposals in a cascaded manner, while maintaining a high recall for true objects. The two strategies together improve the detection accuracy and reduce the computational cost.

Socioeconomics of fishing communities on Uganda water bodies

Control and management of Uganda fishery resources has been hindered by among other factors the multispecies nature of the resource and the characteristic behaviour of the fishing communities. Fishermen have both genuine and uncompromising attitudes as to why they carry out certain fishing technologies. All fishing activities aim at maximizing the catches or profits while others may fish on a small scale for subsistence. Sensitizing the" fisherfolk on the appropriate fishing technologies, importance of awell regulated fishery exploitation and their participation in control and management of the resource would enhance or lead to increased and sustainable fish production. Socio-economics of fishing technologies were therefore examined using prepared questionnaires and reasons why the fishing communities behave the way they do established.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Socio economics of fishing communities on Uganda water bodies

Control and management of Uganda fishery resources has been hindered by among other factors the multispecies nature of the resource and the characteristic behaviour of the fishing communities. Fishermen have both genuine and uncompromising attitudes as to why they carry out certain fishing technologies. All fishing activities aim at maximizing the catches or profits while others may fish on a small scale for subsistence. Sensitizing the" fisherfolk on the appropriate fishing technologies. importance of awell regulated fishery exploitation and their participation in control and management of the resource would enhance or lead to increased and sustainable fish production. Socio-economics of fishing technologies were therefore examined using prepared questionnaires and reasons why the fishing communities behave the way they do established.

Plasma diagnostics and ITO film deposition by RF-assisted closed-field dual magnetron system

Deposition of indium tin oxide (ITO) among various transparent conductive materials on flexible organic substrates has been intensively investigated among academics and industrials for a whole new array of imaginative optoelectronic products. One critical challenge coming with the organic materials is their poor thermal endurances, considering that the process currently used to produce industry-standard ITO usually involves relatively high substrate temperature in excess of 200°C and post-annealing. A lower processing temperature is thus demanded, among other desires of high deposition rate, large substrate area, good uniformity, and high quality of the deposited materials. For this purpose, we developed an RF-assisted closed-field dual magnetron sputtering system. The “prototype” system consists of a 3-inch unbalanced dual magnetron operated at a closed-field configuration. An RF coil was fabricated and placed between the two magnetron cathodes to initiate a secondary plasma. The concept is to increase the ionization faction with the RF enhancement and utilize the ion energy instead of thermal energy to facilitate the ITO film growth. The closed-field unbalanced magnetrons create a plasma in the intervening region rather than confine it near the target, thus achieving a large-area processing capability. An RF-compensated Langmuir probe was used to characterize and compare the plasmas in mirrored balanced and closed-field unbalanced magnetron configurations. The spatial distributions of the electron density ne and electron temperature Te were measured. The density profiles reflect the shapes of the plasma. Rather than intensively concentrated to the targets/cathodes in the balanced magnetrons, the plasma is more dispersive in the closed-field mode with a twice higher electron density in the substrate region. The RF assistance significantly enhances ne by one or two orders of magnitude higher. The effect of various other parameters, such as pressure, on the plasma was also studied. The ionization fractions of the sputtered atoms were measured using a gridded energy analyzer (GEA) combined with a quartz crystal microbalance (QCM). The presence of the RF plasma effectively increases the ITO ionization fraction to around 80% in both the balanced and closed-field unbalanced configurations. The ionization fraction also varies with pressure, maximizing at 5-10 mTorr. The study of the ionization not only facilitates understanding the plasma behaviors in the RF-assisted magnetron sputtering, but also provides a criterion for optimizing the film deposition process. ITO films were deposited on both glass and plastic (PET) substrates in the 3-inch RF-assisted closed-field magnetrons. The electrical resistivity and optical transmission transparency of the ITO films were measured. Appropriate RF assistance was shown to dramatically reduce the electrical resistivity. An ITO film with a resistivity of 1.2×10-3 Ω-cm and a visible light transmittance of 91% was obtained with a 225 W RF enhancement, while the substrate temperature was monitored as below 110°C. X-ray photoelectron spectroscopy (XPS) was employed to confirm the ITO film stoichiometry. The surface morphology of the ITO films and its effect on the film properties were studied using atomic force microscopy (AFM). The prototype of RF-assisted closed-field magnetron was further extended to a larger rectangular shaped dual magnetron in a flat panel display manufacturing system. Similar improvement of the ITO film conductivities by the auxiliary RF was observed on the large-area PET substrates. Meanwhile, significant deposition rates of 25-42 nm/min were achieved.