Esta pesquisa teórica investiga a controvérsia acadêmica sobre avaliações em larga escala no Brasil, sistematizando as posições/argumentos desse debate na forma de um continuum argumentativo, além de delinear tensões discursivas e contextuais que circundam e perpassam a polêmica sobre a avaliação da escola básica. A revisão de literatura pertinente e a apreciação dos discursos acadêmicos gravitantes da temática, do ponto de vista teórico-metodológico, orientaram-se pela noção de polifonia (BAKHTIN, 2005; MAINGUENEAU, 2002; CHARAUDEAU; MAINGUENEAU, 2016). Ou seja, pelo esforço de abordar, de forma simultânea e equipolente, as várias vozes que se pronunciam diversamente sobre o tema das avaliações em larga escala no Brasil. Desse modo, a incursão teórica segue por três eixos de sistematização/interpretação: 1) a reconstituição da trama histórica do desenvolvimento do aparelho de avaliação externa no Brasil, por meio de uma periodização interpretativa que põe em relevo as tensões e disputas centrais que incidiram nas discussões entre acadêmicos e especialistas da avaliação; 2) o mapeamento dos conceitos abrangentes (categorias-chave da problemática educacional estreitamente vinculadas à esfera da avaliação), evidenciado tensões potencialmente constitutivas da controvérsia da avaliação; 3) o desvelamento do embate ideológico-discursivo no campo da avaliação e seu desdobramento políticopedagógico em diferentes zonas argumentativas - gradações de um continumm com diferentes graus de apoio e recusa às avaliações externas e em larga escala. Por fim, ao relacionar as tensões discursivas geradoras e as tensões contextuais constitutivas da controvérsia em questão, propõe-se uma formulação teórica exploratória sobre a gênese do continuum argumentativo, com potencial de orientar possíveis desdobramentos teóricos e empíricos da investigação aqui empreendida. / This theoretical research investigates the academic controversy about large scale assessments in Brazil, systematizing the views/arguments of this debate in a form of a continuum argumentation, outlining the discursive and contextual tensions that surround and permeate the polemics about large scale assessment in basic school. The relevant review of the literature and the appraisal of academic discourses about the theme, from the theoretical-methodological point of view, were supported by the notion of polyphony (BAKHTIN, 2005; MAINGUENEAU, 2002; CHARAUDEAU; MAINGUENEAU, 2016). By the effort to approach, simultaneously and in an equipollent way, the different voices that are expressed diversely about the theme of large scale assessment in Brazil. Therefore, the theoretical incursion is in accordance with three pillars of systematization/interpretation: 1) The reconstruction of a historical plot about the development of external assessment apparatus in Brazil, by means of interpreting the periods that highlight the tensions and central disputes in the discussions between scholars and experts in assessment; 2) The mapping of broad concepts ( key-categories of the educational problematic closely linked to the sphere of evaluation), highlight tensions that potentially constitute the controversies of assessment.; 3) the unveiling of the ideologically-discursive conflict in the field of assessment and its political-pedagogical unfolding in different argumentative areas gradations of a continuum with different degrees of support and the refusal of external assessment in large scale. Finally, in relating the discursive tensions generators and the constitutive contextual tensions of the controversy at issue, an exploratory theoretical formulation is proposed about the genesis of the continuum argumentative, with the purpose to guide possible theoretical and empirical unfolding of investigation here pursued.

O tomateiro, Solanum lycopersicum L., assume mundialmente grande importância econômica na cadeia produtiva de olerícolas, contribuindo para a geração de empregos e renda. Este cultivo esta susceptível à incidência de pragas e doenças durante todo o seu ciclo. Insetos e ácaros pragas causam danos em todas as regiões em que o tomateiro é cultivado, exigindo cuidados constantes e muitos tratos culturais para evitar perdas da produtividade da cultura. Dentre os ácaros fitófagos, Aculops lycopercisi (Massee) (Eriophyidae), microácaro do tomateiro, assume grande importância econômica na cultura. Embora o uso de produtos químicos seja o principal método de combate às pragas deste cultivo, outros métodos menos explorados podem apresentar potencial adequado. Existe hoje interesse em se viabilizar o controle biológico de A. lycopersici com o uso de ácaros predadores. Dentre estes, Euseius concordis (Chant) (Phytoseiidae) parece apresentar grande potencial. Diante disso, existe a necessidade de se estabelecer métodos piloto de criação em larga escala deste predador, tornando possível seu uso em campo. O objetivo deste trabalho foi avaliar a possibilidade de se estabelecer um método piloto de criação em larga escala deste predador com o uso de pólen polvilhado sobre plantas de Canavalia ensiformis L. em condições de laboratório, e de avaliar seu potencial de predação sobre A. lycopersici em tomateiro, em telados. Os resultados mostraram que a provisão de pólen de Typha domingensis (Pers.) sobre plantas de C. ensiformis permite a produção de grandes números de E. concordis em condições controladas. Mostraram também que este predador pode causar redução considerável da densidade de A. lycopersici quando liberado à quantidade de 60 a 120 predadores de maneira preventiva em tomateiros, com a provisão paralela de pólen de T. domingensis. Estudos complementares que visem ao uso prático desse processo devem envolver a liberação de 60 a 120 predadores por planta e avaliação do efeito durante todo o ciclo fenológico da cultura. / Worldwide, Solanum lycopersicum L. is one of the main horticultural crops, contributing to the generation of jobs and income. This crop is susceptible to the incidence of pests and diseases throughout its cycle. Insects and pest mites cause damage in all regions where the tomato is grown, requiring constant care and numerous cultural treatments to avoid losses of crop yield. Among the phytophagous mites, Aculops lycopercisi (Massee), the tomato russet mite, is of great economic importance to this crop. Although the use of chemicals is the main method of pest control on this crop, other alternative methods may have adequate potential. There is great interest now on the use of biological methods including the use of predatory mites for the control of A. lycopersici. Among these predators, Euseius concordis (Chant) (Phytoseiidae) seems to present great potential. Given this, there is a need to establish methods of pilot large scale production of this predator, making possible its use in the field. The objective of this work was to evaluate the possibility of establishing a pilot large scale production method of this predator with the use of pollen provisioned on plants of Canavalia ensiformis L. under laboratory conditions and to evaluate its predation potential on A. lycopersici on tomato plants, in a screen-house. The results showed that the provision of pollen of Typha domingensis (Pers.) on C. ensiformis plants allows the production of large numbers of E. concordis under controlled conditions. They also showed that this predator can cause a considerable reduction of the density of A. lycopersici when released at the quantity of 60 to 120 predators per tomato plant with the parallel supply of pollen of T. domingensis. Complementary studies envisioning the practical use of this process should involve the releasing 60 to 120 predators per plant and evaluating the effect during the whole phenological cycle of the crop.

This dissertation studies two independent problems, one is about graph labeling and the other problem is related to connectivity condition in a simple graph. Graph labeling is a rapidly developing area of research in graph theory, having connections with a variety of application-oriented areas such as VLSI optimization, data structures and data representation. Furthermore, the connectivity conditions in a simple graphs may help us to study the new aspects of ad hoc networks, social networks and web graphs. In chapter 2, we study path systems, reduced path systems and how to construct a super edge-graceful tree with any number of edges using path systems. First, we give an algorithm to reduce a labeled path system to a smaller labeled path system of a different type. First, we investigate the cases (m, k) = (3; 5) and (m, k) = (4; 7), where m is the number of paths and 2k is the length of each path, and then we give a generalization for any k, m = 3 and m = 4. We also describe a procedure to construct a super-edge-graceful tree with any number of edges. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2014. / FAU Electronic Theses and Dissertations Collection

Este trabalho aborda, com base em um estudo de caso, as vicissitudes provocadas pelo Sistema de Avaliação do Rendimento Escolar do Estado de São Paulo (Saresp) na dinâmica de uma escola da rede estadual da Grande São Paulo, no decorrer do processo avaliativo do ano de 2005. É seu objetivo investigar o percurso que foi trilhado pela escola, além de apreciar sua eventual articulação com os objetivos traçados pela Secretaria de Educação do Estado de São Paulo (SEE-SP). Fundamentou-se em informações coletadas na escola por meio de observação e questionário aplicado aos professores, discussões realizadas com grupos de professores, diretor, vice-diretor e coordenador pedagógico e análise de documentos produzidos pela escola, pela Diretoria de Ensino e pela SEE-SP. A análise dessas informações possibilitaram compreender e subsidiar o levantamento de hipóteses sobre eventuais repercussões da avaliação externa na dinâmica escolar. Deste modo, este trabalho sinaliza pesquisas que aprofundem hipóteses aqui apresentadas, fundamentais para o aprimoramento das avaliações em larga escala em nossos sistemas de educação, esboçando, ainda, pistas para os gestores educacionais. / This work addresses, based on a study case, the problems caused by the Schooling Evaluation System in the State of Sao Paulo (SARESP) in the dynamics of a state school located in the extended area of Sao Paulo City, during the evaluation process in 2005. The objective of this study was to investigate the steps followed by the school, and to assess how this system intersected with the goals established by the Secretary of Education of the State of Sao Paulo (SEE-SP). This study was founded upon information collected at the school through observation, and from a questionnaire administered to teachers, from group discussions with teachers, the director, the vice director and a teaching coordinator, in addition to the analysis of documents produced by the school, by the Board of Education and by the SEE-SP. The analysis of this information helped to understand the evaluation process and supported the hypothesis that the evaluation by an external system may cause serious repercussions in the school dynamics. Thus, this work indicates that further research is necessary to study the hypotheses raised herein. This is fundamental for the improvement of evaluations on a large scale in our educational systems, which will outline new directions for educational managers.

Com os próximos grandes projetos the observação do Universo, a cosmologia entrará em uma era de alta precisão de medidas. Novos dados trarão um novo entendimento da evolução do Universo, seus principais componentes e do comportamento da gravi- dade. Sendo assim, é fundamental também ter uma boa predição teórica para a formação de estrutura de larga escala em regime não-linear. A melhor maneira de resolver as equações hidrodinâmicas que descrevem o nosso universo é por meio de simulações cosmológicas na rede. Entretando, estas contém desafios, como a correta inclusão de física bariônica e a diminuição do alto tempo computacional. Uma outra abordagem muito usada é o cálculo das funções de cor- relação por meio de métodos perturbativos (em inglês, Standard Perturbation Theory, ou SPT). Entretanto, esta contém problemas variados: pode não convergir para algu- mas cosmologias e, caso convirja, não há certeza de convergência para o resultado correto. Além disso, há uma escala privilegiada nos limites integrais que envolvem o método perturbativo. Nós calculamos o resultado por esse método até terceira ordem e mostramos que o termo de terceira ordem é ainda maior que o de 2-loops e 3-loops. Isso evidencia alguns problemas descritos com o método perturbativo. O método de Teorias Efetivas de Campo aplicado ao estudo de LSS busca corrigir os problemas da SPT e, desta forma, complementar os resultados de simulações na rede. Em outras áreas da física, como a Cromodinâmica Quântica de baixas energias, EFTs também são usadas como um complemento a essas simulações na rede. EFTs melhoram a predição do espectro de potência da matéria por meio da inclusão dos chamados contra-termos, que precisam ser fitados em simulações. Estes contratermos, que são parâmetros livres, contém importante informação sobre como a física em pequenas escalas afeta a física nas escalas de interesse. Explicaremos os resultados para a predição em 3-loops de EFT, trabalho inédito. É possível usar as EFTs também no problema de conectar a campo de matéria com outros traçadores, como os halos e as galáxias, chamado de bias. Com as EFTs podemos construir uma base completa de operadores para parametrizar o bias. Será explicado como utilizar esses operadores para melhorar a predição do bias em escalas não-lineares. Serão calculados esses termos de EFT em simulações. Também será mostrado como renormalizar o bias em coordenadas de Lagrange. Por fim, será explicada outra importante aplicação das EFTs em cosmologia, mais especificamente em teorias de inflação. EFTs parametrizam desvios nas teorias de um campo único no chamado regime de slow-roll. / With future cosmological surveys, cosmology will enter in the precision era. New data will improve the constraints on the standard cosmological model enhancing our knowledge about the universe history, its components and the behavior of gravity. In this context, it is vital to come up with precise theoretical predictions for the formation of large-scale structure beyond the linear regime. The best way of solving the fluid equations that describe the large-scale universe is through lattice simulations, which faces difficulties in the inclusion of accurate baryonic physics and is very computationally costly. Another approach is the theoreti- cal calculation of the correlation statistics through the perturbative approach, called Standard Perturbation Theory (SPT). However, SPT has several problems: for some cosmologies, it may not converge and even when it converges, we cannot be sure it converges to the right result. Also, it contains a special scale that is the loop momenta upper-bound in the integral. In this work, we show results for the 3-loop calculation. The term of third order is larger than the terms of 2-loops and 3-loops, making explicit SPT problems. In this work, we describe the recent usage of Effective Field Theories (EFTs) on Large Scale Structure problems to correct SPT issues and complement cosmological simulations. EFTs are used in other areas of physics, such as low energy QCD, serving as a complement to lattice calculations. EFT improves the predictions for the matter power spectrum and bispectrum by adding counterterms that need to be fitted. The free parameters, instead of being a problem, bring relevant information about how the small-scale physics affects the scales for which we are trying to make statistical predictions. We show the calculation of the 3-loop EFT counterterms. EFTs are also used to explain main points connecting the matter density field with tracers like galaxies and halos. EFTs highlighted how to construct a complete basis of operators that parametrize the bias. We explain how we can use EFT to improve the bias prediction to non-linear scales. We compute the non-linear halo-bias by fitting the bias parameters in simulations. We also show the EFT renormalization in Lagrangian coordinates. Finally, we explain another critical EFT application to cosmology: in primordial physics. It can be used to parametrize deviations to the slow-roll theory within the inflationary paradigm.

by Teresa W.M. Ng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves 97-100.

by Sau-yuen Wong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 77-82). / Acknowledgement --- p.i / Abstract --- p.ii / List of Tables --- p.ii / List of Figures --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Review of Previous Work --- p.4 / Chapter 2.1 --- Optimization of Delay and Layout Design --- p.4 / Chapter 2.2 --- Simulated Annealing --- p.8 / Chapter 3 --- Definition of Circuit Model --- p.12 / Chapter 4 --- Evaluation of Delay --- p.16 / Chapter 4.1 --- RC-tree and Elmore Delay --- p.16 / Chapter 4.2 --- Exponential Decayed Polynomial Function --- p.17 / Chapter 4.3 --- Two-pole Approximation --- p.18 / Chapter 4.4 --- AWE and Adopted Delay Model --- p.19 / Chapter 5 --- Delay Minimization by Simulated Annealing --- p.28 / Chapter 5.1 --- Cost Function --- p.28 / Chapter 5.2 --- Neighbor Moves --- p.30 / Chapter 5.2.1 --- Logical models --- p.31 / Chapter 5.2.2 --- Discretization of Solution Space --- p.32 / Chapter 5.2.3 --- Valid Configurations --- p.35 / Chapter 5.2.4 --- Valid Moves --- p.39 / Chapter 5.2.5 --- Modification to the Newly Generated Graph --- p.41 / Chapter 5.2.6 --- Access to Neighbor configuration --- p.43 / Chapter 5.2.7 --- Reduction of Solution Space --- p.45 / Chapter 5.2.8 --- Correctness of the Algorithm --- p.48 / Chapter 5.2.9 --- Completeness of the Algorithm --- p.49 / Chapter 6 --- Experimental result --- p.56 / Chapter 6.1 --- Optimization of Overall Performance --- p.58 / Chapter 6.2 --- Optimization on Individual Delay --- p.70 / Chapter 7 --- Conclusion --- p.74 / A --- p.76 / Bibliography

by Eva Yuk-Wah Pang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 88-89). / ACKNOWLEDGEMETS / ABSTRACT / LIST OF FIGURES / LIST OF TABLES / Chapter CHAPTER1 --- INTRODUCTION / Chapter 1.1 --- Motivation --- p.1-1 / Chapter 1.1.1 --- Problems with Synchronous Systems --- p.1-1 / Chapter 1.1.2 --- The Advantages of Self-timed Systems --- p.1-2 / Chapter 1.1.3 --- Self-Timed Cell Library --- p.1-3 / Chapter 1.2 --- Overview of the Thesis --- p.1-5 / Chapter CHAPTER2 --- BACKGROUND / Chapter 2.1 --- Introduction --- p.2-1 / Chapter 2.2 --- Models for Asynchronous System --- p.2-2 / Chapter 2.2.1 --- Huffman model --- p.2-2 / Chapter 2.2.2 --- Muller model --- p.2-4 / Chapter 2.3 --- Self-timed System --- p.2-5 / Chapter 2.3.1 --- Definitions and Assumptions --- p.2-6 / Chapter 2.4 --- Design Methodologies --- p.2-8 / Chapter 2.4.1 --- Differential Logic Structure Design Methodology --- p.2-9 / Chapter 2.4.1.1 --- Data Path --- p.2-9 / Chapter 2.4.1.2 --- Control Path --- p.2-10 / Chapter 2.4.2 --- Micropipeline Design Methodology --- p.2-12 / Chapter 2.4.2.1 --- Data Path --- p.2-12 / Chapter 2.4.2.2 --- Control Path --- p.2-13 / Chapter CHAPTER3 --- SELF-TIMED CELL LIBRARY / Chapter 3.1 --- Introduction --- p.3-1 / Chapter 3.2 --- Muller C element --- p.3-1 / Chapter 3.3 --- Differential Cascode Voltage Switch Logic Circuits --- p.3-6 / Chapter 3.3.1 --- INVERTER --- p.3-8 / Chapter 3.3.2 --- "AND, OR, NAND, NOR" --- p.3-8 / Chapter 3.3.3 --- "XOR, XNOR" --- p.3-10 / Chapter 3.4 --- Latches --- p.3-11 / Chapter 3.4.1 --- Precharged Latch --- p.3-12 / Chapter 3.4.2 --- Capture and Pass Latch --- p.3-12 / Chapter 3.5 --- Delay Elements --- p.3-13 / Chapter 3.6 --- Discussion --- p.3-15 / Chapter CHAPTER4 --- THE CHARACTERISTICS OF SELF-TIMED CELL LIBRARY / Chapter 4.1 --- Introduction --- p.4-1 / Chapter 4.2 --- The Simulation Characteristics --- p.4-2 / Chapter 4.2.1 --- HSPICE program --- p.4-2 / Chapter 4.2.2 --- Characterization Information and Datasheet terms --- p.4-5 / Chapter 4.2.3 --- Characterization values --- p.4-6 / Chapter 4.3 --- The Experimental Analysis --- p.4-6 / Chapter 4.4 --- Experimental Result and Discussion --- p.4-9 / Chapter 4.4.1 --- Experimental Result --- p.4-9 / Chapter 4.4.2 --- Comparison of the characteristics of C-elements --- p.4-12 / Chapter 4.4.3 --- Comparison of simulation with experimental results --- p.4-13 / Chapter 4.4.4 --- Properties of DCVSL gate --- p.4-14 / Chapter 4.4.5 --- The Characteristics of Delay elements --- p.4-15 / Chapter 4.5 --- CAD Features on Cadence --- p.4-16 / Chapter CHAPTER5 --- DESIGN EXAMPLE: SELF-TIMED MATRIX MULTIPLIER / Chapter 5.1 --- Introduction --- p.5-1 / Chapter 5.2 --- A Matrix Multiplier using DCVSL structure --- p.5-2 / Chapter 5.2.1 --- Structure --- p.5-2 / Chapter 5.2.2 --- Handshaking Control Circuit --- p.5-3 / Chapter 5.2.2.1 --- Handshaking Control Circuit of Pipeline --- p.5-4 / Chapter 5.2.2.2 --- Handshaking Control Circuit of Feedback Path --- p.5-8 / Chapter 5.3 --- A Matrix Multiplier using Micropipeline Structure --- p.5-10 / Chapter 5.3.1 --- Structure --- p.5-10 / Chapter 5.3.2 --- Control Circuit --- p.5-12 / Chapter 5.4 --- Experimental Result --- p.5-13 / Chapter 5.4.1 --- The Matrix Multiplier using DCVSL structure --- p.5-13 / Chapter 5.4.2 --- The Matrix Multiplier using Micropipeline structure --- p.5-16 / Chapter 5.5 --- Comparison of DCVSL structure and Micropipeline structure --- p.5-18 / Chapter CHAPTER6 --- CONCLUSION / Chapter 6.1 --- Achievement --- p.6-1 / Chapter 6.1.1 --- Self-timed Cell Library --- p.6-1 / Chapter 6.1.2 --- Self-timed System Design simplification --- p.6-2 / Chapter 6.1.3 --- Area and Speed --- p.6-3 / Chapter 6.1.4 --- Applications --- p.6-4 / Chapter 6.2 --- Future work --- p.6-6 / Chapter 6.2.1 --- Interface with synthesis tools --- p.6-6 / Chapter 6.2.2 --- Mixed Circuit Design --- p.6-6 / REFERENCES / APPENDICES

by H.S. Ng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 91-97). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Neuro-connectionist Network --- p.2 / Chapter 2 --- Related Works --- p.5 / Chapter 2.1 --- Introduction --- p.5 / Chapter 2.1.1 --- Kruskal's Algorithm --- p.5 / Chapter 2.1.2 --- Prim's algorithm --- p.6 / Chapter 2.1.3 --- Sollin's algorithm --- p.7 / Chapter 2.1.4 --- Bellman-Ford algorithm --- p.8 / Chapter 2.1.5 --- Floyd-Warshall algorithm --- p.9 / Chapter 3 --- Binary Relation Inference Network and Path Problems --- p.11 / Chapter 3.1 --- Introduction --- p.11 / Chapter 3.2 --- Topology --- p.12 / Chapter 3.3 --- Network structure --- p.13 / Chapter 3.3.1 --- Single-destination BRIN architecture --- p.14 / Chapter 3.3.2 --- Comparison between all-pair BRIN and single-destination BRIN --- p.18 / Chapter 3.4 --- Path Problems and BRIN Solution --- p.18 / Chapter 3.4.1 --- Minimax path problems --- p.18 / Chapter 3.4.2 --- BRIN solution --- p.19 / Chapter 4 --- Analog and Voltage-mode Approach --- p.22 / Chapter 4.1 --- Introduction --- p.22 / Chapter 4.2 --- Analog implementation --- p.24 / Chapter 4.3 --- Voltage-mode approach --- p.26 / Chapter 4.3.1 --- The site function --- p.26 / Chapter 4.3.2 --- The unit function --- p.28 / Chapter 4.3.3 --- The computational unit --- p.28 / Chapter 4.4 --- Conclusion --- p.29 / Chapter 5 --- Current-mode Approach --- p.32 / Chapter 5.1 --- Introduction --- p.32 / Chapter 5.2 --- Current-mode approach for analog VLSI Implementation --- p.33 / Chapter 5.2.1 --- Site and Unit output function --- p.33 / Chapter 5.2.2 --- Computational unit --- p.34 / Chapter 5.2.3 --- A complete network --- p.35 / Chapter 5.3 --- Conclusion --- p.37 / Chapter 6 --- Neural Network Compensation for Optimization Circuit --- p.40 / Chapter 6.1 --- Introduction --- p.40 / Chapter 6.2 --- A Neuro-connectionist Architecture for error correction --- p.41 / Chapter 6.2.1 --- Linear Relationship --- p.42 / Chapter 6.2.2 --- Output Deviation of Computational Unit --- p.44 / Chapter 6.3 --- Experimental Results --- p.46 / Chapter 6.3.1 --- Training Phase --- p.46 / Chapter 6.3.2 --- Generalization Phase --- p.48 / Chapter 6.4 --- Conclusion --- p.50 / Chapter 7 --- Precision-limited Analog Neural Network Compensation --- p.51 / Chapter 7.1 --- Introduction --- p.51 / Chapter 7.2 --- Analog Neural Network hardware --- p.53 / Chapter 7.3 --- Integration of analog neural network compensation of connectionist net- work for general path problems --- p.54 / Chapter 7.4 --- Experimental Results --- p.55 / Chapter 7.4.1 --- Convergence time --- p.56 / Chapter 7.4.2 --- The accuracy of the system --- p.57 / Chapter 7.5 --- Conclusion --- p.58 / Chapter 8 --- Transitive Closure Problems --- p.60 / Chapter 8.1 --- Introduction --- p.60 / Chapter 8.2 --- Different ways of implementation of BRIN for transitive closure --- p.61 / Chapter 8.2.1 --- Digital Implementation --- p.61 / Chapter 8.2.2 --- Analog Implementation --- p.61 / Chapter 8.3 --- Transitive Closure Problem --- p.63 / Chapter 8.3.1 --- A special case of maximum spanning tree problem --- p.64 / Chapter 8.3.2 --- Analog approach solution for transitive closure problem --- p.65 / Chapter 8.3.3 --- Current-mode approach solution for transitive closure problem --- p.67 / Chapter 8.4 --- Comparisons between the different forms of implementation of BRIN for transitive closure --- p.71 / Chapter 8.4.1 --- Convergence Time --- p.71 / Chapter 8.4.2 --- Circuit complexity --- p.72 / Chapter 8.5 --- Discussion --- p.73 / Chapter 9 --- Critical path problems --- p.74 / Chapter 9.1 --- Introduction --- p.74 / Chapter 9.2 --- Problem statement and single-destination BRIN solution --- p.75 / Chapter 9.3 --- Analog implementation --- p.76 / Chapter 9.3.1 --- Separated building block --- p.78 / Chapter 9.3.2 --- Combined building block --- p.79 / Chapter 9.4 --- Current-mode approach --- p.80 / Chapter 9.4.1 --- "Site function, unit output function and a completed network" --- p.80 / Chapter 9.5 --- Conclusion --- p.83 / Chapter 10 --- Conclusions --- p.85 / Chapter 10.1 --- Summary of Achievements --- p.85 / Chapter 10.2 --- Future development --- p.88 / Chapter 10.2.1 --- Application for financial problems --- p.88 / Chapter 10.2.2 --- Fabrication of VLSI Implementation --- p.88 / Chapter 10.2.3 --- Actual prototyping of Analog Integrated Circuits for critical path and transitive closure problems --- p.89 / Chapter 10.2.4 --- Other implementation platform --- p.89 / Chapter 10.2.5 --- On-line update of routing table inside the router for network com- munication using BRIN --- p.89 / Chapter 10.2.6 --- Other BRIN's applications --- p.90 / Bibliography --- p.91

by Lam Shiu-chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 107-113). / Abstracts in English and Chinese. / List of Figures --- p.v / List of Tables --- p.vii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Task Scheduling Problem and Lower Bound --- p.3 / Chapter 1.3 --- Organization of the Thesis --- p.4 / Chapter 2 --- Teamwork-Task Scheduling Problem --- p.5 / Chapter 2.1 --- Problem Statement and Notations --- p.5 / Chapter 2.2 --- Classification of Scheduling --- p.7 / Chapter 2.3 --- Computational Complexity --- p.9 / Chapter 2.4 --- Literature Review --- p.12 / Chapter 2.4.1 --- Unrelated Machines Scheduling Environment --- p.12 / Chapter 2.4.2 --- Multiprocessors Scheduling Problem --- p.13 / Chapter 2.4.3 --- Search Algorithms --- p.14 / Chapter 2.4.4 --- Lower Bounds --- p.15 / Chapter 2.5 --- Summary --- p.17 / Chapter 3 --- Fundamentals of Genetic Algorithms --- p.18 / Chapter 3.1 --- Initial Inspiration --- p.18 / Chapter 3.2 --- An Elementary Genetic Algorithm --- p.20 / Chapter 3.2.1 --- "Genes, Chromosomes and Representations" --- p.20 / Chapter 3.2.2 --- Population Pool --- p.22 / Chapter 3.2.3 --- Evaluation Module --- p.22 / Chapter 3.2.4 --- Reproduction Module --- p.22 / Chapter 3.2.5 --- Genetic Operators: Crossover and Mutation --- p.23 / Chapter 3.2.6 --- Parameters --- p.24 / Chapter 3.3 --- A Brief Note to the Background Theory --- p.25 / Chapter 3.4 --- Key Factors for the Success --- p.27 / Chapter 4 --- Tasks Scheduling using Genetic Algorithms --- p.28 / Chapter 4.1 --- Details of Scheduling Problem --- p.28 / Chapter 4.2 --- Chromosome Coding --- p.32 / Chapter 4.2.1 --- Job Priority Sequence --- p.33 / Chapter 4.2.2 --- Engineer Priority Sequence --- p.33 / Chapter 4.2.3 --- An Example Chromosome Interpretation --- p.34 / Chapter 4.3 --- Fitness Evaluation --- p.37 / Chapter 4.4 --- Parent Selection --- p.38 / Chapter 4.5 --- Genetic Operators and Reproduction --- p.40 / Chapter 4.5.1 --- Job Priority Crossover (JOB-CRX) --- p.40 / Chapter 4.5.2 --- Job Priority Mutation (JOB-MUT) --- p.40 / Chapter 4.5.3 --- Engineer Priority Mutation (ENG-MUT) --- p.42 / Chapter 4.5.4 --- Reproduction: New Population --- p.42 / Chapter 4.6 --- Replacement Strategy --- p.43 / Chapter 4.7 --- The Complete Genetic Algorithm --- p.44 / Chapter 5 --- Lower Bound on Optimal Makespan --- p.46 / Chapter 5.1 --- Introduction --- p.46 / Chapter 5.2 --- Definitions and Assumptions --- p.48 / Chapter 5.2.1 --- Task Graph --- p.48 / Chapter 5.2.2 --- Graph Partitioning --- p.49 / Chapter 5.2.3 --- Activity and Load Density --- p.51 / Chapter 5.2.4 --- Assumptions --- p.52 / Chapter 5.3 --- Concepts of Lower Bound on the Minimal Time (LBMT) --- p.53 / Chapter 5.3.1 --- Previous Bound (LBMTF) --- p.53 / Chapter 5.3.2 --- Bound in other form --- p.54 / Chapter 5.3.3 --- Improved Bound (LBMTJR） --- p.56 / Chapter 5.4 --- Lower bound: Task graph reconstruction + LBMTJR --- p.59 / Chapter 5.4.1 --- Problem reduction and Assumptions --- p.60 / Chapter 5.4.2 --- Scenario I --- p.61 / Chapter 5.4.3 --- Scenario II --- p.63 / Chapter 5.4.4 --- An Example --- p.67 / Chapter 6 --- Computational Results and Discussions --- p.73 / Chapter 6.1 --- Parameterization of the GA --- p.73 / Chapter 6.2 --- Computational Results --- p.75 / Chapter 6.3 --- Performance Evaluation --- p.81 / Chapter 6.3.1 --- Solution Quality --- p.81 / Chapter 6.3.2 --- Computational Complexity --- p.86 / Chapter 6.4 --- Effects of Machines Eligibility --- p.88 / Chapter 6.5 --- Future Direction --- p.90 / Chapter 7 --- Conclusion --- p.92 / Chapter A --- Tasks data of problem sets in section 6.2 --- p.94 / Chapter A.l --- Problem 1: 19 tasks --- p.95 / Chapter A.2 --- Problem 2: 21 tasks --- p.97 / Chapter A.3 --- Problem 3: 19 tasks --- p.99 / Chapter A.4 --- Problem 4: 23 tasks --- p.101 / Chapter A.5 --- Problem 5: 27 tasks --- p.104 / Bibliography --- p.107