Nous avons d'abord mené une étude de Théorie de la justice et des autres œuvres de John Rawls (Libéralisme politique, Justice et démocratie, Collected Papers, etc.) qui nous offrent un tableau d'une démocratie représentative contemporaine idéale construite sur une version originale du contrat social, un contrat visant le Juste (le Bien laissé à la discrétion de chacun). Cette étude nous permet de dégager les caractéristiques de ce qui définit l'individu libéral (« libéral » au sens de l’usage américain du mot) tel qu'il doit être représenté pour être un contractant plausible à la recherche de ce que sera la justice lorsqu'il aura déterminé les principes fondamentaux de la société. L'identité, libérale, du partenaire de la délibération contractuelle qui concerne les principes constitue le fond de l'identité personnelle de l'individu contemporain, du moins dans la représentation qu'il a de de son identité. Nous avons confronté, dans le cadre de notre perspective, l'identité personnelle induite par le choix d'une thèse contractuelle destinée à la critique de la société démocratique historique telle qu'elle se présente, avec les thèses de M. Sandel et C. Taylor en particulier. Ces derniers critiquent non seulement cette thèse contractuelle rawlsienne, mais surtout, pour nous, l'image qu'elle nous permet d'élaborer de l'identité personnelle comme libérale. L'individu libéral, parce qu'il se représente d'abord et fondamentalement libre, s'attache à des droits (et leurs conditions d'exercice) qu'il se confère et ne s'intéresse que secondairement au Bien. C'est précisément cette auto-représentation du soi qui est rejetée car, par exemple, ce n'est plus le bien visé par l'agent qui est digne de respect, mais l'agent lui-même parce qu'il l'a choisie. Ainsi, la société n'aurait pas à considérer les effets de son choix. Dans notre Esquisse d'une théorie de l'identité libérale, nous nous demandons si elle résiste à ses critiques et, in fine, en quoi consiste la liberté dont le soi libéral pense qu'elle fonde son existence. / We have first led a study of A Theory of Justice and other works by John Rawls (Political Liberalism, Justice et démocratie, Collected Papers, etc.)which offers us a picture of a representative contemporary ideal democracy built on an original version of social contract, a contract aiming at the Just (the Good being left to each individual's discretion). This study gives us the opportunity to release the defining caracteristics of the liberal individual ("liberal" taken in the american use of the word)such as he has to be represented in order to be a plausible contractor in search what is justice going to be once he will have determined the fundamental principles of society. The partner's liberal identity, as he is contracting and deliberating on the principles,establishes the foudation of the contemporary individual's personal identity , at least in the way he represents his identity. We confronted, within the framework of our prospect,the led personal identity by the choice of a contractual theses aimed at a critic of a democratic historical society as it stands, with theses by M. Sandel and C. Taylor, especially. They do not only criticise Rawls' contractual theses, but above all, for us, the image it allows us to built of personal identity as liberal. The liberal individual, because he represents himself first and fundamentally free, links himself to rights (and their conditions of exercise)which he gives himself, and is only secondarily interested by the Good.It is precisely this auto-representation of the self which is rejected, because, e.g., it is not anymore the agent's good aimed at that is worthy of respect but the agent himself becaus he chose it. So, society should not consider the effects of his choice. In our An Outline of a Theory of Liberal Identity, we ask ourselves if it can resist these critics and, in fine, of what liberty, as the liberal self thinks it establishes his life, consists.

Orientador: Plamen Emilov Kochloukov / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-10T10:59:05Z (GMT). No. of bitstreams: 1 SantuloJunior_EdneiAparecido_D.pdf: 675335 bytes, checksum: ff19aaa47432de596122e88eeede9a05 (MD5) Previous issue date: 2007 / Resumo: Kemer classificou, a menos de PI-equivalência, todas as álgebras T-primas no caso de caracterísitica zero e, em seu importante Teorema sobre o Produto Tensorial (TPT), demonstrou que o produto tensorial entre duas álgebras T-primas (ainda sobre corpos de característica zero) resulta igualmente numa álgebra T-prima. Neste trabalho é fornecida uma generalização para o último caso do TPT utilizando identidades graduadas. Além disso, é estudada a existência de mergulhos nas álgebras que aparecem no TPT. Mais especificamente, são encontradas condições necessárias e suficientes para a existência de um mergulho graduado de uma álgebra que satisfaz todas as identidades graduadas da álgebra de matrizes cujas entradas pertencem à álgebra de Grassmann em uma álgebra de matrizes cujas entradas se encontram numa álgebra supercomutativa com unidade, quando todas essas álgebras são consideradas sobre corpos infinitos de característica diferente de dois. Por fim, são fornecidas bases de identidades graduadas para os T-ideais graduados da nésima potência tensorial da' álgebra de Grassmann, das álgebras de matrizes cuja ordem é uma potência de dois, e do produto tensorial de quaisquer duas dentre as álgebras previamente citadas. A partir destas deduz-se o TPT no caso em que a ordem das álgebras de matrizes é uma potência de dois / Abstract: Kemer classified, up to PI-equivalence, the T-prime algebras in the case of characteristic zero, and in his celebrated Tenso r Product Theorem (TPT) he showed that the tensor product of two T-prime algebras considered over a field of characteristic zero, is another T-prime algebra. In this work, a generalization for the last case of the TPT is given using graded identities. The existence of embeddings into the algebras cited on the TPT is also studied. More specifically, necessary and sufficient conditions for the existence of a graded embedding of an algebra satisfying all graded polynomial identities for the matrix algebra with entries in the Grassmann algebra, into a matrix algebra with entries in a supercommutative algebra with unity are found when these algebras are taken over fields of characteristic different from two. Graded identities that generate the graded T-ideals of the n-th tensor power of the Grassmann algebra, of the matrix algebras cited in Kemer's TPT (whose order is a power of two) and of the tensor product between any two of those algebras are provided. As a consequence, Kemer's TPT is derived from those results in the special case when the order of the matrices in the matrix algebras under consideration, is a powers of two / Doutorado / Algebra / Doutor em Matemática

Virtualização permite o compartilhamento de uma rede física entre uma ou mais redes virtuais. O Problema de Mapeamento de Redes Virtuais é um dos principais desafios na virtualização de redes. Esse problema consiste em mapear uma rede virtual em uma rede física, respeitando restrições de capacidade. O presente trabalho mostra que encontrar uma solução factível para esse problema é NP-Difícil. Mesmo assim, muitas instâncias podem ser pode ser resolvidas na prática através da exploração de sua estrutura. Nós apresentamos um algoritmo de Branch & Price aplicado a instâncias de diferentes topologias e tamanhos. Os experimentos realizados sugerem que o algoritmo proposto é superior ao modelo de programação linear resolvido com CPLEX. / Virtualization allows one or more virtual networks to share physical infrastructures. The Virtual Network Embedding problem (VNEP) is one of the main challenges in the virtualization of physical networks. This problem consists in mapping a virtual network into a physical network while respecting capacity constraints. This work shows that finding a feasible solution for this problem is NP-Hard. However, many instances can be solved up to optimality in practice by exploiting the problem structure. We present a Branch & Price algorithm applied to instances of different topologies and sizes. The experimental results suggest that the proposed algorithm is superior to the Integer Linear Programming model solved by CPLEX.

Neste trabalho estudamos o problema relacionado à construção de uma teoria quântica para uma partícula, se movendo não relativisticamente num espaço curvo, tratado como uma subvariedade de outro Euclideano, talvez dando maior ênfase ao aspecto geométrico envolvido nesta abordagem, uma vez que os demais trabalhos relacionados ao mesmo tema não o fazem. Além de mostrarmos que o consequente uso de uma teoria de sistemas vinculados não contribui para remover as ambiguidades da formulação quântica, relacionados diretamente ao ordenamento de operadores, também apresentamos, através de uma quantização específica feita sob a prescrição de Dirac, elementos que permitem não apenas construir um formalismo quântico covariante, mas também liberto de qualquer correção quântica. Em adição, fazemos alguns comentários gerais no que se refere às outras abordagens clássicas possíveis para o mesmo problema, intentando construir teorias quânticas associadas ao sistema sob consideração. / In this work we study the problem related to the construction of a quantum theory for a particle, moving non-relativistically in a curved space, treated as submanifold of the other Euclidean, maybe putting more emphasis on the geometric aspect envolved in this approach, since the rest of the works related to the subject do not. Besides showing that the consequent use of a theory of constrained systems not contributes for remove the ambiguities in the quantum formulation, related directly to the ordering of operators, we also showing, through a specific quantization made in the prescription of Dirac, elements that offers resources not only to construct a covariant quantum formalism, but also free from any quantum correction. In addition, we make some general comments in relation to other classical approaches possible for the same problem, attempting to build quantum theories associated with the system under consideration.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-09-13T18:14:40Z No. of bitstreams: 1 fernandacunhasousa.pdf: 1598443 bytes, checksum: 65e01902ac9f240cb4d888e77ba3758b (MD5) / Approved for entry into archive by Diamantino Mayra (mayra.diamantino@ufjf.edu.br) on 2016-09-26T20:16:35Z (GMT) No. of bitstreams: 1 fernandacunhasousa.pdf: 1598443 bytes, checksum: 65e01902ac9f240cb4d888e77ba3758b (MD5) / Made available in DSpace on 2016-09-26T20:16:35Z (GMT). No. of bitstreams: 1 fernandacunhasousa.pdf: 1598443 bytes, checksum: 65e01902ac9f240cb4d888e77ba3758b (MD5) Previous issue date: 2011-12-22 / FAPEMIG - Fundação de Amparo à Pesquisa do Estado de Minas Gerais / Nosso objetivo de estudo é o de verificar as diferentes possibilidades de construções com querer seguidas de complementos formados por V2. Para essa verificação, o trabalho será norteado, a partir da perspectiva funcionalista discursiva, por duas hipóteses que acreditamos que se complementem: 1. O verbo querer, em virtude de sua carga semântica volitiva, envolve sempre noções de projeção, futuridade e, portanto, irrealis; 2. As diferentes construções querer podem ser descritas de acordo com as diferentes relações sintáticosemânticas estabelecidas com V2 (seja como oração, perífrase ou formando uma só unidade semântica com querer); Para a verificação das hipóteses levantadas e aplicação das teorias selecionadas, utilizamos um corpus pancrônico documental constituído de textos completos: 1. do século XII ao XVI, retirados do Corpus diacrônico do CIPM e do site do Instituto Camões; 2. do século XVII ao XX, fotografados e transcritos diretamente do acervo do Arquivo Nacional do Rio de Janeiro; 3. do século XX ao XXI, transcritos diretamente de cópias impressas dos arquivos do setor de Ações Penais da Vara Federal Criminal da Subseção Judiciária do Rio de Janeiro e textos retirados do site oficial do Supremo Tribunal Federal. E, como as ocorrências encontradas no século XXI do corpus pancrônico foram poucas, para validar a análise empreendida em um corpus escrito do português atual, utilizamos ainda textos escritos retirados da Revista Você SA para formar um corpus exclusivamente sincrônico em que o fenômeno estudado aparecesse. Querer revelou, em nossos dados, duas acepções recorrentes: introdutor de vontade e de vontade/polidez; mas, em conjunto com V2, pode ainda apresentar valores semânticos de conclusão ou função discursiva que se aproxima de um marcador discursivo. Após a análise qualitativa, verificaremos a frequência de cada uma das configurações morfossintáticas possíveis para querer para verificar a distribuição dessas construções nos corpora sincrônico e pancrônico por acreditarmos que a frequência de uso pode ser um fator determinante para elucidar processos de gramaticalização. Para abordar os estágios de encaixamento e de dependência entre querer e V2 observados nas diferentes possibilidades de conexões de oração, trabalhamos com a proposta de Lehmann (1988) e Halliday (1994), e com as propostas de Bybee et alii (1994), Hopper (1991), Heine (1993/1994) sobre a Teoria da Gramaticalização. O fenômeno da gramaticalização é compreendido como um processo que envolve o recrutamento de material lexical que tende a um deslizamento funcional na direção de um item mais gramatical, mas a permanência do traço volitivo impede a completude do processo. Com base no aporte teórico discutido e nas análises empreendidas, foram confirmadas as duas hipóteses inicialmente levantadas para este trabalho. / Our objective of study is to verify the different possibilities of construction with “querer” followed by complements formed by V2. To this verification, our study is going to by guided, from functionalist discursive perspective, by two hypotheses we believe that complement each other: 1. The verb “querer”, by virtue of its volitional semantic load, always involves notions of projection, futurity and, therefore irrealis; 2. The different constructions with “querer” could be described according to the different syntactic-semantic relations established with V2 (either as an oration, or periphrasis forming a single semantic unit with “querer”); For the verification of the considered hypotheses and the application of the selected theories, we used a documental panchronic corpus constituted by complete texts: 1. From the XII to the XVI century, taken from the diachronic Corpus of CIMP and from the Camões Institute website; 2. From the XVII to the XX century, photographed and directly transcripted from the collection of the National Archive of Rio de Janeiro; 3. From the XX to the XXI century, directly transcripted of printed copies of the sector of criminal actions of the Federal Court of Criminal Judiciary Subsection of Rio de Janeiro and texts taken from the official website of Federal Supreme Court. And, how the occurrences found on the XXI century panchronic corpus were few, to validate the analysis undertaken in a written corpus of the actual Portuguese, we also used written texts taken from Você SA magazine to form a corpus exclusively synchronic in that the studied phenomenon appeared. “Querer” revealed, in our data, two recurring meanings: introducer of desire and of desire/politeness; but, with V2, can present semantic values of conclusion or discursive function that approaches of a discursive marker. After the qualitative analysis, we are going to verify the frequency of each one of the possible morphosyntactic configurations for the matrices with “querer” to verify the distribution of these constructions on the synchronic and panchronic corpora because we believe that the frequency of the using can be a determinant factor to elucidate grammaticalization processes. To board the stages of embedding and dependency between matrix and V2 observed in the different possibilities of oration conexions, we worked with the Lehmann proposal (1988) and the Halliday one (1994), and with the Bybee et alii proposal (1994), Hopper (1991), Heine (1993/1994) about the Grammaticalization Theory. The grammaticalization phenomenon is understood as a process that involves recruitment of lexical material that tends to a functional sliding in direction to one item more grammatical, but the permanency of the volitional trait prevents the completion of the process. Based on the theoretical approach discussed and the analysis undertaken, the two hypotheses first raised were confirmed for this study.

Submitted by isabela.moljf@hotmail.com (isabela.moljf@hotmail.com) on 2017-02-22T15:42:17Z No. of bitstreams: 1 marcelazambolimdemoura.pdf: 609075 bytes, checksum: 669a5dfc2cd98dd93bb3a244a289f0c0 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-02-23T11:56:14Z (GMT) No. of bitstreams: 1 marcelazambolimdemoura.pdf: 609075 bytes, checksum: 669a5dfc2cd98dd93bb3a244a289f0c0 (MD5) / Made available in DSpace on 2017-02-23T11:56:14Z (GMT). No. of bitstreams: 1 marcelazambolimdemoura.pdf: 609075 bytes, checksum: 669a5dfc2cd98dd93bb3a244a289f0c0 (MD5) Previous issue date: 2009-04-27 / Neste trabalho, investigamos orações encaixadas subjetivas de algumas matrizes compostas por [matriz (verbo ser + predicativo) + oração subjetiva]. Assumimos como hipótese que haja graus de ligação entre encaixada subjetiva e suas matrizes [verbo ser + predicativo], que aparecem em concorrência em um mesmo domínio funcional. Entre esses diferentes usos, encontramos casos que estão mais ou menos integrados. Tal análise toma como eixo a indicação semântica da matriz, encontrada na expressão dos valores: modalidade e avaliação. A modalidade foi dividida em epistêmica e deôntica, e, a avaliação, em afetiva, apreciativa e julgamento. A oração encaixada subjetiva foi analisada de acordo com sua realização formal: finita, que se apresentou, em certos casos, sintática e semanticamente desvinculada da matriz, ou não-finita – que se apresentou fortemente integrada à matriz. As orações matrizes indicadoras de modalidade epistêmica asseverativa e relativa e algumas matrizes indicadoras de avaliação mostram-se amplamente desvinculadas das orações encaixadas subjetivas, que se realizaram na forma finita, categoricamente, no presente do indicativo. Esses casos apresentam comportamento semelhante ao dos advérbios sentenciais: têm posição quase fixa na sentença – posição inicial – e expressam modalidade epistêmica, e, avaliação. As matrizes permitem serem substituídas por advérbio correspondente terminado em –mente e serem retiradas das sentença sem que essa se torne agramatical. Além disso, marcam impessoalidade através da quase cristalização do verbo na terceira pessoa do singular do presente do indicativo e da não marcação de gênero no predicativo – sendo recorrente o masculino, quando marcado. Tais características apontam para a desvinculação sintático-semântica da matriz em relação à encaixada. / This paper investigates embedded subject clauses of some matrices composed by [matrix (verb be + predicative) + subject clause]. We assume as a hypothesis that there are different linking degrees between embedded subject clauses and their matrices [verb be + predicative], which show up concurring in a same functional domain. Among these different uses, we find cases that are more or less integrated. Such an analysis takes as its axis the semantic indication of the matrix, found in the expression of values: modality and evaluation. Modality was divided into epistemic and deontic, and evaluation, into affective, appreciative and judgment. The embedded subject clause was analyzed according to its formal performance: finite –which was, in some cases, syntactically and semantically decoupled from the matrix–, or non-finite –which was strongly integrated into the matrix. Matrix clauses indicating assertive and relative epistemic modality and some matrices indicating evaluation were largely decoupled from embedded subject clauses, which were performed in the finite form, categorically, in the present indicative. These cases show a behavior similar to that of clausal adverbs: they have a quasi-fixed position in the clause –initial position– and express epistemic modality, and, evaluation. The matrices allow for their being substituted for a corresponding adverb ending in “-ly” and for their being taken off the clause without making the latter non-grammatical. Moreover, they mark impersonality through quasicrystallization of the verb in the third person singular of the present indicative and through not marking gender in the predicative – the masculine being recurrent, if gender is marked at all. These features point to the syntactic-semantic decoupling of the matrix in relation to the embedded clause.

Present-day software systems have to fulfill an increasing number of requirements, which makes them more and more complex. Many systems need to anticipate changing contexts or need to adapt to changing business rules or requirements. The challenge of 21th-century software development will be to cope with these aspects. We believe that the role concept offers a simple way to adapt an object-oriented program to its changing context. In a role-based application, an object plays multiple roles during its lifetime. If the contexts are represented as first-class entities, they provide dynamic views to the object-oriented program, and if a context changes, the dynamic views can be switched easily, and the software system adapts automatically. However, the concepts of roles and dynamic contexts have been discussed for a long time in many areas of computer science. So far, their employment in an existing object-oriented language requires a specific runtime environment. Also, classical object-oriented languages and their runtime systems are not able to cope with essential role-specific features, such as true delegation or dynamic binding of roles. In addition to that, contexts and views seem to be important in software development. The traditional code-oriented approach to software engineering becomes less and less satisfactory. The support for multiple views of a software system scales much better to the needs of todays systems. However, it relies on programming languages to provide roles for the construction of views. As a solution, this thesis presents an implementation pattern for role-playing objects that does not require a specific runtime system, the SCala ROles Language (SCROLL). Via this library approach, roles are embedded in a statically typed base language as dynamically evolving objects. The approach is pure in the sense that there is no need for an additional compiler or tooling. The implementation pattern is demonstrated on the basis of the Scala language. As technical support from Scala, the pattern requires dynamic mixins, compiler-translated function calls, and implicit conversions. The details how roles are implemented are hidden in a Scala library and therefore transparent to SCROLL programmers. The SCROLL library supports roles embedded in structured contexts. Additionally, a four-dimensional, context-aware dispatch at runtime is presented. It overcomes the subtle ambiguities introduced with the rich semantics of role-playing objects. SCROLL is written in Scala, which blends a modern object-oriented with a functional programming language. The size of the library is below 1400 lines of code so that it can be considered to have minimalistic design and to be easy to maintain. Our approach solves several practical problems arising in the area of dynamical extensibility and adaptation.

No description available.

As the "network of network", the Internet has been playing a central and crucial role in modern society, culture, knowledge, businesses and so on in a period of over two decades by supporting a wide variety of network technologies and applications. However, due to its popularity and multi-provider nature, the future development of the Internet is limited to simple incremental updates. To address this challenge, network virtualization has been propounded as a potential candidate to provide the essential basis for the future Internet architecture. Network virtualization is capable of providing an open and flexible networking environment in which service providers are allowed to dynamically compose multiple coexisting heterogeneous virtual networks on a shared substrate network. Such a flexible environment will foster the deployment of diversified services and applications. A major challenge in network virtualization area is the Virtual Network Embedding (VNE), which aims to statically or dynamically allocate virtual nodes and virtual links on substrate resources, physical nodes and paths. Making effective use of substrate resources requires high-efficient and survivable VNE techniques. The main contribution of this thesis is two high-performance p-Cycle-based survivable virtual network embedding approaches. These approaches take advantage of p-Cycle-based protection techniques that minimize the backup resources while providing a full VN protection scheme against link and node failures.

Les systèmes à canaux non fiables ont été introduits à l'origine comme un modèle de communication. Ils ont donné naissance à une classe de complexité restée mal comprise pendant longtemps. Dans cette thèse, nous étudions et comblons certaines des plus importantes lacunes dans la connaissance de cette classe. Nous fournissons entre autres des bornes inférieure et supérieure qui se rejoignent pour la complexité en temps. Puis nous proposons un nouvel outil de preuve : le Problème de Sous Mot de Post (PEP). C'est un problème simple, inspiré du Problème de Correspondance de Post, et complet pour cette classe de complexité. Nous étudions ensuite PEP et ses variantes, ainsi que les langages de solutions de PEP sur lesquels nous avons fourni des résultats de complexité et des outils de preuve tels que des lemmes de pompage. / Lossy channel systems were originally introduced to model communication protocols. It gave birth to a complexity class wich remained scarcely undersood for a long time. In this thesis we study some of the most important gaps. In particular, we bring matching upper and lower bounds for the time complexity. Then we describe a new proof tool : the Post Embedding Problem (PEP) which is a simple problem, closely related to the Post Correspondence Problem, and complete for this complexity class. Finally, we study PEP, its variants and the languages of solutions of PEP on which we provide complexity results and proof tools like pumping lemmas.