CMOS image sensor based on Active pixel sensor has considerably contributed to the imaging market and research interest in the past decade. Furthermore technology advancement has provided the capability to integrate more and more functionality into a single chip in multiple layers leading to a new paradigm, 3D integration. CMOS image sensor is one such application which could utilize the capability of 3D stacked architecture to achieve dedicated technologies in different layers, wire length reduction, less area, improved performancesThis research work is focused mainly on the early stages of design space exploration using hierarchical approach and aims at reducing time to market. This work investigates the imager from the top-down design perspective. Methodical anal y sis of imager is performed to achieve high level of flexibility and modularity. Re-useable models are developed to explore early design choices throughout the hierarchy. Finally, pareto front (providing trade off solutions) methodology is applied to explore the operating range of individual block at system level to help the designer making his design choice. Furthermore the thermal issues which get aggravated in the 3D stacked chip on the performance of the imager are studied. Systeme based thermal model is built to investigate the behavior of imager pixel matrix and to simulate the pixel matrix at high speed with acceptable accuracy compared to electrical simulations. The modular nature of the model makes simulations with future matrix extension straightforward. Validation of the thermal model with respect to electrical simulations is discussed. Finally an integrated design flow is developed to perform 3D floorplanning and to perform thermal anal y sis of the imager pixel matrix.

This thesis addresses two important classes of optimization : multiobjective optimization and bilevel optimization. The investigation concerns their solution methods, applications, and possible links between them. First of all, we develop a procedure for solving Multiple Objective Linear Programming Problems (MOLPP). The method is based on a new characterization of efficient faces. It exploits the connectedness property of the set of ideal tableaux associated to degenerated points in the case of degeneracy. We also develop an approach for solving Bilevel Linear Programming Problems (BLPP). It is based on the result that an optimal solution of the BLPP is reachable at an extreme point of the underlying region. Consequently, we develop a pivoting technique to find the global optimal solution on an expanded tableau that represents the data of the BLPP. The solutions obtained by our algorithm on some problems available in the literature show that these problems were until now wrongly solved. Some applications of these two areas of optimization problems are explored. An application of multicriteria optimization techniques for finding an optimal planning for the distribution of electrical energy in Cameroon is provided. Similary, a bilevel optimization model that could permit to protect any economic sector where local initiatives are threatened is proposed. Finally, the relationship between the two classes of optimization is investigated. We first look at the conditions that guarantee that the optimal solution of a given BPP is Pareto optimal for both upper and lower level objective functions. We then introduce a new relation that establishes a link between MOLPP and BLPP. Moreover, we show that, to solve a BPP, it is possible to solve two artificial M0PPs. In addition, we explore Bilevel Multiobjective Programming Problem (BMPP), a case of BPP where each decision maker (DM) has more than one objective function. Given a MPP, we show how to construct two artificial M0PPs such that any point that is efficient for both problems is also efficient for the BMPP. For the linear case specially, we introduce an artificial MOLPP such that its resolution can permit to generate the whole feasible set of the leader DM. Based on this result and depending on whether the leader can evaluate or not his preferences for his different objective functions, two approaches for obtaining efficient solutions are presented

Le but de cette thèse est de proposer des méthodes générales afin de contourner l'intractabilité de problèmes d'optimisation multi-objectifs.Dans un premier temps, nous essayons d'apprécier la portée de cette intractabilité en déterminant une borne supérieure, facilement calculable, sur le nombre de points non dominés, connaissant le nombre de valeurs prises par chaque critère.Nous nous attachons ensuite à produire des représentations discrètes et tractables de l'ensemble des points non dominés de toute instance de problèmes d'optimisation multi-objectifs. Ces représentations doivent satisfaire des conditions de couverture, i.e. fournir une bonne approximation, de cardinalité, i.e. ne pas contenir trop de points, et si possible de stabilité, i.e. ne pas contenir de redondances. En s'inspirant de travaux visant à produire des ensembles ε-Pareto de petite taille, nous proposons tout d'abord une extension directe de ces travaux, puis nous axons notre recherche sur des ensembles ε-Pareto satisfaisant une condition supplémentaire de stabilité. Formellement, nous considérons des ensembles ε-Pareto particuliers, appelés (ε, ε′)-noyaux, qui satisfont une propriété de stabilité liée à ε′. Nous établissons des résultats généraux sur les (ε, ε′)-noyaux puis nous proposons des algorithmes polynomiaux qui produisent des (ε, ε′)-noyaux de petite taille pour le cas bi-objectif et nous donnons des résultats négatifs pour plus de deux objectifs.

No description available.

Des procédures de classement sont largement utilisées pour décrire les phénomènes observés dans de nombreux domaines des sciences sociales et naturelles, par exemple la sociologie, l'économie, la linguistique, la démographie, la physique, la biologie, etc.Dans cette thèse, nous nous sommes attachés à l'étude des propriétés de classement et des dynamiques sous-jacentes intégrées dans les systèmes complexes. En particulier,nous nous sommes concentrés sur les classements par score ou par prix dans les systèmes sportifs et les classements d'utilisation des mots ou caractères dans les langues humaines. Le but est de comprendre les mécanismes sous-jacents à ces questions en utilisant les méthodes de la physique statistique, de la statistique bayésienne et de la modélisation multi-agents. Les résultats concrets concernent les aspects suivants.Nous avons tout d'abord traité une étude sur les classements par score/prix dans les systèmes sportifs et analysé 40 échantillons de données dans 12 disciplines sportives différentes. Nous avons trouvé des similitudes frappantes dans différents sports, à savoir le fait que la répartition des résultats/prix suit les lois puissance universelles.Nous avons également montré que le principe de Pareto est largement respecté dans de nombreux systèmes sociaux: ainsi 20% des joueurs accumulent 80% des scores et de l'argent. Les données concernant les matchs de tennis en individuels nous ont révélé que lorsque deux joueurs s'affrontent, la probabilité que le joueur de rang supérieur gagne est liée à la différence de rang des deux adversaires. Afin de comprendre les origines de la mise à l'échelle universelle, nous avons proposé un modèle multi-agents,qui peut simuler les matchs de joueurs à travers différentes compétitions. Les résultats de nos simulations sont cohérents avec les résultats empiriques. L'extension du domaine d'étude de la simulation indique que le modèle est assez robuste par rapport aux modifications de certains paramètres. La loi de Zipf est le comportement le plus régulièrement observé dans la linguistique statistique. Elle a dès lors servi de prototype pour les relations entre rang d'apparitions et fréquence d'apparitions (relations rang-fréquence dans la suite du texte) et les lois d'échelle dans les sciences naturelles. Nous avons étudié plusieurs textes, précisé le domaine de validité de la loi de Zipf, et trouvé que la plage de validité augmente lors du mélange de différents textes. Basé sur l'analyse sémantique latente, nous avons proposé un modèle probabiliste, dans lequel nous avons supposé que les mots sont ajoutés au texte avec des probabilités aléatoires, tandis que leur densité a priori est liée, via la statistique bayésienne, aux caractéristiques générales du lexique mental de l'auteur de ce même texte. Notre modèle explique la loi de Zipf ainsi que ses limites de validité, et la généralise aux hautes et basses fréquences et au hapax legomena.Dans une autre étude, nous avons précisé les relations rang-fréquence pour les caractères chinois. Nous avons choisi d'étudier des textes courts en premier, car pour le bien de l'analyse rang fréquence, les longs textes ne sont que des mélanges de textes plus courts, thématiquement homogènes. Nos résultats ont montré que la loi de Zipf appliqués aux caractères chinois tient parfaitement pour des textes assez courts (quelques milliers de caractères différents). Le même domaine de validité est observé pour les textes courts anglais. Nous avons soutenu que les longs textes chinois montrent une structure hiérarchique à deux couches: des caractères dont la fréquence d'apparition suit une loi puissance (première couche) et des caractères dont l'apparition suit une loi exponentielle (deuxième couche)...

Univ., Diss.--Bonn, 2002.

Many concrete problems, ranging from Portfolio selection to Water resource management, may be cast into a multiobjective programming framework. The simplistic way of superseding blindly conflictual goals by one objective function let no chance to the model but to churn out meaningless outcomes. Hence interest of discussing ways for tackling Multiobjective Programming Problems. More than this, in many real-life situations, uncertainty and imprecision are in the state of affairs. In this dissertation we discuss ways for solving Multiobjective Programming Problems with fixed and fuzzy coefficients. No preference, a priori, a posteriori, interactive and metaheuristic methods are discussed for the deterministic case. As far as the fuzzy case is concerned, two approaches based respectively on possibility measures and on Embedding Theorem for fuzzy numbers are described. A case study is also carried out for the sake of illustration. We end up with some concluding remarks along with lines for further development, in this field. / Operations Research / M. Sc. (Operations Research)

The thesis deals with the analysis of quality management system in a selected organization and with tasks assigned by the organization's quality manager. The company is Aspera, spol. s r.o., specifically its metal manufacturing centre Aspera Technology in České Budějovice. The thesis is divided into a theoretical and a practical part. The theoretical part is based on study of scientific literature and focuses on quality definition, history of quality management, quality management system principles and concepts and quality management tools, especially process flowchart, Pareto diagram and FMEA. The practical part describes the company, its manufacturing centre and its quality management system. The next part deals with the three assigned tasks. First, designated company processes are described and visualized in the form of flowcharts. Second, weak points and risks of these processes are analysed using FMEA and corrective actions are recommended. Third, the most significant internal defects are identified using Pareto chart and cost analysis. At the end of the thesis some suggestions for improvement are provided. The suggestions were observed during an internship in the company and should enhance the quality management system and help the overall operation of the company processes.

Orientador: Antonio Padilha Feltrin / Banca: Rubén Augusto Romero Lázaro / Banca: Dionízio Paschoareli Júnior / Banca: Gareth Harrison / Banca: Carmen Lucia Tancredo Borges / Resumo: Neste trabalho, é apresentada uma análise em regime permanente que considera a avaliação de impactos técnicos tais como perdas elétricas, queda de tensão e níveis de curto-circuito, entre outros; utilizando dados de demanda e geração variáveis no tempo ao longo de um horizonte determinado. O objetivo é encontrar um conjunto de arranjos da GD (configurações) que levem ao melhor desempenho da rede de distribuição analisada, minimizando ou maximizando cada aspecto técnico segundo o interesse da empresa de distribuição. Dada a natureza combinatória deste problema, que requer uma ferramenta de otimização capaz de manipular múltiplos objetivos, os impactos técnicos serão avaliados simultaneamente utilizando uma metodologia baseada no conceito do Non-dominated Sorting Genetic Algorithm (NSGA), conduzindo a soluções mais reais e diversificadas para a tomada de decisões, conhecidas como soluções ótimas de Pareto. / Abstract: In this work a steady-state analysis considering the assessment of technical impacts such as losses, voltage drop and short-circuit levels, among others; utilizing time-variant loads and generation within a specified horizon. The objective is to find a set of configurations that lead to the best performance of the distribution network under analysis, minimizing or maximizing each technical aspect according to the utility's concerns. Given the combinatorial nature of this problem, which requires an optimization tool able to handle multiple objectives, technical impacts will be assessed simultaneously through a methodology based on the non-dominated sorting genetic algorithm (NSGA). This approach leads to a more realistic and diversified set of solutions for taking decisions, known as Pareto-optimal solutions. / Doutor

Submitted by Etelvina Domingos (etelvina.domingos@ufpe.br) on 2015-03-12T18:30:37Z No. of bitstreams: 2 TESE Juliana Freitas Pires.pdf: 2036830 bytes, checksum: 9cf767526859054ed6878742b0a6047f (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-12T18:30:37Z (GMT). No. of bitstreams: 2 TESE Juliana Freitas Pires.pdf: 2036830 bytes, checksum: 9cf767526859054ed6878742b0a6047f (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2014-02 / Nesta tese, tratamos de refinamentos de inferências para as distribuições gaussiana inversa triparamétrica, Pareto generalizada e Lomax. Duas linhas de pesquisa são abordadas. A primeira, referente ao Capítulo 2, trata da derivação de expressões analíticas para os vieses dos estimadores de máxima verossimilhança dos parâmetros da distribuição gaussiana inversa triparamétrica, possibilitando a obtenção de estimadores corrigidos, que, em princípio, são mais precisos que os não corrigidos. Estimadores com vieses corrigidos por bootstrap são também considerados. Adicionalmente, apresentamos diferentes tipos de intervalos de confiança. A segunda linha de pesquisa, referente aos Capítulos 3 e 4, aborda a derivação de ajustes para a função de verossimilhança perfilada das distribuições Pareto generalizada e Lomax, respectivamente, com o objetivo de melhorar a qualidade das inferências (estimadores de máxima verossimilhança e testes de hipóteses) acerca do parâmetro de forma dessas distribuições, considerando os demais parâmetros como parâmetros de perturbação. Adicionalmente, consideramos o teste da razão de verossimilhanças bootstrap. Os desempenhos dos estimadores e testes de hipóteses baseados nos refinamentos propostos foram avaliados numericamente e comparados às suas contrapartidas usuais através de estudos de simulação de Monte Carlo. Por fim, a utilidade dos refinamentos foi ilustrada através de aplicações a conjuntos de dados reais.