This document gives an overview of the proposed MSc study. The main goal of the study is to model the cases listed in the code benchmark study of the International Atomic Energy Agency CRP–6 fuel performance study (Verfondern & Lee, 2005). The platform that will be employed is the GETTER code (Keshaw & van der Merwe, 2006). GETTER was used at PBMR for the release calculations of metallic and some non–metallic long–lived fission products. GETTER calculates the transport of fission products from their point of fission to release from the fuel surface taking into account gas precursors and activation products. Results show that for certain experiments the codes correspond very well with the experimental data whilst in others there are orders of magnitude differences. It can be seen that very similar behaviour is observed in all codes. Improvements are needed in updating the strontium diffusion coefficient and in understanding, on a deeper level, the transport of silver in TRISO particles and how it deviates from simple diffusion models. / Thesis (M.Sc. Engineering Sciences (Nuclear Engineering))--North-West University, Potchefstroom Campus, 2012.

This document gives an overview of the proposed MSc study. The main goal of the study is to model the cases listed in the code benchmark study of the International Atomic Energy Agency CRP–6 fuel performance study (Verfondern & Lee, 2005). The platform that will be employed is the GETTER code (Keshaw & van der Merwe, 2006). GETTER was used at PBMR for the release calculations of metallic and some non–metallic long–lived fission products. GETTER calculates the transport of fission products from their point of fission to release from the fuel surface taking into account gas precursors and activation products. Results show that for certain experiments the codes correspond very well with the experimental data whilst in others there are orders of magnitude differences. It can be seen that very similar behaviour is observed in all codes. Improvements are needed in updating the strontium diffusion coefficient and in understanding, on a deeper level, the transport of silver in TRISO particles and how it deviates from simple diffusion models. / Thesis (M.Sc. Engineering Sciences (Nuclear Engineering))--North-West University, Potchefstroom Campus, 2012.

This thesis presents a whole-core benchmark of the European Pressurized Reactor (EPR) using multiple transport methods. The core specifications were taken directly from the Final Safety Analysis Report (FSAR) submitted to the Nuclear Regulatory Commission (NRC) and the reactor was modeled in a stylized manner while maintaining full heterogeneity at the pin and assembly level. The geometry and material specifications are given as well as problem-specific cross sections for 2, 4, and 8 energy group calculations. Cross sections were generated using HELIOS, a lattice depletion code based on the Collision Probability Method (CPM). The multi-group cross sections were utilized in the reference calculation, COMET calculation, and response function generation. The reference solution was obtained via an MCNP model identical to the one implemented in COMET. Specific steps towards constructing and running a COMET calculation are outlined. Detailed results including assembly eigenvalues, core eigenvalues, and pin fission densities are presented.

This thesis presents a method for enhancing performance of Storage Class Memory File System (SCMFS) and an implementation of SCMFS on Android platform. It focuses on analyzing performance influencing factors of memory file systems and the differences in implementation of SCMFS on Android and Linux kernels. SCMFS allocates memory pages as file blocks and employs virtual memory addresses as file block addresses. SCMFS utilizes processor's memory management unit and TLB (Translation Lookaside Buffer) during file accesses. TLB is an expensive resource and has a limited number of entries to cache virtual to physical address translations. TLB miss results in expensive page walks through memory page table. Thus TLB misses play an important role in determining SCMFS performance. In this thesis, SCMFS is designed to support both 4KB and 2MB page sizes in order to reduce TLB misses and to avoid significant internal fragmentation. By comparing SCMFS with YAFFS2 and EXT4 using popular benchmarks, both advantages and disadvantages of SCMFS huge-page version and small-page version are revealed. In the second part of this thesis, an implementation of SCMFS on Android platform is presented. At the time of working on this research project, Android kernel was not merged into Linux kernel yet. Two main changes of SCMFS kernel code: memory zoning and inode functions, are made to be compatible with Android kernel. AndroSH, a file system benchmark for SCMFS on Android, is developed based on shell script. Evaluations are made from three perspectives to compare SCMFS with YAFFS2 and EXT4: I/O throughput, user data access latency, and application execution latency. SCMFS shows a performance advantage because of its small instruction footprint and its pre-allocation mechanism. However, the singly linked list used by SCMFS to store subdirectories is less efficient than HTree index used by EXT4. The future work can improve lookup efficiency of SCMFS.

Typescript. / Thesis (Ph.D.)--University of Hawaii at Manoa, 1985. / Bibliography: leaves 180-187. / Photocopy. / xiv, 187 leaves, bound ill., maps 29 cm

Thesis (doctoral)--Techn. University, Darmstadt, 2005.

Techn. University, Diss., 2004--Berlin.

Aim: To investigate how the University of Gävle conducts relationship with graduate students and retains graduate students and creates loyalty. This study explores the importance of relationship marketing theories that intends to be applied in higher education through alumni programs and services. University of Gävle and Stockholm University will be compared in benchmarking to determine in what ways the alumni offices create relationships to retain and create loyalty to alumni students.  Method: A qualitative research was conducted on the University of Gävle and Stockholm University in Sweden for this study, which included interviews with the relation officers on this subject. Result & Conclusions: It was evident that the University of Gävle alumni actually exist as titles, and there is no certain relationship strategy, however, only they are NOT actively operational. The study identified that the University of Gävle was not using a certain strategy to create lasting relationship, loyalty and increase prospective students. The study revealed the importance of relationship marketing strategy to effectively administrate the progress in establishing relationship with the alumni, to increase the prospective international students, to keep a regular track and communications with alumni. Suggestions for future research: This study focused on two universities, further research could be conducted to examine the relationship marketing with alumni students and investigate students’ relationship with university in other countries and institutions.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-03-09T21:45:39Z No. of bitstreams: 1 ADRIANA BARBOSA DA COSTA - DISSERTAÇÃO PPGEQ 2016..pdf: 2381705 bytes, checksum: 9ae8c9d691a6fa4d5aa82e113e910d76 (MD5) / Made available in DSpace on 2018-03-09T21:45:39Z (GMT). No. of bitstreams: 1 ADRIANA BARBOSA DA COSTA - DISSERTAÇÃO PPGEQ 2016..pdf: 2381705 bytes, checksum: 9ae8c9d691a6fa4d5aa82e113e910d76 (MD5) Previous issue date: 2016-12-14 / Um constante estudo para o tratamento de águas residuais e descarte de efluentes é necessário a fim de lidar com normas cada vez mais rígidas nesse âmbito. As estações de tratamento de águas residuais podem ser consideradas sistemas altamente não-lineares, devido a existência de perturbações, bem como a interação de um número considerável de variáveis do processo. Neste contexto, o estudo, otimização e controle dessas plantas são essenciais para o bom funcionamento do processo em atenção às exigências. Vários métodos de otimização são propostos na literatura, e suas implementações em aplicações de engenharia podem ser significativamente melhoradas pelo uso de metamodelos representando o modelo rigoroso do processo a partir de dados computacionais. O presente trabalho trata do desenvolvimento de metamodelos, pela aplicação do modelo Kriging, para um processo de tratamento de águas residuais. Para tal, são realizadas as etapas de amostragem de pontos, por meio do Latin Hypercube Sampling, estimação dos parâmetros e validação. A metodologia proposta baseiase na geração de dados computacionais por meio do modelo rigoroso para o Benchmark Simulation Model N°2, implementado no Simulink®, e na otimização do processo utilizando os metamodelos Kriging. Estes modelos obtidos através de dados de processo rigoroso mostram uma alta precisão e minimização do esforço computacional para o processo de otimização. A Programação Quadrática Seqüencial e o Algoritmo Genético são utilizados para a tarefa de otimização, bem como a geração do modelo de Otimização em Tempo Real. Os resultados obtidos no modelo de referência demonstram a potencialidade da metodologia proposta para minimizar o custo do processo enquanto obedecem as restrições do efluente para as águas residuais tratadas. / A continuous study for improving the treatment of wastewater and the effluent disposal is necessary in order to deal with increasingly stringent environmental laws in this field. Wastewater treatment plants can be considered as highly non-linear systems, due to the existing disturbances as well as the interaction of a considerable number of process variables. In such a context, the study, optimization and control of these plants are essential for the proper operation of the process with respect to requirements. Several optimization methods are proposed in the literature and, their implementation for engineering applications can be significantly improved by the use of metamodels representing the rigorous model of the process starting from computational data. The present work deals with the development of metamodels, such as the Kriging model, a wastewater treatment process. To this end, the steps of data sampling, through Latin Hypercube Sampling, parameter estimation and validation are performed. The proposed methodology is based on the generation of computational data through the rigorous model of the Benchmark Simulation Model No. 2, implemented in Simulink®, and the optimization of the process using of the Kriging metamodels. These models obtained through the rigorous process data show a high accuracy and the computational effort of the optimization methods. The Sequential Quadratic Programming and Genetic Algorithm are used for the optimization task, as well as the generation of the Real Time Optimization model. The achieved results on benchmark model demonstrate the potentiality of the proposed methodology, to minimize the process cost while obeying the effluent restrictions of the treated wastewater.

Esta dissertação de mestrado introduz um conjunto de algoritmos baseados em grafos para a obtenção de circuitos VLSI com um número reduzido de transistores utilziando células simples. Esses algoritmos têm um foco principal na minimização do número de nodos em representações AIG e mapear essa estrutura otimizada utilizando células simples (NAND2 e NOR2) com um número mínimo de inversores. Devido à minimização de nodos, o AIG tem um alto compartilhamento lógico, o que pode derivar circuitos intermediários contendo células com fanouts infactíveis para os nodos tecnológicos atuais. De forma a resolver essas ocorrências, o circuito intermediário é submetido a um algoritmo para limitação de fanout. Os algoritmos propostos foram aplicados num conjunto de circuitos de benchmark e os resultados obtidos mostram a utilidade do método. Os circuitos resultantes tiveram, em média, 32% menos transistores do que as referências anteriores em números de transistores utilizando células simples. Adicionalmente, quando comparando esses resultados com trabalhos que utilizam células complexas, nossos números demonstraram que abordagens anteriores estão algumas vezes longe do número mínimo de transistores que pode ser obtido com o uso eficiente de uma biblioteca reduzida de células, composta por poucas células simples. Os circuitos baseados em células simples obtidos com a aplicação dos algoritmos proposto neste trabalho apresentam um menor número de transistores em muitos casos quando comparados aos resultados previamente publicados utilizando células complexas (CMOS estático e PTL). / This master’s thesis introduces a set of graph-based algorithms for obtaining reduced transistor count VLSI circuits using simple cells. These algorithms are mainly focused on minimizing node count in AIG representations and mapping this optimized AIG using simple cells (NAND2 and NOR2) with a minimal number of inverters. Due to the AIG node count minimization, the logic sharing is probably highly present in the optimized AIG, what may derive intermediate circuits containing cells with unfeasible fanout in current technology nodes. In order to fix these occurrences, this intermediate circuit is subjected to an algorithm for fanout limitation. The proposed algorithms were applied over a set of benchmark circuits and the obtained results have shown the usefulness of the method. The circuits generated by the methods proposed herein have, in average, 32% less transistor than the previous reference on transistor count using simple cells. Additionally, when comparing the presented results in terms of transistor count against works advocating for complex cells, our results have demonstrated that previous approaches are sometimes far from the minimum transistor count that can be obtained with the efficient use of a reduced cell library composed by only a few number of simple cells. The simple-cells-based circuits obtained after applying the algorithms proposed herein have presented a lower transistor count in many cases when compared to previously published results using complex (static CMOS and PTL) cells.