A Estratégia Saúde da Família (ESF) nem sempre contempla a integralidade, apesar deste ser um princípio estruturante do Sistema Único de Saúde (SUS), nas definições da Organização Mundial de Saúde (OMS) e da legislação brasileira que ampliam o conceito de saúde, atribuindo ao processo saúde/doença as influências das determinações sociais. As profissões da saúde ainda funcionam com abordagem reducionista. Infelizmente, conceitos, definições e legislação não são suficientes para conscientizar e tão pouco transformar as práticas de saúde. Esse trabalho propõe a elaboração de um questionário anamnetico ampliado focada em pacientes poliqueixosos, baseada na teoria de Fernando González Rey o que significa trabalhar com o enfoque histórico-cultural e subjetividade, portanto mais humanizado, a fim de experimentar outros modos de intervir no processo saúde/doença e romper sua abordagem fragmentada positivista visando contribuir para uma melhora na relação profissional/usuário na ESF. Para testar a efetividade do questionário, foi realizado um piloto que indicou ser importante para se alcançar os objetivos esperados, a necessidade da capacitação da equipe e a alteração nos processos de trabalho encontrados atualmente na ESF. / The Family Health Strategy (FHS) does not always include comprehensiveness, although this is a structuring principle of the Unified Health System (SUS), the definitions of the World Health Organization (WHO) and the Brazilian law that expand the concept of health, assigning the health / disease process influences the social determinants. The health professions still work with reductionist approach. Unfortunately, concepts, definitions and laws are not enough to raise awareness and so little change health practices. This paper proposes development of an expanded Anamnesis questionnaire focused on many complaints patients, based on Fernando González Rey theory which means working with the historical-cultural approach and subjectivity therefore more human, in order to experience other ways of intervening in the health / disease and break its positivist piecemeal approach to contribute to an improvement in the professional / user in the FHS. To test the effectiveness of the questionnaire, a pilot test was performed which indicated it is important to train the staff in order to achieve the expected goals, as well as a transformation in the work processes found in the FHS.

This study focuses on virtual services and more particularly on the usage of chat services to provide a formal evidence of the status of one particular chat reference service. It explores the efficiency of the chat service model at Umeå University Library for the period August 2015 to February 2016 and covers a total of 221 virtual chat transactions. It uses content analysis and a process model of chat-based reference to bring comprehension of the content for both inquiries and replies to understand the usage of this service and discern trends and discrepancies. The results show that September and February have the highest amount of questions due to the distribution of the academic year. Furthermore, the requests appeared to be spread evenly over the distinguished categories with a slightly lower number of research related questions which reflect the difficulty to perform a reference interview in the virtual context. The study uncovered that the types of inquiries affect the level of completeness and consequently questions requiring general knowledge of the library are more successfully answered than more specific questions. The referrals are connected to the knowledge area of the librarian answering the chat and remain internal. Those results can be easily improved through skill development programs but librarian evaporation remains a predominant issue that should be addressed. Despite the circumstantial attendance of the chat, the chat service appears to be a valid alternative to the information desk and the library management should improve the chat efficacy by involving more competences.

Cette thèse adresse les problèmes d'universalité et de complétude computationelle pour plusieurs modèles de calcul inspirés par la biologie. Il s'agit principalement des systèmes d'insertion/effacement, réseaux de processeurs évolutionnaires, ainsi que des systèmes de réécriture de multi-ensembles. Les résultats décrits se classent dans deux catégories majeures : l'étude de la puissance de calcul des opérations d'insertion et d'effacement avec ou sans mécanismes de contrôle, et la construction des systèmes de réécriture de multi-ensembles universels de petite taille. Les opérations d'insertion et d'effacement consistent à rajouter ou supprimer une sous-chaîne dans une chaîne de caractères dans un contexte donné. La motivation pour l'étude de ces opérations vient de la biologie, ainsi que de la linguistique et de la théorie des langages formels. Dans la première partie de ce manuscrit nous examinons des systèmes d'insertion/effacement correspondant à l'édition de l'ARN, un processus qui insère ou supprime des fragments de ces molécules. Une particularité importante de l'édition de l'ARN est que le endroit auquel se font les modifications est déterminé par des séquences de nucléotides se trouvant toujours du même côté du site de modification. En termes d'insertion et d'effacement, ce phénomène se modéliserait par des règles possédant le contexte uniquement d'un seul côté. Nous montrons qu'avec un contexte gauche de deux caractères il est possible d'engendrer tous les langages rationnels. D'autre part, nous prouvons que des contextes plus longs n'augmentent pas la puissance de calcul du modèle. Nous examinons aussi les systèmes d’insertion/effacement utilisant des mécanismes de contrôle d’application des règles et nous montrons l'augmentation de la puissance d'expression. Les opérations d'insertion et d'effacement apparaissent naturellement dans le domaine de la sécurité informatique. Comme exemple on peut donner le modèle des grammaires gauchistes (leftist grammar), qui ont été introduites pour l'étude des systèmes critiques. Dans cette thèse nous proposons un nouvel instrument graphique d'analyse du comportement dynamique de ces grammaires. La deuxième partie du manuscrit s'intéresse au problème d'universalité qui consiste à trouver un élément concret capable de simuler le travail de n'importe quel autre dispositif de calcul. Nous commençons par le modèle de réseaux de processeurs évolutionnaires, qui abstrait le traitement de l'information génétique. Nous construisons des réseaux universels ayant un petit nombre de règles. Nous nous concentrons ensuite sur les systèmes de réécriture des multi-ensembles, un modèle qui peut être vu comme une abstraction des réactions biochimiques. Pour des raisons historiques, nous formulons nos résultats en termes de réseaux de Petri. Nous construisons des réseaux de Petri universels et décrivons des techniques de réduction du nombre de places, de transitions et d'arcs inhibiteurs, ainsi que du degré maximal des transitions. Une bonne partie de ces techniques repose sur une généralisation des machines à registres introduite dans cette thèse et qui permet d'effectuer plusieurs tests et opérations en un seul changement d'état / The present thesis considers the problems of computational completeness and universality for several biologically-inspired models of computation: insertion-deletion systems, networks of evolutionary processors, and multiset rewriting systems. The presented results fall into two major categories: study of expressive power of the operations of insertion and deletion with and without control, and construction of universal multiset rewriting systems of low descriptional complexity. Insertion and deletion operations consist in adding or removing a subword from a given string if this subword is surrounded by some given contexts. The motivation for studying these operations comes from biology, as well as from linguistics and the theory of formal languages. In the first part of the present work we focus on insertion-deletion systems closely related to RNA editing, which essentially consists in inserting or deleting fragments of RNA molecules. An important feature of RNA editing is the fact that the locus the operations are carried at is determined by certain sequences of nucleotides, which are always situated to the same side of the editing site. In terms of formal insertion and deletion, this phenomenon is modelled by rules which can only check their context on one side and not on the other. We show that allowing one-symbol insertion and deletion rules to check a two-symbol left context enables them to generate all regular languages. Moreover, we prove that allowing longer insertion and deletion contexts does not increase the computational power. We further consider insertion-deletion systems with additional control over rule applications and show that the computational completeness can be achieved by systems with very small rules. The motivation for studying insertion-deletion systems also comes from the domain of computer security, for the purposes of which a special kind of insertion-deletion systems called leftist grammars was introduced. In this work we propose a novel graphical instrument for visual analysis of the dynamics of such systems. The second part of the present thesis is concerned with the universality problem, which consists in finding a fixed element able to simulate the work any other computing device. We start by considering networks of evolutionary processors (NEPs), a computational model inspired by the way genetic information is processed in the living cell, and construct universal NEPs with very few rules. We then focus on multiset rewriting systems, which model the chemical processes running in the biological cell. For historical reasons, we formulate our results in terms of Petri nets. We construct a series of universal Petri nets and give several techniques for reducing the numbers of places, transitions, inhibitor arcs, and the maximal transition degree. Some of these techniques rely on a generalisation of conventional register machines, proposed in this thesis, which allows multiple register checks and operations to be performed in a single state transition

Software developers adapt to the fast-moving nature of software systems with agile development techniques. However, database developers lack the tools and concepts to keep pace. Data, already existing in a running product, needs to be evolved accordingly, usually by manually written SQL scripts. A promising approach in database research is to use a declarative database evolution language, which couples both schema and data evolution into intuitive operations. Existing database evolution languages focus on usability but did not aim for completeness. However, this is an inevitable prerequisite for reasonable database evolution to avoid complex and error-prone workarounds. We argue that relational completeness is the feasible expressiveness for a database evolution language. Building upon an existing language, we introduce CoDEL. We define its semantic using relational algebra, propose a syntax, and show its relational completeness.

京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第18041号 / 理博第3919号 / 新制||理||1566(附属図書館) / 30899 / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)准教授 西村 進, 教授 加藤 毅, 教授 長谷川 真人 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DGAM

Using the concepts of the institutional completeness of ethnic communities (Breton, 1964) and the gay male community (Lee, 1979) and more recently, 'deviant' organizational sophistication (Best and Luckenbill, 1982), this thesis examines the gay world argue that traditional concepts, in solitude or synthesis, cannot wholly illuminate the phenomenon of modern gay evolutionary development. Notions of subculture and community are inadequate tools by which to describe the complexity and cultural materials of a contemporary and emergent ethnographic unit of analysis: the gay world. Documentary and archival research, personal correspondence and in depth participant-observation have produced an array of historical and cultural materials and analyses of gay iconography, stereotypes, bars, and gay media. Structural features such as the politicization of homosexuality (the shift from rights lobbying to political and legal litigation) the politics of gender and AIDS, emergent age structures and the paradox of capitalist enterprise and liberation have also been examined. It is hypothesized that local gay communities (towns, cities, provinces, states and territories) do not themselves wholly depict this gay world. Rather, the communities and milieux are bound as the links of a chain, through often invisible networks of gay information, publishing, support services, recreation, leisure, unique artifacts and cultural materials. Many of these links exist world wide, traversing international customs, languages, traditions, legal systems, and concrete borders. These links show both variegation and similarity but most are based upon a unique fusion and specific unity, forged by a common prism of homosexual and gay oppression, identity, cu1ture, ideology, and more recently, a still emerging sense of gay identity. / Thesis / Master of Arts (MA)

No description available.

No description available.

A Theory of Algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be difficult material to teach or to learn. In particular the topics of Computational Complexity Theory, reductions, and the NP-Complete class of problems are considered difficult by students. Numerous algorithm visualizations (AVs) have been developed over the years to portray the dynamic nature of known algorithms commonly taught in undergraduate classes. However, to the best of our knowledge, the instructional material available for NP-Completeness is mostly static and textual, which does little to alleviate the complexity of the topic. Our aim is to improve the pedagogy of NP-Completeness by providing intuitive, interactive, and easy-to-understand visualizations for standard NP Complete problems, reductions, and proofs. In this thesis, we present a set of visualizations that we developed using the OpenDSA framework for certain NP-Complete problems. Our paradigm is a three step process. We first use an AV to illustrate a particular NP-Complete problem. Then we present an exercise to provide a first-hand experience with attempting to solve a problem instance. Finally, we present a visualization of a reduction as a part of the proof for NP-Completeness. Our work has been delivered as a collection of modules in OpenDSA, an interactive eTextbook system developed at Virginia Tech. The tutorial has been introduced as a teaching supplement in both a senior undergraduate and a graduate class. We present an analysis of the system use based on records of online interactions by students who used the tutorial. We also present results from a survey of the students. / Master of Science

Les schématisations de termes permettent de représenter des ensembles infinis de termes ayant une structure similaire de manière finie et compacte. Dans ce travail, nous étudions certains aspects liés à l'utilisation des schématisations de termes en déduction automatique, plus particulièrement dans les méthodes de démonstration de théorèmes du premier ordre par saturation. Après une brève étude comparée des formalismes de schématisation existants, nous nous concentrons plus particulièrement sur les termes avec exposants entiers (ou I-termes). Dans un premier temps, nous proposons une nouvelle approche permettant de détecter automatiquement des régularités dans les espaces de recherche. Cette détection des régularités peut avoir plusieurs applications, notamment la découverte de lemmes nécessaires à la terminaison dans certaines preuves inductives. Nous présentons DS3, un outil qui implémente ces idées. Nous comparons notre approche avec d'autres techniques de généralisation de termes. Notre approche diffère complètement des techniques existantes car d'une part, elle est complètement indépendante de la procédure de preuve utilisée et d'autre part, elle utilise des techniques de généralisation inductive et non déductives. Nous discutons également les avantages et les inconvénients liés à l'utilisation de notre méthode et donnons des éléments informels de comparaison avec les approches existantes. Nous nous intéressons ensuite aux aspects théoriques de l'utilisation des I-termes en démonstration automatique. Nous démontrons que l'extension aux I-termes du calcul de résolution ordonnée est réfutationnellement complète, que l'extension du calcul de superposition n'est pas réfutationnellement complète et nous proposons une nouvelle règle d'inférence pour restaurer la complétude réfutationnelle. Nous proposons ensuite un algorithme d'indexation (pour une sous-classe) des I-termes, utile pour le traitement des règles de simplification et d'élimination de la redondance. Finalement nous présentons DEI, un démonstrateur automatique de théorèmes capable de gérer directement des formules contenant des I-termes. Nous évaluons les performances de ce logiciel sur un ensemble de benchmarks. / Term schematisations allow one to represent infinite sets of terms having a similar structure by a finite and compact form. In this work we study some issues related to the use of term schematisation in automated deduction, in particular in saturation-based first-order theorem proving. After a brief comparative study of existing schematisation formalisms, we focus on terms with integer exponents (or I-terms). We first propose a new approach allowing to automatically detect regularities (obviously not always) on search spaces. This is motivated by our aim at extending current theorem provers with qualitative improvements. For instance, detecting regularities permits to discover lemmata which is mandatory for terminating in some kinds of inductive proofs. We present DS3, a tool which implements these ideas. Our approach departs from existing techniques since on one hand it is completely independent of the proof procedure used and on the other hand it uses inductive generalization techniques instead of deductive ones. We discuss advantages and disadvantages of our method and we give some informal elements of comparison with similar approaches. Next we tackle some theoretical aspects of the use of I-terms in automated deduction. We prove that the direct extension of the ordered resolution calculus is refutationally complete. We provide an example showing that a direct extension of the superposition calculus is not refutationally complete and we propose a new inference rule to restore refutational completeness. We then propose an indexing algorithm for (a subclass of) I-terms. This algorithm is an extension of the perfect discrimination trees that are are employed by many efficient theorem provers to implement redundancy elimination rules. Finally we present DEI, a theorem prover with built-in capabilities to handle formulae containing I-terms. This theorem-prover is an extension of the E-prover developed by S. Schulz. We evaluate the performances of this software on a set of benchmarks.