Cette thèse s'intéresse à la personnalisation et à la personnification d'agents intelligents dans le cadre d'applications web. Les techniques de personnalisation et de personnification sont de plus en plusutilisées pour mieux répondre aux besoins des utilisateurs. La plupart de ces techniques reposent sur des outils de raisonnement issus de l'intelligence artificielle. Cependant, ces techniques sont habituellement utilisés de manière ad-hoc pour chaque application. L'approche de cette thèse est de considérer la personnalisation et la personnification comme deux instances d'altération de comportement, et à étudier l'altération du comportements d'agents rationnels. Les principales contributions sont WAIG, un formalisme basé sur le langage Golog adapté à l'expression d'applications web, et PAGE, un cadre formel pour la manipulation et l'altération de programmes agents Golog, permettant la transformation automatique d'agent selon un critère donné. Ces contributions sont illustrés par plusieurs scénarios concrets issus des domaines de la personnalisation et de la personnification. / This thesis deals with personalization and personification of rational agents within the framework of web applications. Personalization and personification techniques are more and more used to answer the needs of users. Most of those techniques are based on reasoning tools that come from the artificial inteligence field. However, those techniques are usually used in an ad-hoc way for each application. The approach of this thesis is to consider personaliaation and personification as two instances of alteration of behaviour, and to study the alteration of the behaviours of rational agents. The main contributions are WAIG, a formalism for the expression of web applications based on the agent programming language Golog, and PAGE, a formal framework for the manipulation and the alteration of Golog agent programs, which allow to transform an agent automatically following a given criterion. Those contributions are illustrated by concrete scenarios from the fields of personalization and personification.

Cette thèse porte sur des problèmes d'exploration de données avec le point de vue de la recherche opérationnelle. L'exploration de données consiste en l'apprentissage de nouvelles connaissances à partir d'observations contenues dans une base de données. La nature des problèmes rencontrés dans ce domaine est proche de celle des problèmes de la recherche opérationnelle: grandes instances, objectifs complexes et difficulté algorithmique. L'exploration de données peut aussi se modéliser comme un problème d'optimisation avec un objectif partiellement connu. Cette thèse se divise en deux parties. La première est une introduction à l'exploration de données. Elle présente l'Analyse Combinatoire de Données (ACD), une méthode d'exploration de données issue de l'optimisation discrète. Cette méthode est appliquée à des données médicales originales et une extension aux problèmes d'analyse de temps de survie est proposée. L'analyse de temps de survie consiste à modéliser le temps avant un événement (typiquement un décès ou une rechute). Les heuristiques proposées utilisent des techniques classiques de recherche opérationnelle telles que la programmation linéaire en nombres entiers, la décomposition de problème, des algorithmes gloutons. La seconde partie est plus théorique et s'intéresse à deux problèmes combinatoires rencontrés dans le domaine de l'exploration de données. Le premier est un problème de partitionnement de graphes en sous-graphes denses pour l'apprentissage non supervisé. Nous montrons la complexité algorithmique de ce problème et nous proposons un algorithme polynomial basé sur la programmation dynamique lorsque le graphe est un arbre. Cet algorithme repose sur des résultats de la théorie des couplages. Le second problème est une généralisation des problèmes de couverture par les tests pour la sélection d'attributs. Les lignes d'une matrice sont coloriées en deux couleurs. L'objectif est de trouver un sous-ensemble minimum de colonnes tel que toute paire de lignes avec des couleurs différentes restent distinctes lorsque la matrice est restreinte au sous-ensemble de colonnes. Nous montrons des résultats de complexité ainsi que des bornes serrées sur la taille des solutions optimales pour différentes structures de matrices. / This thesis focuses on some data mining problems with an operations research point of view. Data mining is the process of learning new knowledge from large datasets. The problems in this field are close to the ones encountered in operations research: Large instances, complex objectives and algorithmic difficulty. Moreover, learning knowledge from a dataset can be viewed as a particular optimization problem with a partially known objective function. This thesis is divided into two main parts. The first part starts with an introduction to data mining. Then it presents a specific method from the field of discrete optimization known as Logical Analysis of Data (LAD). In this part, an original medical application and an extension of LAD to survival analysis are presented. Survival analysis is the modeling of time to event (typically death or failure). The proposed heuristics are derived from classical operations research methods such as integer programming, problem decomposition and greedy algorithms. The second part is more theoretical and focuses on two combinatorial problems encountered while solving practical data mining problems. The first one is a problem of graph partition into dense subgraphs for unsupervised learning. We emphasize the algorithmic complexity of this problem, and give a polynomial algorithm based on dynamic programming when the graph is a tree. This algorithm relies on famous combinatorial optimization results in matching theory. The second problem is a generalization of test cover for feature selection. The rows of a binary matrix are bicolored. The objective is to find a minimum subset of columns such that any pair of rows with different colors are still distinct when the matrix is restricted to the subset of columns. We give complexity results and tight bounds on the size of the optimal solutions for various matrix structures.

Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Linguistics and Philosophy. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND HUMANITIES. / Vita. / Includes bibliographies. / Ph.D.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2016-03-17T14:31:15Z No. of bitstreams: 2 Dissertação - Paulo Júnio de Oliveira - 2015.pdf: 1566271 bytes, checksum: a8c1caa1354936dd420024e5bc704cb9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-03-17T14:33:55Z (GMT) No. of bitstreams: 2 Dissertação - Paulo Júnio de Oliveira - 2015.pdf: 1566271 bytes, checksum: a8c1caa1354936dd420024e5bc704cb9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2016-03-17T14:33:55Z (GMT). No. of bitstreams: 2 Dissertação - Paulo Júnio de Oliveira - 2015.pdf: 1566271 bytes, checksum: a8c1caa1354936dd420024e5bc704cb9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-11-10 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The aim of this dissertation is to discuss the problem of infinite divisibility of bodies, a problem which was already discussed in the classic period by Aristotle and his analysis of Zeno’s paradoxes. Our working hypothesis is that in the Tractatus-Logico-Philosophicus Wittgenstein has offered a reformulation of this very problem when he discusses the process of analysis of propositions. One of the central thesis in the Tractatus is that all ordinary proposition can be completely analyzed and that this process of analysis has to be finite. Based on that, we argue that it necessarily follows that the elements present in the state of affairs described by the proposition cannot be further divided since the analysis of the proposition which describes such a state is necessarily finite. / O objetivo deste trabalho é discutir o problema da divisibilidade infinita de “corpos”, um problema que era discutido já no período clássico por Aristóteles e sua análise dos paradoxos de Zenão. Nossa hipótese de trabalho é a de que no Tractatus-Logico-Philosophicus Wittgenstein teria apresentado uma possível reformulação desse problema ao tratar da análise de proposições. Uma das teses centrais no Tractatus é a de que toda a proposição tem uma análise lógica completa e esse processo de análise tem de ter um fim. Baseado nisso, nós argumentamos que segue-se necessariamente que os elementos presentes no estado de coisas descritos pela proposição não podem prosseguir sendo subdivididos, uma vez que o processo de análise da proposição que descreve tal estado de coisas é necessariamente finito.

É um resultado conhecido que em Data Grids, onde o processamento envolve grandes quantidades de dados, pode ser mais eficaz escalonar os processos para execução nos sites que já dispõem dos dados do que transferir os dados para um site onde o processo que irá necessitar deles foi escalonado. Os estudos existentes se baseiam em pequenas quantidades de sites, com conhecimento centralizado sobre o estado dos diversos sites. Essa opção não é escalável para Grids com grande número de participantes. Este trabalho analisa versões distribuídas com informação local para os algoritmos de escalonamento de processo e replicação de dados, mostrando o efeito das topologias de interconexão de sites no desempenho desses. É observado que, considerando a existência apenas de informações locais devido às restrições topologicas, resultados diferentes quanto aos melhores algoritmos de escalonamento de processos e replicação de dados são encontrados. / It is a known result that in Data Grids, where the processing involves large amounts of data, can be more effective schedule processes to run on sites that already have the data than transfering data to a site where the process that will require them was installed. The existing studies are based on small numbers of sites, with centralized knowledge about the state of the various sites. This option is not scalable for grids with large numbers of participants. This paper will propose distributed versions with local information for process scheduling algorithms and data replication, showing the effect of interconnect topologies on the performance of these sites. It is observed that, considering the existence of only local information due to topological constraints, different results related to the best scheduling algorithms and data replication processes are found.

A indústria de microeletrônica tem recorrido cada vez mais à metodologia de projeto baseado em células para fazer frente à crescente complexidade dos projetos de circuitos integrados digitais, uma vez que circuitos baseados em células são projetados mais rápida e economicamente que circuitos full-custom. Entretanto, apesar do progresso ocorrido na área de Electronic Design Automation, circuitos digitais baseados em células apresentam desempenho inferior ao de circuitos full-custom. Assim, torna-se interessante encontrar maneiras de se fazer com que circuitos baseados em células tenham desempenho próximo ao de circuitos full-custom, sem que isso implique elevação significativa nos custos do projeto. Com tal objetivo em vista, esta tese apresenta contribuições para um fluxo automático de otimização local para circuitos digitais baseados em células. Por otimização local se entende a otimização do circuito em pequenas janelas de contexto, onde são feitas otimizações considerando o contexto global. Deste modo, a otimização local pode incluir a detecção e isolamento de regiões críticas do circuito e a geração de redes lógicas e de redes de transistores de diferentes topologias que são dimensionadas de acordo com as restrições de projeto em questão. Como as otimizações locais atuam em um contexto reduzido, várias soluções podem ser obtidas considerando as restrições locais, entre as quais se escolhe a mais adequada para substituir o subcircuito (região crítica) original. A contribuição específica desta tese é o desenvolvimento de um método de dimensionamento de subcircuitos capaz de obter soluções com área ativa mínima, respeitando a capacitância máxima de entrada, a carga a ser acionada, e a restrição de atraso imposta. O método é baseado em uma formulação de logical effort, e a principal contribuição é calcular analiticamente a derivada da área para obter área mínima, ao invés de fazer a derivada do atraso para obter o atraso mínimo, como é feito na formulação tradicional do logical effort. Simulações elétricas mostram que o modelo proposto é muito preciso para uma abordagem de primeira ordem, uma vez que apresenta erros médios de 1,48% para dissipação de potência, 2,28% para atraso de propagação e 6,5% para os tamanhos dos transistores. / Microelectronics industry has been relying more and more upon cell-based design methodology to face the growing complexity in the design of digital integrated circuits, since cell-based integrated circuits are designed in a faster and cheaper way than fullcustom circuits. Nevertheless, in spite of the advancements in the field of Electronic Design Automation, cell-based digital integrated circuits show inferior performance when compared with full-custom circuits. Therefore, it is desirable to find ways to bring the performance of cell-based circuits closer to that of full-custom circuits without compromising the design costs of the former circuits. Bearing this goal in mind, this thesis presents contributions towards an automatic flow of local optimization for cellbased digital circuits. By local optimization, it is meant circuit optimization within small context windows, in which optimizations are done taking into account the global context. This way, local optimization may include the detection and isolation of critical regions of the circuit and the generation of logic and transistor networks; these networks are sized according to the existing design constraints. Since local optimizations act in a reduced context, several solutions may be obtained considering local constraints, out of which the fittest solution is chosen to replace the original subcircuit (critical region). The specific contribution of this thesis is the development of a subcircuit sizing method capable of obtaining minimum active area solutions, taking into account the maximum input capacitance, the output load to be driven, and the imposed delay constraint. The method is based on the logical effort formulation, and the main contribution is to compute the area derivative to obtain minimum area, instead of making the delay derivative to obtain minimum delay, as it is done in the traditional logical effort formulation. Electrical simulations show that the proposed method is very precise for a first order approach, as it presents average errors of 1.48% in power dissipation, 2.28% in propagation delay, and 6.5% in transistor sizes.

Em The Logical Syntax of Language (1937) R. Carnap elabora o seu Princípio de Tolerância Lógica. Trata-se de um princípio lógico-filosófico de grande alcance, que condensa as posições mais consistentes do autor acerca do significado filosófico da pesquisa em lógica formal. A despeito do fracasso do projeto geral de uma filosofia sintática, esse princípio permaneceu como base de todo o pensamento posterior de Carnap. Mais do que isso, influenciou boa parte do melhor trabalho realizado em lógica até hoje, tendo deixado marcas duradouras sobre a filosofia analítica. Neste trabalho, buscamos examinar a origem do Princípio de Tolerância no pensamento de Carnap, como melhor caminho para estabelecer seu significado e implicações. / In The Logical Syntax of Language (1937) R. Carnap develops his Principle of Tolerance in Logic. This is a far-reaching principle for the whole philosophy of logic, and which sums up Carnaps most consistent tenets concerning the philosophical meaning of research in formal logic. Despite the failure of the general project of a syntactical philosophy, the Principle of Tolerance remained the basis for the whole of Carnaps subsequent thought. Moreover, it proved influential in a good deal of the most important work done in logic to this day; it also left permanent traces in analytic philosophy. In this work, we aim at examining the origins of the Tolerance Principle in Carnaps thought, as the best way to establish its significance and implications.

The purpose of the study was to develop a revision of the logical reasoning section of the California Test of Mental Maturity which increases its discriminative ability while maintaining an acceptable measure of reliability. Subjects were 102 students of general psychology classes at North Texas State University. All were administered the Logical Reasoning section of the California Test of Mental Maturity in its original form and an experimental revision of it (LRTR). The Wesman Personnel Classification Test was administered at the same time to demonstrate the tests' construct validity. Pearson product-moment correlations, item and homogeneity analyses were run. Results indicated that the revised test correlated significantly with the original test and the WPCT. Internal validity of the revised test was satisfactory, showing an improvement over the original test in terms of clarity, reliability and homogeneity.

Ao realizar testes de hipóteses simultâneos espera-se que a decisões obtidas neles sejam logicamente consistentes entre si. Neste trabalho, verifica-se sob quais condições testes de Bayes simultâneos atendem às condições lógicas isoladamente ou em conjunto. Demonstra-se que as restrições para que os testes simultâneos atendam essas condições isoladamente são bastante intuitivas. No entanto, ao tentar obedecer as condições conjuntamente, perde-se otimalidade. Além disso, avalia-se a relação entre esses testes de Bayes simultâneos e os testes gerados por estimadores, isto é, mostra-se que, sob algumas condições, tomar uma decisão baseado em um estimador de Bayes é equivalente a tomar uma decisão baseada em um teste de Bayes. Por fim, mostra-se que, se tomamos uma decisão baseada em Estimadores de Máxima Verossimilhança, então essa decisão deve ser igual à tomada por um teste de Bayes e concluímos que essas decisões são admissíveis e obedecem ao Princípio da Verossimilhança. / When performing simultaneous hypotheses testing is expected that the decisions obtained therein are logically consistent with each other. In this work, we find restrictions under which simultaneous Bayes tests meet logical conditions separately or jointly. It is shown that the conditions for the simultaneous tests meet these conditions alone are quite intuitive. However, when trying to obey the conditions jointly, we lose optimality. Furthermore, we evaluate the relationship between these tests and simultaneous Bayes tests generated by estimators, ie, we show that, under some conditions, to choose an estimator based on Bayes decision is equivalent to choosing a decision based on a Bayes test. Finally, we show that if we take a decision based on Maximum Likelihood Estimators, then that decision should be equal to taking a Bayes test and concluded that these decisions are admissible and obey the Likelihood Principle.

There are historically three main trends in understanding Wittgenstein's Tractatus. The first is the interpretation offered by the Vienna Circle. They read Wittgenstein as arguing that neither metaphysical nor normative propositions have any cognitive meaning, and thus are to be considered nonsense. This interpretation understands Wittgenstein as setting the limits of sense, and prescribing that nothing of substantive philosophical importance lies beyond that line. The second way of reading the Tractatus, which has became popular since the 1950s, is the interpretation which most currently accept as the early Wittgenstein's view; for this reason I refer to it as the 'standard reading.' According to this interpretation, Wittgenstein did not consider metaphysical and ethical discourse as nonsense. Rather, relying upon the distinction between saying [sagen] and showing [zeigen], he meant that these truths cannot be uttered, but instead are only shown. The standard reading can perhaps be best understood in contrast with the third interpretation, dubbed the "resolute reading." The resolute reading takes seriously Wittgenstein's remark at 6.54 that "[m]y propositions are elucidatory in this way: he who understands me finally recognizes them as nonsense [unsinnig]." According to the resolute interpretation, Wittgenstein is not advancing a series of philosophical theses in the Tractatus. Rejecting the distinction characteristic of standard readings, between propositions without sense [sinnlos] and just plain nonsense [unsinnig], these interpreters read Wittgenstein as treating ethical and metaphysical inquiry, as well as a bulk of the doctrines in the text, as nonsense. To them, Wittgenstein did not intend to put forth any theses in the the text. Instead his methodology is therapeutic, similar to the later philosophy. It In this essay I explain each interpretation, and evaluate them in terms of textual and philosophical viability. I conclude by arguing that the biases which exist in the tradition of analytic philosophy substantively temper the interpretation of historical texts, which ultimately leads to the fundamental distinction between these three interpretations.