Um anel noetheriano S satisfaz a propriedade ( ) se todas as extens~oes essenciais c clicas de S-m odulos simples s~ao artinianas. An eis noetherianos com esta propriedade veri cam a Conjectura de Jacobson, que e um famoso problema em aberto em teoria de an eis. Neste trabalho investigamos esta propriedade em an eis de operadores diferenciais R[ ; ], onde R e um anel comutativo noetheriano e uma deriva c~ao de R. Mais especi camente, estudamos condi c~oes necess arias e su cientes para que R[ ; ] satisfa ca ( ), quando R e um anel -simples e, tamb em, no caso em que este e um anel -primitivo. Al em disso, caracterizamos os an eis de operadores diferenciais C[x; y][ ; ] que satisfazem ( ). / A Noetherian ring S satis es the property ( ) if any cyclic essential extension of simple S-modules are Artinian. Noetherian rings with this property verify Jacobson's Conjecture, which is a famous open problem in ring theory. In this work we investigate this property in di erential operators rings R[ ; ], where R is a commutative Noetherian ring and is a derivation of R. More precisely, we study necessary and su cient conditions for R[ ; ] to satisfy property ( ) whenever R is a -simple ring and also for the case where it is a -primitive ring. Furthermore, we characterize the di erential operator rings C[x; y][ ; ] satisfying ( ).

Provamos que \'C POT. 1\' genericamente difeomorfismos simpléticos ou são Anosov ou possuem entropia topológica limitada por baixo pelo supremo sobre o menor expoente de Lyapunov positivo dos pontos periódicos hiperbólicos. Usando isto exibimos exemplos de difeomorfismos conservativos sobre superfícies que não são pontos de semicontinuidade superior para a entropia topológica. Provamos também que \'C POT. 1\' genericamente difeomorfismos simpléticos não Anosov não admitem extensões simbólicas. Mudando de assunto, Hayashi estendeu um resultado de Mañé, provando que todo difeomorfismo f que possui uma \'C POT. 1\' vizinhança U, onde todos os pontos periódicos de qualquer g \'PERTENCE A\' U são hiperbólicos, é de fato um difeomorfismo Axioma A. Aqui, provamos o resultado análogo a este no caso conservativo, e a partir deste é possível exibir uma demonstração de um fato \"folclore\", a conjectura de Palis no caso conservativo / We prove that a \'C POT.1\' generic symplectic diffeomorphism is either Anosov or the topological entropy is bounded from below by the supremum over the smallest positive Lyapunov exponent of the periodic points. By means of that we give examples of area preserving diffeomorphisms which are not point of upper semicontinuity of entropy function in \'C POT. 1\' topology. We also prove that \'C POT. 1\'- generic symplectic diffeomorphisms outside the Anosov ones do not admit symbolic extension. Changing of subject, Hayashi has extended a result of Mañé, proving that every diffeomorphism f which has a \'C POT. 1\'-neighborhood U, where all periodic points of any g \'IT BELONGS\' U are hyperbolic, it is an Axiom A diffeomorphism. Here, we prove the analogous result in the volume preserving scenario, and using it we prove a \"folklore\" fact, the Palis conjecture in this context

Cette thèse est centrée autour de la monogénéité de corps de nombres en situation relative puis à la conjecture de Collatz.\newline Premièrement on détermine l'ensemble de classes des générateurs de l'anneau des entiers des certaines extensions relatives de corps de nombres, en utilisant l'algorithme de Gaál & Phost et le logiciel PARI/GP. La deuxième partie propose différents formulations d'une généralisation de la conjecture de Collatz, aux entiers p-adiques. On étudie ensuite le comportement de suites analogues dans le cadre d'anneaux d'entiers de corps de nombres. / This thesis are centered around the monogeneity of number fields in a relative situation and the Collatz conjecture. Firstly, we determine the set of generator classes of the ring of integers of some relative extensions of number fields, using the Gaál& Phost algorithm and the PARI/GP software. The second part proposes different formulations of a generalization of the Collatz conjecture to p-adic integers. We then study the behavior of similar sequences in the framework of rings of integers of number fields.

This thesis presents a quantitative evaluation of an operating system virtualization technology known as Solaris Containers or Solaris Zones, with a special emphasis on measuring the influence of a security technology known as Solaris Trusted Extensions. Solaris Zones is an operating system-level (OS-level) virtualization technology embedded in the Solaris OS that primarily provides containment of processes within the abstraction of a complete operating system environment. Solaris Trusted Extensions presents a specific configuration of the Solaris operating system that is designed to offer multi-level security functionality. Firstly, we examine the scalability of the OS with respect to an increasing number of zones. Secondly, we evaluate the performance of zones in three scenarios. In the first scenario we measure - as a baseline - the performance of Solaris Zones on a 2-CPU core machine in the standard configuration that is distributed as part of the Solaris OS. In the second scenario we investigate the influence of the number of CPU cores. In the third scenario we evaluate the performance in the presence of a security configuration known as Solaris Trusted Extensions. To evaluate performance, we calculate a number of metrics using the AIM benchmark. We calculate these benchmarks for the global zone, a non-global zone, and increasing numbers of concurrently running non-global zones. We aggregate the results of the latter to compare aggregate system performance against single zone performance. The results of this study demonstrate the scalability and performance impact of Solaris Zones in the Solaris OS. On our chosen hardware platform, Solaris Zones scales to about 110 zones within a short creation time (i.e., less than 13 minutes per zone for installation, configuration, and boot.) As the number of zones increases, the measured overhead of virtualization shows less than 2% of performance decrease for most measured benchmarks, with one exception: the benchmarks for memory and process management show that performance decreases of 5-12% (depending on the sub-benchmark) are typical. When evaluating the Trusted Extensions-based security configuration, additional small performance penalties were measured in the areas of Disk/Filesystem I/O and Inter Process Communication. Most benchmarks show that aggregate system performance is higher when distributing system load across multiple zones compared to running the same load in a single zone.

No description available.

This master thesis deals with the topic of browser extensions, their environment and analysis. The goal is to describe the extensions environment, online Webstores, that offers extensions and to show best practices for analysis and optimization of its extensions and their assets. Within the thesis you can find very precise analysis of online Webstores for Google Chrome extensions and Mozilla Firefox add-ons. Conclusions are made based on this analysis that include special characteristics of the previously mentioned browsers. The master thesis consists of two parts, theoretical and practical. The theoretical parts deals with the description of the browser extensions environment and it presents specific characteristics about online Webstores and browser extensions to the reader. In the practical part the thesis is focused on objectives set by the thesis and it presents the results of the Webstore analysis and description of the universal Google Analytics solution that helps developers to analyze their extensions The thesis contributes to the topic mainly with the precise description of the browser Webstores and extensions environment, best practices and recommendations and by creating the universal Google Analytics solutions for the developers.

This master's thesis deals with extensions of TOPSIS method, which is one of methods for multi-criteria evaluation of alternatives. These extensions use theory of fuzzy sets (FS) and their futher extensions to interval-valued (IVFS), intuitionistic (IFS) and hesitant (HFS) fuzzy sets and their combinations (IVIFS, IVIHFS). Significant part of this thesis explains the principle of fuzzy sets and their generalizations. Descriptions of operators for aggregations of grades of membership has very important role here. Next, very short description of multi-criteria evaluation problems and detailed description of TOPSIS method are contained. The second half of this thesis is dedicated to four existing extensions of TOPSIS metod that uses theories of FS, IVFS, IVIFS and IVIHFS. Every method is illustrated with an example that shows principle of calculations. It illustrates new possibilities of the methods that use new sets theories and potential complications and deviations from the original TOPSIS method. At the end of this thesis, evaluation of usefulness of used approaches is mentioned.

Целью работы является разработка фреймворка для создания веб-браузерных расширений. Объектом исследования является класс программных средств для автоматизации и упрощения работы разработчиков с веб-браузерными расширениями. Методы исследования включают: анализ, сравнение и обобщение данных о существующих способах автоматизации разработки веб-браузерных расширений; апробация современных WEB-технологий. Магистерская диссертация содержит 4 главы. В первой главе описаны основные теоретические аспекты предметной области. Вторая глава содержит анализ и описание средств разработки. Третья глава посвящена описанию процесса разработки фреймворка. В четвертой главе представлено описание возможностей фреймворка. Результатом работы является разработанный фреймворк для создания расширений веб-браузера. / The aim of the work is to develop a framework for developing web browser extensions. The object of research is a class of software tools for automating and simplifying the work of developers with web browser extensions. Research methods include analysis, comparison, and generalization of data on existing methods for automating the development of web browser extensions; approbation of modern WEB-technologies. The paper contains 4 chapters. The first chapter describes the main theoretical aspects of the subject area. The second chapter contains an analysis and description of development tools. The third chapter is devoted to describing the framework development process. The fourth chapter presents a description of framework capabilities. The result of the work is the framework for developing web browser extensions.

Aus der Einleitung: „Terminological knowledge representation systems (TKR systems) are powerful tools not only to represent but also to reason about the knowledge on the terminology of an application domain. Their particular power lie in their ability to infer implicit knowledge from the knowledge explicitly stored in a knowledge base. Mainly, a TKR system consists of three parts: First, a terminological knowledge base which contains the explicit description of the concepts relevant for the application domain. Second, an assertional knowledge base which contains the description of concrete individuals and their relations. This description of concrete individuals is realized using the terminology fixed in the terminological knowledge base. Third, a TKR system comprises an inference engine which is able to infer implicit properties of the defined concepts and individuals such as subclass/superclass relations amongst concepts (subsumption), the classifcation of all defned concepts with respect to the subclass/superclass relation. This yields the class taxonomy. whether there exists an interpretation of the terminology where a given concept has at least one instance (satisfiability), to enumerate all individuals that are instances of a given concept (retrieval), given a concrete individual, to enumerate the most specific concepts of the terminology this individual is an instance of.”

M.Sc. (Statistics)