Dans la nature existent de nombreux exemples de systèmes dynamiques complexes: systèmes neuronaux, communautés, écosystèmes, réseaux de régulation génétiques, etc. Ces derniers, en particulier, sont de notre intérêt et sont souvent modélisés par des réseaux booléens. Un réseau booléenne peut être considérée comme un digraphe, où les sommets correspondent à des gènes ou de produits de gènes, tandis que les arcs indiquent les interactions entre eux. Une niveau d'expression des gènes est modélisé par des valeurs binaires, 0 ou 1, indiquant deux états de la transcription, soit activité, soit inactivité, respectivement, et ce niveau change dans le temps selon certains fonction locaux d'activation qui dépend des états d'un ensemble de nœuds (les gènes). L'effet conjoint des fonctions d'activation locale définit une fonction de transition globale: ainsi, le autre élément nécessaire dans la description du modèle est fonction de mise à jour, qui détermine quand chaque nœud doit être mis à jour, et donc, comme les fonctions local se combinent dans une fonction globale (en d'autres termes, il doit décrire les temps relative de les activités régulatoires). Comme un réseau booléen avec n sommets a 2 ^ n états globaux, à partir d'un état ​​de départ, et dans un nombre fini de mises à jour, le réseau atteindra un fixe point ou un cycle limite, appelée attracteurs qui sont souvent associées à des phénotypes distincts (états-cellulaire) définis par les patrons d'activité des gènes. Un réseau de régulation Booléenne (REBN) est un réseau Booléen où chaque interaction entre les éléments de la réseau correspond soit à une interaction positif ou d'une interaction négative. Ainsi, le digraphe interaction associée à une REBN est un digraphe signé où un circuit est appelé positif (négatif) si le nombre de ses arcs négative est pair (impair). Dans ce contexte, il y a diverses études sur l'importance du les circuits positif et négatifs dans le comportement dynamique de différents systèmes en Biologie. En effet le point de départ de cette thèse est basée sur un résultat en disant que le nombre maximal de points fixes d'une REBN dépend d'un ensemble de cardinalité minimale qu'intersecte tous les cycles positifs (également dénommés positive feedback vertex set) du digraphe signé associé. D'autre part, un autre aspect important de circuits est leur rôle dans la robustesse des réseaux booléens par rapport différents types de mise à jour déterministe. Dans ce contexte, un élément clé mathématique est le update digraphe qui est un digraphe étiqueté associé à la réseau dont les étiquettes sur les arcs sont définies comme suit: un arc (u,v) est dit être positif si l'état de sommet u est mis à jour en même temps ou après que celle de v, et négative sinon. Ainsi, un cycle dans le digraphe étiqueté est dite positive (négative) si tous ses arcs sont positifs (négatifs). Cela laisse en évidence que parler de "positif" et "négatif" a des significations différentes selon le contex: digraphes signé ou digraphes étiquetés. Ainsi, nous allons voir dans cette thèse, les relations entre les feedback sets et la dynamique des réseaux Booléens à travers l'étude analytique de ces deux fondamentaux objets mathématiques: le digraphe (de connexion) signé et l'update digraphe. / In the nature there exist numerous examples of complex dynamical systems: neural systems, communities, ecosystems, genetic regulatory networks, etc. These latest, in particular are of our interest and are often modeled by Boolean networks. A Boolean network can be viewed as a digraph, where the vertices correspond to genes or gene products, while the arcs denote interactions among them. A gene expression level is modeled by binary values, 0 or 1, indicating two transcriptional states, either active or inactive, respectively, and this level changes in time according to some local activation function which depends on the states of a set of nodes (genes). The joint effect of the local activation functions defines a global transition function; thus, the other element required in the description of the model is an update schedule which determines when each node has to be updated, and hence, how the local functions combine into the global one (in other words, it must describe the relative timings of the regulatory activities). Since a Boolean network with n vertices has 2^n global states, from a starting state, within a finite number of udpates, the network will reach a fixed point or a limit cycle, called attractors that are often associated to distinct phenotypes (cellular states) defined by patterns of gene activity. A regulatory Boolean network (REBN) is a Boolean network where each interaction between the elements of the network corresponds either to a positive or to a negative interaction. Thus, the interaction digraph associated to a REBN is a signed digraph where a circuit is called positive (negative) if the number of its negative arcs is even (odd). In this context, there are diverse studies about the importance of the positive and negative circuits in the dynamical behavior of different systems in Biology. Indeed the starting point of this Thesis is based on a result saying that the maximum number of fixed points of a REBN depends on a minimum cardinality vertex set whose elements intersects to all the positive cycles (also named a positive feedback vertex set) of the associated signed digraph. On the other hand, another important aspect of circuits is their role in the robustness of Boolean networks with respect to different deterministic update schedules. In this context a key mathematical element is the update digraph which is a labeled digraph associated to the network and whose labels on the arcs are defined as follows: an arc (u,v) is said to be positive if the state of vertex u is updated at the same time or after than that of v, and negative otherwise. Hence, a cycle in the labeled digraph is called positive (negative) if all its arcs are positive (negative). This leaves in evidence that talk of "positive" and "negative" has different meanings depending on the contex: signed digraphs or labeled digraphs. Thus, we will see in this thesis, relationships between feedback sets and the dynamics of Boolean networks through the analytical study of these two fundamental mathematical objects: the signed (connection) digraph and the update digraph.

In radar target tracking problems, it may be required to use adaptive update rate in order to maintain the tracking accuracy while allowing the radar to use its resources economically at the same time. This is generally the case if the target trajectory has maneuvering segments and in such a case the use of adaptive update time interval algorithms for estimation of the target state may enhance the tracking accuracy. Conventionally, fixed track update time interval is used in radar target tracking due to the traditional nature of mechanically steerable radars. In this thesis, as an application to phased array radar, the adaptive update rate algorithm approach developed in literature for Alpha-Beta filter is extended to Kalman filter. A survey over relevant adaptive update rate algorithms used previously in literature on radar target tracking is presented including aspects related to the flexibility of these algorithms for the tracking filter. The investigation of the adaptive update rate algorithms is carried out for the Kalman filter for the single target tracking problem where the target has a 90&deg / maneuvering segment in its trajectory. In this trajectory, the starting and final time instants of the single maneuver are specified clearly, which is important in the assessment of the algorithm performances. The effects of incorporating the variable update time interval into target tracking problem are presented and compared for several different test cases.

La mise à jour dynamique des programmes consiste en la modification de ceux-ci sans en arrêter l'exécution. Cette caractéristique est primordiale pour les applications critiques en continuelles évolutions et nécessitant une haute disponibilité. Le but de notre travail est d'effectuer la vérification formelle de la correction de la mise à jour dynamique d'applications Java Card à travers l'étude du système EmbedDSU. Pour ce faire, nous avons premièrement établi la correction de la mise à jour du code en définissant une sémantique formelle des opérations de mise à jour sur le code intermédiaire Java Card en vue d'établir la sûreté de typage des mises à jour. Nous avons ensuite proposé une approche pour vérifier la sémantique du code mis à jour à travers la définition d'une transformation de prédicats. Nous nous sommes ensuite intéressés à la vérification de la correction concernant la détection de points sûrs de la mise à jour. Nous avons utilisé la vérification de modèles. Cette vérification nous a permis de corriger d'abord un problème d'inter blocage dans le système avant d'établir d'autres propriétés de correction : la sûreté d'activation et la garantie de mise à jour. La mise à jour des données est effectuée à travers les fonctions de transfert d'état. Pour cet aspect, nous avons proposé une solution permettant d'appliquer les fonctions de transfert d’état tout en préservant la consistance du tas de la machine virtuelle Java Card et en permettant une forte expressivité dans leurs écritures. / Dynamic Software Updating (DSU) consists in updating running programs on the fly without any downtime. This feature is interesting in critical applications that are in continual evolution and that require high availability. The aim of our work is to perform formal verification the correctness of dynamic software updating in Java Card applications by studying the system EmbedDSU. To do so, we first established the correctness of code update. We achieved this by defining formal semantics for update operations on java Card bytecode in order to ensure type safety. Then, we proposed an approach to verify the semantics of updated programs by defining a predicate transformation. Afterward, we were interested in the verification of correction concerning the safe update point detection. We used model checking. This verification allowed us first to fix a deadlock situation in the system and then to establish other correctness properties: activeness safety and updatability. Data update is performed through the application of state transfer functions. For this aspect, we proposed a solution to apply state transfer functions with the preservation of the Java Card virtual machine heap consistency and by allowing a high expressiveness when writing state transfer functions.

NASCIMENTO, Raimundo Cezar Campos do. Atualização das bibliografias básicas dos cursos da área da saúde: o caso da Biblioteca de Ciências da Saúde. 2009. 140 f. Dissertação (Mestrado em Políticas Públicas e Gestão da Educação Superior) – Universidade Federal do Ceará, Programa de Pós-Graduação em Políticas Públicas e Gestão da Educação Superior, Fortaleza-CE, 2009. / Submitted by moises gomes (celtinha_malvado@hotmail.com) on 2012-06-22T13:17:18Z No. of bitstreams: 1 2009_dis_RCCNascimento.pdf: 1928381 bytes, checksum: 31cce07bcbc1078dfbd866220266b4c8 (MD5) / Approved for entry into archive by Maria Josineide Góis(josineide@ufc.br) on 2012-06-25T11:13:27Z (GMT) No. of bitstreams: 1 2009_dis_RCCNascimento.pdf: 1928381 bytes, checksum: 31cce07bcbc1078dfbd866220266b4c8 (MD5) / Made available in DSpace on 2012-06-25T11:13:27Z (GMT). No. of bitstreams: 1 2009_dis_RCCNascimento.pdf: 1928381 bytes, checksum: 31cce07bcbc1078dfbd866220266b4c8 (MD5) Previous issue date: 2009 / This research deals with the mechanisms of update of basic bibliographies in specific way of the update them basic bibliographies them courses of graduation of the area of the health taken care of by the Biblioteca de Ciências da Saúde da Universidade Federal do Ceará. It is objective generality of the research to understand the politics of update of the quantity of the Biblioteca de Ciências da Saúde da Universidade (BCS) of the Universidade Federal do Ceará (UFC) and more specifically to consider one politics of cooperation between on library and professors to the courses taken care of for it the courses of Medicine, Odontology, Nursing and Pharmacy. It was broken of the estimated one that it is not having update of basic bibliographies of the courses of graduation leaving of suggestions of the professors you discipline of them on to the courses and yes of preexisting lists, therefore outdated proceeding from the coordinations of the courses. How much to the objectives and the used technique it was opted to the case study. The sample of 264 pupils was selected statistical amongst the population of 2237 pupils registered the first semester of the year of 2009 in the courses of Medicine, Odontology, Nursing and Pharmacy, distributed proportionally enters the four courses taken care of for the BCS. Amongst the joined results we have that if it makes necessary the participation accomplishes of the library in the process of update of basic bibliographies of the graduation courses. / Esta pesquisa trata dos mecanismos de atualização das bibliografias básicas, de maneira específica da atualização das bibliografias básicas dos cursos de graduação da área da saúde atendidos pela Biblioteca de Ciências da Saúde da Universidade Federal do Ceará. É objetivo geral da pesquisa compreender a política de atualização do acervo da Biblioteca de Ciências da Saúde (BCS) da Universidade Federal do Ceará (UFC) e propor uma política de cooperação entre a biblioteca e os docentes ligados aos cursos atendidos por ela, mais especificamente os cursos de Medicina, Odontologia, Enfermagem e Farmácia. Pressupôs-se que não está havendo atualização das bibliografias básicas dos cursos de graduação a partir de sugestões dos professores das disciplinas ligadas aos cursos e sim de listas pré-existentes, por isso desatualizadas, provenientes das coordenações dos cursos. Quanto aos objetivos e a técnica utilizada optou-se pelo estudo de caso. A amostra, aleatória, de 264 alunos foi selecionada estatisticamente dentre a população de 2237 alunos matriculados no primeiro semestre do ano de 2009 nos cursos de Medicina, Odontologia, Enfermagem e Farmácia. Trata, a amostra, de alunos distribuídos proporcionalmente entre os quatro cursos atendidos pela BCS. Dentre os resultados encontrados temos que se faz necessária a participação efetiva da biblioteca no processo de atualização das bibliografias básicas dos cursos de graduação.

nÃo hà / Nosso principal objetivo neste estudo à investigar o papel da heterogeneidade na atualizaÃÃo, depois de um choque de informaÃÃo, do risco subjetivo sobre vitimizaÃÃo de homicÃdio. Nesse sentido, os dados utilizados neste trabalho tambÃm atestam a superestimaÃÃo do crime encontrada na literatura. A novidade à que os entrevistados receberam um choque de informaÃÃo que consiste na taxa oficial de homicÃdios, mas a grande maioria deles mantÃm a mesma percepÃÃo inicial. Ao propor um modelo de Update Bayesiano permitindo que nenhuma atualizaÃÃo fosse realizada, dois modelos foram desenvolvidos: um Tobit modificado e um modelo Hurdle de dois nÃveis. Assim como em estudos anteriores, nossos resultados mostraram que poderÃamos prosseguir com uma abordagem de Update Bayesiano. Ainda, quanto mais altas as respostas iniciais eram definidas, mais propensos os indivÃduos estavam em proceder uma mudanÃa de percepÃÃo. AlÃm disso, fundamentalmente, pudemos racionalizar a decisÃo de nÃo revisar as respostas seguindo um argumento de qualidade/credibilidade da informaÃÃo percebida. Descobrimos que os participantes mais velhos e as mulheres sÃo mais relutantes nÃo apenas em alterar as respostas iniciais, mas tambÃm na escolha do nÃvel da nova resposta, em caso de mudanÃa. Outra conclusÃo feita foi que o nÃvel educacional dos entrevistados era insignificante em nosso exercÃcio. De fato, o nÃvel educacional do entrevistador teve um papel fundamental em ambas decisÃes de mudanÃa e magnitude de revisÃo. Finalmente, nossos resultados tambÃm levantaram fortes evidÃncias sobre aspectos de homofilia. A ocorrÃncia de uma correspondÃncia em gÃnero entre entrevistadores e entrevistados teve o maior impacto sobre a decisÃo de mudar e na magnitude da atualizaÃÃo neste estudo. / Our main purpose in this study is to investigate the role of heterogeneity into the update of subjective homicide victimization risk after an informational shock. In this sense, the data used here also attests the crime overestimation found in the literature. The novelty is that our respondents faced an informational shock consisting in the official homicide rate, but the vast majority of them keeps the same initial perception. In proposing a Bayesian Update model allowing that no update takes place, two models were developed: a modified Tobit and a two-tiered Hurdle model. In accordance with previous papers, our results showed that we could proceed with a Bayesian Update approach. Also, the higher initial responses are set, more likely individuals are in proceeding a change in perceptions. Furthermore, fundamentally, we could rationalize a non-updating decision following a perceived informational quality/credibility argument. We found that older participants and females are more reluctant not only to change initial responses, but also to choose the level of the new response, in case of an update. In addition, respondentsâ level of education was insignificant in our exercise. In fact, interviewersâ level of education had a key role in both the changing and updating magnitude decisions. Finally, our results also raised strong evidence on homophily aspects. The occurance of a matching in gender between interviewers and interviewees had a major impact on the decision to change and in the magnitude of the update in this study.

nÃo hà / Esta pesquisa trata dos mecanismos de atualizaÃÃo das bibliografias bÃsicas, de maneira especÃfica da atualizaÃÃo das bibliografias bÃsicas dos cursos de graduaÃÃo da Ãrea da saÃde atendidos pela Biblioteca de CiÃncias da SaÃde da Universidade Federal do CearÃ. à objetivo geral da pesquisa compreender a polÃtica de atualizaÃÃo do acervo da Biblioteca de CiÃncias da SaÃde (BCS) da Universidade Federal do Cearà (UFC) e propor uma polÃtica de cooperaÃÃo entre a biblioteca e os docentes ligados aos cursos atendidos por ela, mais especificamente os cursos de Medicina, Odontologia, Enfermagem e FarmÃcia. PressupÃs-se que nÃo està havendo atualizaÃÃo das bibliografias bÃsicas dos cursos de graduaÃÃo a partir de sugestÃes dos professores das disciplinas ligadas aos cursos e sim de listas prÃ-existentes, por isso desatualizadas, provenientes das coordenaÃÃes dos cursos. Quanto aos objetivos e a tÃcnica utilizada optou-se pelo estudo de caso. A amostra, aleatÃria, de 264 alunos foi selecionada estatisticamente dentre a populaÃÃo de 2237 alunos matriculados no primeiro semestre do ano de 2009 nos cursos de Medicina, Odontologia, Enfermagem e FarmÃcia. Trata, a amostra, de alunos distribuÃdos proporcionalmente entre os quatro cursos atendidos pela BCS. Dentre os resultados encontrados temos que se faz necessÃria a participaÃÃo efetiva da biblioteca no processo de atualizaÃÃo das bibliografias bÃsicas dos cursos de graduaÃÃo. / This research deals with the mechanisms of update of basic bibliographies in specific way of the update them basic bibliographies them courses of graduation of the area of the health taken care of by the Biblioteca de CiÃncias da SaÃde da Universidade Federal do CearÃ. It is objective generality of the research to understand the politics of update of the quantity of the Biblioteca de CiÃncias da SaÃde da Universidade (BCS) of the Universidade Federal do Cearà (UFC) and more specifically to consider one politics of cooperation between on library and professors to the courses taken care of for it the courses of Medicine, Odontology, Nursing and Pharmacy. It was broken of the estimated one that it is not having update of basic bibliographies of the courses of graduation leaving of suggestions of the professors you discipline of them on to the courses and yes of preexisting lists, therefore outdated proceeding from the coordinations of the courses. How much to the objectives and the used technique it was opted to the case study. The sample of 264 pupils was selected statistical amongst the population of 2237 pupils registered the first semester of the year of 2009 in the courses of Medicine, Odontology, Nursing and Pharmacy, distributed proportionally enters the four courses taken care of for the BCS. Amongst the joined results we have that if it makes necessary the participation accomplishes of the library in the process of update of basic bibliographies of the graduation courses.

Large scale IoT service deployments run on a high number of distributed, interconnected computing nodes comprising sensors, actuators, gateways and cloud infrastructure. Since IoT is a fast growing, dynamic domain, the implementation of software components are subject to frequent changes addressing bug fixes, quality insurance or changed requirements. To ensure the continuous monitoring and control of processes, software updates have to be conducted while the nodes are operating without losing any sensed data or actuator instructions. Current IoT solutions usually support the centralized management and automated deployment of updates but are restricted to broadcasting the updates and local update processes at all nodes. In this paper we propose an update mechanism for IoT deployments that considers dependencies between services across multiple nodes involved in a common service and supports a coordinated update of component instances on distributed nodes. We rely on LyRT on all IoT nodes as the runtime supporting local disruption-minimal software updates. Our proposed middleware layer coordinates updates on a set of distributed nodes. We evaluated our approach using a demand response scenario from the smart grid domain.

Indoor Positional Navigation (IPN) systems can be used to track the position of tools in factories which is crucial for quality assurance in many manufacturing industries. Inertial navigation is rarely used on its own because of the noisy Inertial Measurement Unit (IMU) sensors which contribute to large drift. Current IPN systems usually involve the installation and calibration of cameras or antennas, so achieving sufficient accuracy with inertial navigation based IPN would be very desirable. This project aims to evaluate an inertial navigation algorithm, based on Zero Velocity Update (ZUPT), for bolt level positioning by repeatability tests using an industrial robot. The ZUPT algorithm, developed at Atlas Copco, manages to effectively reduce drift and achieve moderate accuracy in position for simpler movements. The gravity tracking Kalman filter dictates the systematic errors in position that grow large with increased degree and dimension of rotation. When keeping rotations within 45◦ for a linear movement the absolute error in position is under 10%. Frequent stops are important when moving in a more complex trajectory to be able to negate drift, consequently detecting the start and stop of motion is crucial. The results show that increased frequency will improve accuracy. It is shown that averaging IMU samples before calculations can increase both truthfulness and precision by 10−25%, if sampling the IMU faster than the calculations. The ZUPT approach of inertial navigation will never yield positional results in real time, and the evaluated algorithm only performs well within certain limitations, mainly frequent stops and simple movements. Despite these limitations there is potential in using the algorithm for quality assurance purposes in hand held industrial fasteners. / Kvalitetssäkring är en central fråga för många tillverkningsindustrier, så som flygplans- och bilindustrin, där det är avgörande att varje förband har dragits åt på rätt sätt för att garantera säkerheten i produkten. Moderna fabriker har centrala styrsystem som kommunicerar med maskiner och verktyg, och ifall något blir fel är det vanligt att fabrikslinan stannar vilket blir kostsamt. Inomhuspositionering (IPS) av hög noggrannhet kan spåra vilken åtdragning som blivit fel, vilket dokumenteras och åtgärdas om möjligt senare, utan att stanna fabrikslinan. Dagens noggranna IPS system för kvalitetssäkring kräver installation och kalibrering av kameror och/eller antenner. Tröghetsnavigering kräver i grunden bara billiga sensorer installerade på verktyget men metoden är mycket opålitlig på grund av sensorernas opålitlighet och brus. I detta projekt har en metod för tröghetsnavigering, användandes Zero Velocity Update (ZUPT), evaluerats för kvalitetssäkring av handhållna verktyg genom repetabilitetstester. Tröghetsnavigeringsalgoritmen som tidigare utvecklats på Atlas Copco lyckas på effektivt sätt reducera drift och uppnår rimlig noggranhet för enklare rörelser. För linjära rörelser med rotationer under 45◦ så erhålls ett absolut positionsfel inom 10%. För att fungera väl även för mer komplexa rörelser krävs frekventa stop, och noggrann rörelsedetektion är central. Denna ZUPT-metod kommer aldrig att kunna generera position i realtid och algoritmen presterar väl endast inom vissa begränsningar. Trots detta så finns god potential för metoden inom kvalitetssäkring för handhållna industriverktyg.

Inertial wearable sensors constitute a booming industry. They are self contained, low powered and highly miniaturized. They allow for remote or self monitoring of health-related parameters. When used to obtain 3-D position, velocity and orientation information, research has shown that it is possible to draw conclusion about issues such as fall risk, Parkinson disease and gait assessment. A key issues in extracting information from accelerometers and gyroscopes is the fusion of their noisy data to allow accurate assessment of the disease. This, so far, is an unsolved problem. Typically, a Kalman filter or its nonlinear, non-Gaussian version are implemented for estimating attitude â?? which in turn is critical for position estimation. However, sampling rates and large state vectors required make them unacceptable for the limited-capacity batteries of low-cost wearable sensors. The low-computation cost complementary filter has recently been re-emerging as the algorithm for attitude estimation. We employ it with a heuristic drift elimination method that is shown to remove, almost entirely, the drift caused by the gyroscope and hence generate a fairly accurate attitude and drift-eliminated position estimate. Inertial sensor data is obtained from the 10-axis SP-10C sensor, attached to a wearable insole that is inserted in the shoe. Data is obtained from walking in a structured indoor environment in Votey Hall.

O enorme volume de dados textuais disponível na web caracteriza-se como um cenário ideal para inúmeras aplicações do Processamento de Língua Natural, tal como a tarefa da Sumarização Automática de Atualização (SAA), que tem por objetivo a geração automática de resumos a partir de uma coleção textual admitindo-se que o leitor possui algum conhecimento prévio sobre os textos-fonte. Dessa forma, um bom resumo de atualização deve ser constituído pelas informações mais relevantes, novas e atualizadas com relação ao conhecimento prévio do leitor. Essa tarefa implica em diversos desafios, sobretudo nas etapas de seleção e síntese de conteúdo para o sumário. Embora existam inúmeras abordagens na literatura, com diferentes níveis de complexidade teórica e computacional, pouco dessas investigações fazem uso de algum conhecimento linguístico profundo, que pode auxiliar a identificação de conteúdo mais relevante e atualizado. Além disso, os métodos de sumarização comumente empregam uma abordagem de síntese extrativa, na qual algumas sentenças dos textos-fonte são selecionadas e organizadas para compor o sumário sem alteração de seu conteúdo. Tal abordagem pode limitar a informatividade do sumário, uma vez que alguns segmentos sentenciais podem conter informação redundante ou irrelevante ao leitor. Assim, esforços recentes foram direcionados à síntese compressiva, na qual alguns segmentos das sentenças selecionadas para o sumário são removidos previamente à inserção no sumário. Nesse cenário, este trabalho de doutorado teve por objetivo a investigação do uso de conhecimentos linguísticos, como a Teoria Discursiva Multidocumento (CST), Segmentação de Subtópicos e Reconhecimento de Entidades Nomeadas, em distintas abordagens de seleção de conteúdo por meio das sínteses extrativas e compressivas visando à produção de sumários de atualização mais informativos. Tendo a língua Portuguesa como principal objeto de estudo, foram organizados três novos córpus, o CSTNews-Update, que viabiliza experimentos de SAA, e o PCSC-Pares e G1-Pares, para o desenvolvimento/avaliação de métodos de Compressão Sentencial. Ressalta-se que os experimentos de sumarização foram também realizados para a língua inglesa. Após as experimentações, observou-se que a Segmentação de Subtópicos foi mais efetiva para a produção de sumários mais informativos, porém, em apenas poucas abordagens de seleção de conteúdo. Além disso, foram propostas algumas simplificações para o método DualSum por meio da distribuição de Subtópicos. Tais métodos apresentaram resultados muito satisfatórios com menor complexidade computacional. Visando a produção de sumários compressivos, desenvolveram-se inúmeros métodos de Compressão Sentencial por meio de algoritmos de Aprendizado de Máquina. O melhor método proposto apresentou resultados superiores a um trabalho do estado da arte, que faz uso de algoritmos de Deep Learning. Além dos resultados supracitados, ressalta-se que anteriormente a este trabalho, a maioria das investigações de Sumarização Automática para a língua Portuguesa foi direcionada à geração de sumários a partir de um (monodocumento) ou vários textos relacionados (multidocumento) por meio da síntese extrativa, sobretudo pela ausência se recursos que viabilizassem a expansão da área de Sumarização Automática para esse idioma. Assim, as contribuições deste trabalho engajam-se em três campos, nos métodos de SAA propostos com conhecimento linguísticos, nos métodos de Compressão Sentencial e nos recursos desenvolvidos para a língua Portuguesa. / The huge amount of data that is available online is the main motivation for many tasks of Natural Language Processing, as the Update Summarization (US) which aims to produce a summary from a collection of related texts under the assumption the user/reader has some previous knowledge about the texts subject. Thus, a good update summary must be produced with the most relevant, new and updated content in order to assist the user. This task presents many research challenges, mainly in the processes of content selection and synthesis of the summary. Although there are several approaches for US, most of them do not use of some linguistic information that may assist the identification relevant content for the summary/user. Furthermore, US methods frequently apply an extractive synthesis approach, in which the summary is produced by picking some sentences from the source texts without rewriting operations. Once some segments of the picked sentences may contain redundant or irrelevant content, this synthesis process can to reduce the summary informativeness. Thus, some recent efforts in this field have focused in the compressive synthesis approach, in which some sentences are compressed by deletion of tokens or rewriting operations before be inserted in the output summary. Given this background, this PhD research has investigated the use of some linguistic information, as the Cross Document Theory (CST), Subtopic Segmentation and Named Entity Recognition into distinct content selection approaches for US by use extractive and compressive synthesis process in order to produce more informative update summaries. Once we have focused on the Portuguese language, we have compiled three new resources for this language, the CSTNews-Update, which allows the investigation of US methods for this language, the PCST-Pairs and G1-Pairs, in which there are pairs of original and compressed sentences in order to produce methods of sentence compression. It is important to say we also have performed experiments for the English language, in which there are more resources. The results show the Subtopic Segmentation assists the production of better summaries, however, this have occurred just on some content selection approaches. Furthermore, we also have proposed a simplification for the method DualSum by use Subtopic Segments. These simplifications require low computation power than DualSum and they have presented very satisfactory results. Aiming the production of compressive summaries, we have proposed different compression methods by use machine learning techniques. Our better proposed method present quality similar to a state-of-art system, which is based on Deep Learning algorithms. Previously this investigation, most of the researches on the Automatic Summarization field for the Portuguese language was focused on previous traditional tasks, as the production of summaries from one and many texts that does not consider the user knowledge, by use extractive synthesis processes. Thus, beside our proposed US systems based on linguistic information, which were evaluated over English and Portuguese datasets, we have produced many Compressions Methods and three new resources that will assist the expansion of the Automatic Summarization field for the Portuguese Language.