A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.

Les Robots Parallèles à Câbles (RPCs) sont des robots parallèles dont les jambes se composent de câbles. Les applications industrielles potentielles des RPCs sont nombreuses telles que le grenaillage et la peinture de structures massives et de grandes dimensions.La première partie de ce manuscrit est dédié à la modélisation des RPCs. Deux modèles élasto-statiques ont été introduits dans ce manuscrit, pour décrire le petit déplacement de la plate-forme mobile en raison de la nature non-rigide des câbles. Le modèle élasto-statique basé sur des câbles pesants a été exprimé en faisant la différence entre la matrice de raideur active et la matrice de raideur passive du RPC.La deuxième partie de ce manuscrit traite de l’analyse d’espaces de travail de RPCs vis-à-vis de leurs performances statiques et dynamiques. Deux nouveaux espaces de travail ont été définis : (i) l'Espace des Vitesses Générables (EVG);(ii) l’Espace de Travail Dynamique Amélioré (ETDA). La troisième partie de ce manuscrit décrit une stratégie de conception générique de RPCs et des Robots Parallèles à Câbles Reconfigurables (RPCRs). Les reconfigurations sont limitées uniquement aux points de sortie des câbles. Dans ce manuscrit, les points de sortie des câbles peuvent être placés dans une large mais limité ensemble de positions. La stratégie proposée envisage la possibilité de déplacer les points de sortie des câbles du RPCR sur une grille prédéfinie d'emplacements.La quatrième partie de ce manuscrit présente un algorithme pour calculer une stratégie de reconfiguration optimale pour les RPCRs. Cette stratégie peut être utilisée lorsque l'environnement de travail de RPCRs est extrêmement encombré et qu’il n'est pas possible de prévoir le nombre de configurations nécessaires pour compléter la tâche.L'efficacité de l'algorithme a été analysée en étudiant les reconfigurations d’un robot parallèle à câbles planaire et d’un robot parallèle à câbles spatial en lien avec des applications industrielles. / Cable-Driven Parallel Robots (CDPRs) are parallel robots whose legs consist of cables. CDPRs may be used successfully in several industrial applications such as sandblasting and painting of large and heavy structures.The first part of this manuscript is dedicated to the modelling of CDPRs. Two elasto-static models have been introduced in this manuscript, in order to describe the small displacement of the moving platform due to the non-rigid nature of the cables. These models can be used for the modal analysis of the CDPRs, as well. The elasto-static model based on linear cables has been computed including the effect of the pulleys orienting the cables into the CDPR workspace.The second part of this manuscript deals with the investigation of the workspace of CDPRs, in terms of their moving platform static and dynamic equilibria, and in terms of their moving platform kinematic constraints. Two novel workspaces have been defined: (i) the Twist Feasible Workspace (TFW); (ii) the Improved Dynamic Feasible Workspace (IDFW). The third part of this manuscript describes a generic design strategy for CDPRs and a novel design strategy for Reconfigurable Cable-Driven Parallel Robots (RCDPRs). In this manuscript, reconfigurations are limited to the thedisplacement of the cable exit points, assuming the cables exit points can be installed on a large but finite set of locations.The fourth part of this manuscript introduces an algorithm to compute an optimal reconfiguration strategy for RCDPRs. This strategy can be used when the working environment of the RCDPR is extremely cluttered and when it is not possible to predict how many configurations are necessary to complete the task. The effectiveness of the algorithm hasbeen analysed by means of a planar and a spatial casestudies reproducing some industrial tasks.

Marginalisés de la Colombie, le département du Vichada et la municipalité de La Primavera, situés dans le bassin de l'Orénoque, sont au centre d'un boom agraire. À l'origine de ceci, se trouvent des groupes de paramilitaires, guérilla et narcotrafiquants, qui essaient de contrôler la production de coca Le boom attire des investissements de tout type, résultant en une contreréforme agraire traduite par une accumulation de terres, de façon violente et illégale. Ce scénario contient les conditions pour que des nouvelles vagues de PDI se déplacent vers les bidonvilles des grandes villes. Parallèlement, la Colombie est dans une conjoncture avec des négociations entre le gouvernement et la guérilla, pour mettre fin à la guerre. Le point cl, de l'agenda est le développement durable de la campagne et la démocratisation de l'accès à la terre. Cette situation dichotomique représente une opportunité pour initier des laboratoires de développement alternatifs et durables, qui pourraient bénéficient à l'ensemble de la région. La recherche se centre sur La Primavera, un milieu nettement rural de 14.000 habitants disséminés sur une large extension sans infrastructures de base où un groupe norvégien a acheté 72.000 hectares de savane pour y développer un projet agroindustriel, qui aura besoin de main-d'œuvre intensive. Le projet, en cours de réalisation, prévoit de créer un village durable et autosuffisant pour 1.000 familles, dont la conception comporte une prise en compte du territoire et des autres villages ; et la mise en œuvre de solutions sociales, économiques et environnementales alternatives, se constituant le terrain d'observation principal, in situ et in vivo. / Marginalized from Colombia, the department of Vichada and the municipality of La Primavera, located in the Orinoco basin, are at the center of an agrarian boom. At the origin of this, there are paramilitaries groups, guerrilla and drug traffickers, who are trying to control the coca production. The boom is attracting investment of any kind, resulting in an agrarian counter-reform materialized in an accumulation of land, in a violent and illegal manner. This scenario contains the conditions for new IDP waves moving to slums in the large cities. Meanwhile, Colombia is in a conjuncture with the negotiations between the government and the guerrillas to end the war. The key point of the agenda is sustainable development of the countryside and the democratization of access to the land. This dichotomous situation represents an opportunity to introduce alternative and sustainable development laboratories, which could benefit the whole region. The research focuses on La Primavera, a distinctly rural area with 14,000 people scattered over a wide extension without basic infrastructure; where a Norwegian group bought 72,000 hectares of savannah in order to develop an agro-industrial project, which will need intensive manpower. The project, under construction, plans to create a sustainable and self-sufficient village of 1,000 families, whose conception includes taking into account of the territory and other villages; and the implementation of alternative social, economic and environmental solutions, constituting the main field of observation, in situ and in vivo.

SOFA 2 is a component system employing hierarchically composed components in distributed environment. It contains concepts, which allow for specifying dynamic reconfigurations of component architectures at runtime, which is essential for virtually any real-life application. The dynamic reconfigurations comprise creating/disposing components and creating/disposing connections between components. In contrast to majority of component systems, SOFA 2 is able to specify possible architectural reconfigurations in the application architecture at design time. This allows SOFA 2 runtime to follow the dynamic behavior of the application and reflect the behavior in architectural reconfigurations. The goal of this thesis is to reify these concepts of dynamic reconfigurations in the implementation of SOFA 2 and demonstrate their usage on a demo application.

Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-05-09T20:34:55Z No. of bitstreams: 1 ClaudiaArcher.pdf: 2499542 bytes, checksum: c3798aae30fc8474ef1bf7a811476f49 (MD5) / Made available in DSpace on 2017-05-09T20:34:55Z (GMT). No. of bitstreams: 1 ClaudiaArcher.pdf: 2499542 bytes, checksum: c3798aae30fc8474ef1bf7a811476f49 (MD5) Previous issue date: 2017-03-31 / This thesis analyzes how the reconfiguration of the state's bureaucracy occurred with the introduction of information and communication technologies (ICTs) into the brazilian's Stated. It begins with the contextualization of this moment through the history of "cognitive capitalism" and the "reform of the Brazilian's state of 1995". Because these are two facts that led the Brazilian state to introduce ICT in its bureaucratic routines, reconfiguring them. This change in routines leads state workers to adapt to the introduction of ICT in their work processes. This generates a hierarchy through the various levels of adaptation found in the burearacy. One has, therefore, those bureaucrats who have not adapted and leave the State, whether by retirement, or Programs of voluntary dismissals, they do not feel able to renew their knowledge, or even have no interest. Another type of bureaucrat is one who can‘t adapt, but continues in the public service, but calls on the help of another to help him, creating the micro regulations of power, and delaying the task. This relation it was called by Crozier (1981) of "power of the expert", that the power of the one that knows. Finally, from the categorization of the adapted bureaucrats, they are those who developed the skills necessary to carry out the reconfigured bureaucratic routines. In addition to the adapted bureaucrats, based on Haraway's theory of cyborgs (2000), another category of bureaucrats is identified, those who arrive at the state already inserted in cyberspace, they are the cyberbureaucrats. / Esta tese analisa como ocorreu a reconfiguração da burocracia estatal com a introdução das tecnologias da informação e da comunicação – TICs – no Estado brasileiro. Parto da contextualização desse momento através do histórico do “capitalismo cognitivo” e da “reforma do estado brasileiro de 1995”, por serem estes dois fatos que levaram o Estado brasileiro a introduzir as TICs em suas rotinas burocráticas, reconfigurando-as. Esta mudança que acontece nas rotinas, leva os trabalhadores do Estado a se adaptarem à introdução das TICs em seus processos de trabalho. Isso gera uma hierarquização mediante os diversos níveis de adaptação que se encontram na burocracia. Há, portanto, aqueles burocratas que não se adaptaram e saem do Estado, seja por aposentadoria, ou programas de demissões voluntárias, e não se sentem capazes de renovar o seu conhecimento, ou mesmo não têm interesse. Outro tipo de burocrata é aquele que não consegue se adaptar, mas continua no serviço público, porém, solicita a ajuda de outro, criando as microrrelações de poder, além de retardar a realização da tarefa. Essa relação foi chamada por Crozier (1981) de “poder do perito”, que é o poder daquele que conhece. Por fim, da categorização dos burocratas adaptados, são aqueles que desenvolvem as habilidades necessárias para realização das rotinas burocráticas reconfiguradas. Além dos burocratas adaptados, baseando-se na teoria dos ciborgues de Haraway (2000), identifica-se outra categoria de burocratas, aqueles que chegam ao Estado já inseridos no ciberespaço, são eles, os ciberburocratas.

Depuis le début des années soixante-dix, la ville de Sanaa connaît une croissance urbaine fulgurante générant des dynamiques territoriales inédites. Aujourd'hui, celles-ci ont pour principal théâtre les espaces périphériques, voire certaines marges physiques de l'agglomération. On assiste ainsi à l'émergence de centralités périurbaines qui se singularisent à la fois par leur capacité à polariser les activités économiques et à se constituer en espaces-clés de la vie sociale. Cette thèse analyse la fabrique et la pratique de ces centralités émergentes, dont la mise en place modifie autant la structure générale du Grand Sanaa que les rapports identitaires de la société urbaine à son espace. À l'origine produits par des initiatives privées et des pratiques citadines, ces nouveaux centres redéfinissent actuellement l'ensemble des stratégies d'acteurs. Plus encore, il semble s'y inventer de nouveaux cadres d'urbanité : cette recherche se consacre à en préciser les fondements.

L'ingénierie logicielle doit faire face à un besoin toujours croissant en évolutivité des systèmes informatiques pour faciliter leur maintenance et de manière générale leur administration. Cependant, l'évolution d'un système, et plus spécifiquement l'évolution dynamique, ne doit pas se faire au dépend de sa fiabilité, c'est à dire de sa capacité à délivrer correctement les fonctionnalités attendues au cours de sa vie. En effet, des modifications dans un système peuvent laisser ce dernier dans un état incohérent et donc remettre en cause son caractère fiable. L'objectif de cette thèse est de garantir la fiabilité des reconfigurations dynamiques utilisées pour faire évoluer les systèmes pendant leur exécution tout en préservant leur disponibilité, c'est à dire leur continuité de service. Nous nous intéressons plus particulièrement aux systèmes à base de composants logiciels, potentiellement distribués, dont l'architecture peut être le support de reconfigurations dynamiques non anticipées et concurrentes. Nous proposons une définition de la cohérence des configurations et des reconfigurations dans le modèle de composants Fractal à travers une modélisation basée sur des contraintes d'intégrité tels que des invariants structurels. La fiabilité des reconfigurations est garantie par une approche transactionnelle permettant à la fois de réaliser du recouvrement d'erreurs et de gérer la concurrence des reconfigurations dans les applications. Nous proposons enfin une architecture à composants modulaire pour mettre en oeuvre nos mécanismes transactionnels adaptés aux reconfigurations dynamiques dans des applications à base de composants Fractal.