Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-04-03T19:37:47Z No. of bitstreams: 1 JonathanWanderleyDeMesquita_DISSERT.pdf: 4388700 bytes, checksum: c184689f12b45cb2f335af3627f06a1b (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-04-05T18:37:56Z (GMT) No. of bitstreams: 1 JonathanWanderleyDeMesquita_DISSERT.pdf: 4388700 bytes, checksum: c184689f12b45cb2f335af3627f06a1b (MD5) / Made available in DSpace on 2017-04-05T18:37:56Z (GMT). No. of bitstreams: 1 JonathanWanderleyDeMesquita_DISSERT.pdf: 4388700 bytes, checksum: c184689f12b45cb2f335af3627f06a1b (MD5) Previous issue date: 2016-12-08 / Durante o projeto de arquiteturas multiprocessadas, a etapa de explora??o do espa?o de projeto pode ser auxiliada por ferramentas que aceleram o processo. O projeto de uma arquitetura com comunica??o baseada em rede-em-chip, usualmente considera topologias regulares, e de car?ter gen?rico, desconsiderando uma eventual irregularidade no padr?o de comunica??o entre os elementos interligados. Projetos heterog?neos necessitam de solu??es de comunica??o ad-hoc, onde a explora??o manual do espa?o de projeto se torna invi?vel, dada a sua complexidade. O presente trabalho prop?e uma rede em chip de topologia irregular, capaz de ter bons desempenhos (pr?ximo ao desempenho de uma rede conectada segundo o grafo da aplica??o), por meio de um processo de comunica??o baseado em tabelas de roteamento. Tamb?m, uma ferramenta de explora??o em alto n?vel utilizando Algoritmo Gen?tico, capaz de encontrar redes UTNoCs com n?mero reduzido de conex?es, e auxiliando em decis?es de projetos destas redes. Resultados obtidos corroboram o trabalho, obtendo redes UTNoCs com desempenhos pr?ximos aos de redes conectadas segundo os grafos de suas aplica??es, e com redu??o no n?mero de conex?es de at? 54%, representando uma redu??o significativa de ?rea e consumo de energia. / During the design of multiprocessor architectures, the design space exploration step may be aided by tools that assist and accelerate this process. The project of architectures whose communications are based on Networks-on-Chip (NoCs), usually relies on regular topologies, disregarding a possible irregularity in the communication pattern between the interconnected elements. The present work proposes an irregular topology chip network, capable of having good performance (close to the performance of a network connected according to the application graph), through a communication process based on routing tables. The work proposes also a high-level exploration tool using Genetic Algorithm, able to find UTNoC networks with reduced number of connections, and assisting in the design decisions of these networks. The obtained Results show that it?s possible to obtain UTNoC networks with performances close to the performance of networks connected according to the graphs of their applications, and with a reduction in the number of connections of up to 54%, representing a significant reduction of area and energy consumption.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-04-17T21:35:20Z No. of bitstreams: 1 DanielAlencarDaCosta_TESE.pdf: 9198560 bytes, checksum: 463f875eda2671bd33beca615f72eef3 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-04-18T22:34:50Z (GMT) No. of bitstreams: 1 DanielAlencarDaCosta_TESE.pdf: 9198560 bytes, checksum: 463f875eda2671bd33beca615f72eef3 (MD5) / Made available in DSpace on 2017-04-18T22:34:50Z (GMT). No. of bitstreams: 1 DanielAlencarDaCosta_TESE.pdf: 9198560 bytes, checksum: 463f875eda2671bd33beca615f72eef3 (MD5) Previous issue date: 2017-02-08 / The timely delivery of addressed software issues (i.e., bug fixes, enhancements, and new features) is what drives software development. Previous research has investigated what impacts the time to triage and address (or fix) issues. Nevertheless, even though an issue is addressed, i.e., a solution is coded and tested, such an issue may still suffer delay before being delivered to end users. Such delays are frustrating, since end users care most about when an addressed issue is available in the software system (i.e, released). In this matter, there is a lack of empirical studies that investigate why addressed issues take longer to be delivered compared to other issues. In this thesis, we perform empirical studies to understand which factors are associated with the delayed delivery of addressed issues. In our studies, we find that 34% to 98% of the addressed issues of the ArgoUML, Eclipse and Firefox projects have their integration delayed by at least one release. Our explanatory models achieve ROC areas above 0.74 when explaining delivery delay.We also find that the workload of integrators and the moment at which an issue is addressed are the factors with the strongest association with delivery delay.We also investigate the impact of rapid release cycles on the delivery delay of addressed issues. Interestingly, we find that rapid release cycles of Firefox are not related to faster delivery of addressed issues. Indeed, although rapid release cycles address issues faster than traditional ones, such addressed issues take longer to be delivered.Moreover, we find that rapid releases deliver addressed issues more consistently than traditional ones. Finally, we survey 37 developers of the ArgoUML, Eclipse, and Firefox projects to understand why delivery delays occur. We find that the allure of delivering addressed issues more quickly to users is the most recurrent motivator of switching to a rapid release cycle.Moreover, the possibility of improving the flexibility and quality of addressed issues is another advantage that are perceived by our participants. Additionally, the perceived reasons for the delivery delay of addressed issues are related to decision making, team collaboration, and risk management activities. Moreover, delivery delay likely leads to user/developer frustration according to our participants. Our thesis is the first work to study such an important topic in modern software development. Our studies highlight the complexity of delivering issues in a timely fashion (for instance, simply switching to a rapid release cycle is not a silver bullet that would guarantee the quicker delivery of addressed issues).

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-06-02T19:19:17Z No. of bitstreams: 1 RanmsesEmanuelMartinsBastos_DISSERT.pdf: 3544164 bytes, checksum: 0be0a21709a7526cbbea13cf73f55d8e (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-06-05T19:52:50Z (GMT) No. of bitstreams: 1 RanmsesEmanuelMartinsBastos_DISSERT.pdf: 3544164 bytes, checksum: 0be0a21709a7526cbbea13cf73f55d8e (MD5) / Made available in DSpace on 2017-06-05T19:52:51Z (GMT). No. of bitstreams: 1 RanmsesEmanuelMartinsBastos_DISSERT.pdf: 3544164 bytes, checksum: 0be0a21709a7526cbbea13cf73f55d8e (MD5) Previous issue date: 2017-02-17 / O Problema do Caixeiro Viajante com Passageiros e Lota??o ? uma vers?o do PCV cl?ssico onde o caixeiro ? o motorista de um ve?culo que compartilha os custos de viagem com passageiros. Al?m de dividir os custos do percurso, o caixeiro pode se valer, tamb?m, dos descontos das high-occupancy vehicle lanes, que s?o faixas de tr?nsito que isentam ve?culos lotados do pagamento de ped?gio. A adi??o de passageiros ao PCV, um problema restrito ao roteamento, cria um vi?s colaborativo que ? intensificado pela considera??o das faixas especiais. Tal cen?rio confere ao problema estudado um aspecto ecol?gico, uma vez que seu estudo tem consequ?ncias diretas sobre o uso eficiente do espa?o urbano e a diminui??o da emiss?o de gases poluentes, contribuindo sobremaneira para o incremento da qualidade de vida. A pesquisa compreendeu desde a correla??o entre esse novo problema e outros constantes na literatura at? a concep??o de um conjunto de seiscentas inst?ncias artificiais e a cria??o de diversos m?todos de solu??o. Para a determina??o de ?timos, ? proposto um modelo matem?tico que suportou as solu??es por Programa??o Matem?tica e por Restri??es. Adicionalmente, ? apresentado um algoritmo branch-and-bound especificamente desenvolvido para o problema. Visando a busca por solu??es de qualidade em curto espa?o de tempo, s?o expostos cinco algoritmos experimentais com base nas abordagens heur?sticas Simulated Annealing, Variable Neighborhood Search, Coloniza??o de Abelhas e Algoritmos Gen?ticos. Diversos procedimentos auxiliares para constru??o de solu??es e execu??o de buscas locais s?o tamb?m expostos. Um experimento computacional ? realizado para compara??o entre os m?todos de solu??o. Uma amostra de cem casos teste ? utilizada para o processo estat?stico de ajuste de par?metros dos algoritmos heur?sticos, enquanto o restante das inst?ncias ? extensivamente abordado pelos m?todos. S?o determinados os ?timos para cento e cinquenta e cinco casos com tamanhos 10 e 20 cidades. Dentre os m?todos experimentais, cabe destacar a superioridade do algoritmo heur?stico que une as meta-heur?sticas Simulated Annealing e Variable Neighborhood Search. / The Traveling Salesman with Passengers and High Occupancy Problem is a version of the classic TSP where the salesman is the driver of a vehicle who shares travels? expenses with passengers. Besides shared expenses, the driver also benefits from discounts of the highoccupancy vehicle lanes, i.e. traffic lanes in which high occupancy vehicles are exempted from tolls. The addition of passengers to the TSP, a routing-only problem, creates a sharing view which is intensified by the consideration of special lanes. This scenario grants to the problem an ecological feature, since its study have direct consequences for the efficient use of urban space and the greenhouse gas emissions reduction, greatly contributing for quality of life improvement. This work addresses the study of this novel combinatorial optimization problem, going from the relationship it draws with other ones in the literature until the conception of a six hundred set of artificial test cases and the creation of many solution methods. To find optimal solutions, a mathematical model is proposed. This model supported the search for exact solutions by Mathematical and Constraint Programming. Additionally, is presented a branchand- bound algorithm specifically developed for the problem. Aiming the search for good quality solutions in short time period, five experimental algorithms based on the heuristics approaches Simulated Annealing, Variable Neighborhood Search, Bees Colony and Genetic Algorithms are introduced. Several auxiliary procedures for solutions generations and local search execution are revealed as well. A computational experiment is fulfilled to comparison between the solution methods. A sample of a hundred test cases is used for the heuristics algorithms? parameter tuning statistical process, while the rest of them are extensively addressed by the methods. The optimal solution for a hundred and fifty five test cases with sizes of 10 and 20 cities are determined. Among the experimental methods, one has to highlight the advantage of the heuristic algorithm that unites the metaheuristics Simulated Annealing and Variable Neighborhood Search.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-09-04T20:48:37Z No. of bitstreams: 1 JorgePereiraDaSilva_DISSERT.pdf: 2683918 bytes, checksum: 3201ca469ff4ef51673bc11e30a372b0 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-09-06T21:02:21Z (GMT) No. of bitstreams: 1 JorgePereiraDaSilva_DISSERT.pdf: 2683918 bytes, checksum: 3201ca469ff4ef51673bc11e30a372b0 (MD5) / Made available in DSpace on 2017-09-06T21:02:21Z (GMT). No. of bitstreams: 1 JorgePereiraDaSilva_DISSERT.pdf: 2683918 bytes, checksum: 3201ca469ff4ef51673bc11e30a372b0 (MD5) Previous issue date: 2017-03-24 / O paradigma de Internet das Coisas (do ingl?s, Internet of Things ?IoT) abrange uma infraestrutura de hardware e software que conecta dispositivos f?sicos, denominados como coisas, ao mundo digital. Estima-se que em 2020 existir?o cerca de 100 bilh?es de dispositivos de IoT conectados cujos dados e servi?os servir?o como base para a constru??o de uma mir?ade de aplica??es. No entanto, desenvolver aplica??es no contexto de IoT n?o ? uma tarefa trivial. Dada a grande quantidade e variedade de dispositivos envolvidos, tais aplica??es precisam ser constru?das atendendo requisitos de escalabilidade a fim de suportar um grande n?mero de dispositivos conectados, al?m de armazenar e processar a enorme quantidade de dados por eles produzida. Al?m disso, aplica??es de IoT tamb?m precisam lidar com uma diversidade de protocolos distintos. Nesse contexto, plataformas de middleware t?m surgido como solu??es promissoras para facilitar o desenvolvimento de aplica??es. Tais plataformas oferecem interfaces padronizadas para acesso aos dispositivos, abstraindo para os desenvolvedores detalhes de comunica??o via rede, protocolos e formatos de dados utilizados pelos diversos dispositivos. Nessa perspectiva, o presente trabalho apresenta a plataforma EcoCIT, uma plataforma de middleware escal?vel que prov? suporte para a integra??o de dispositivos de IoT ? internet, bem como ao desenvolvimento e execu??o de aplica??es de IoT com requisitos de escalabilidade atrav?s do uso de servi?os computacionais providos sob demanda por plataformas de computa??o em nuvem. / The Internet of Things (IoT) paradigm encompasses a hardware and software infrastructure that connects physical devices, known as things, to the digital world. It is estimated that in 2020 there will be nearly 100 billion of connected IoT devices whose data and services will be used for building a myriad of applications. However, developing applications in the IoT context is not a trivial task. Given the large number and variety of devices involved, these applications need to be built and executed in a scalable way to support a large number of connected devices as well as to store and process the huge amount of data they produce. Additionally, IoT applications also need to deal with several different protocols. In this context, middleware platforms have emerged as promising solutions to facilitate application development. These platforms offer standardized interfaces for access to devices, abstracting for developers details of communication via network, protocols and data formats used by various devices. In this perspective, this work presents the EcoCIT platform, a scalable middleware platform that provides support for the integration of IoT devices to the Internet, as well as the development and execution of IoT applications with scalability requirements through the use of on-demand computing services provided by cloud computing platforms.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:46Z No. of bitstreams: 1 DalayIsraelDeAlmeidaPereira_DISSERT.pdf: 1298858 bytes, checksum: 8ff640d45df0332e0a20a3f4476198ce (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T19:51:30Z (GMT) No. of bitstreams: 1 DalayIsraelDeAlmeidaPereira_DISSERT.pdf: 1298858 bytes, checksum: 8ff640d45df0332e0a20a3f4476198ce (MD5) / Made available in DSpace on 2017-11-07T19:51:30Z (GMT). No. of bitstreams: 1 DalayIsraelDeAlmeidaPereira_DISSERT.pdf: 1298858 bytes, checksum: 8ff640d45df0332e0a20a3f4476198ce (MD5) Previous issue date: 2017-08-18 / Utilizando a abordagem de desenvolvimento baseado em componentes, a complexidade dos sistemas ? reduzida e a sua manuten??o ? facilitada, trazendo mais seguran?a e reuso dos componentes. Por?m, a composi??o dos componentes (e suas intera??es) ainda ? uma grande fonte de problemas e requer uma an?lise mais detalhada. Esse problema ? ainda mais relevante quando lidamos com aplica??es cr?ticas. Uma abordagem para especificar esse tipo de aplica??o ? o uso de M?todos Formais, uma metodologia precisa para a especifica??o de sistemas, que possui uma base matem?tica forte e que traz, entre outros benef?cios, mais seguran?a. Como exemplo, o m?todo formal CSP permite a especifica??o de sistemas concorrentes e a verifica??o de propriedades inerentes a esses sistemas. CSP disp?e de um conjunto de ferramentas para a sua verifica??o, como, por exemplo, FDR. Usando CSP ? poss?vel indentificar e resolver problemas como deadlock e livelock em um sistema, muito embora isso possa ser custoso em termos de tempo gasto em verifica??es. Nesse contexto, BRIC surge como uma abordagem baseada em CSP para o desenvolvimento de sistemas baseados em componentes, garantindo a aus?ncia de deadlock e livelock por constru??o. Essa abordagem usa CSP para especificar restri??es e intera??es entre componentes de maneira a permitir uma verifica??o formal do sistema. Uma extens?o de BRIC, BRICK , prop?e adicionar metadados aos componentes a fim de diminuir a complexidade e a quantidade das verifica??es feitas quando componentes s?o compostos. Por?m, a aplica??o pr?tica dessa abordagem pode se tornar muito complexa e cansativa se feita manualmente. Com o objetivo de automatizar o uso da abordagem BRICK , foi desenvolvida anteriormente uma ferramenta (BTS - BRICK Tool Support) que automatiza as verifica??es das composi??es dos componentes gerando e verificando automaticamente as condi??es impostas pela abordagem utilizando FDR. Por?m, devido ao n?mero e ? complexidade das verifica??es feitas em FDR, a ferramenta pode levar ainda muito tempo nesse processo. Esta disserta??o apresenta uma extens?o ? BTS que melhora o modo como s?o feitas as verifica??es, substituindo o FDR utilizado na ferramenta pela sua mais recente vers?o e adicionando um provador SMT que, concorrentemente, verifica algumas das propriedades da aplica??o. N?s tamb?m adaptamos a ferramenta para ser usada na especifica??o de um maior n?mero de sistemas e avaliamos a ferramenta estendida com dois estudos de caso, comparando as verifica??es feitas na vers?o anterior da ferramenta com a nossa nova abordagem de verifica??o. / Using the component-based development approach, the system complexity is reduced and its maintenance is facilitated, bringing more reliability and reuse of components. However, the composition of components (and their interactions) is still a significant source of problems and requires a more detailed analysis. This problem is even more relevant when dealing with safety-critical applications. An approach for specifying this kind of applications is using Formal Methods, which are a precise methodology for system specification that has strong mathematical background which brings, among other benefits, more safety. As an example, the formal method CSP allows the specification of concurrent systems and the verification of properties inherent to such systems. CSP has a set of tools for verification, like, for instance, FDR. Using CSP, one can detect and solve problems like deadlock and livelock in a system, although it can be costly in terms of the time spent in verifications. In this context, BRICK has emerged as a CSP based approach for developing componentbased systems, which guarantees deadlock and livelock freedom by construction. This approach uses CSP to specify the constraints and interactions between the components to allow a formal verification of the system. An extension to BRIC, BRICK , makes use of metadata as part of the components in order to decrease the complexity and the quantity of verifications made when composing components. However, the practical use of this approach can be too complex and cumbersome. In order to automate the use of the BRICK approach a tool has been previously developed (BTS - BRICK Tool Support), which automates the verifications of component compositions by automatically generating and checking the side conditions imposed by the approach using FDR. Nevertheless, due to the number and complexity of the verifications made in FDR, the tool can still take too much time in this process. In this dissertation, we present an extension to BTS that improves the way how it make verifications by replacing the FDR used inside the tool by its most recent version and adding a SMT-solver, that, concurrently, checks some properties of the specification. We also adapted the tool in order to be used for the specification of a greater number of systems and we evaluated the extended tool with two case studies, comparing the verifications made in the older version of the tool with this new approach of verification.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:48Z No. of bitstreams: 1 NelsonIonDeOliveira_DISSERT.pdf: 4399398 bytes, checksum: c5204c8d781df4ba3815c95ed32af8c8 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T21:01:50Z (GMT) No. of bitstreams: 1 NelsonIonDeOliveira_DISSERT.pdf: 4399398 bytes, checksum: c5204c8d781df4ba3815c95ed32af8c8 (MD5) / Made available in DSpace on 2017-11-07T21:01:50Z (GMT). No. of bitstreams: 1 NelsonIonDeOliveira_DISSERT.pdf: 4399398 bytes, checksum: c5204c8d781df4ba3815c95ed32af8c8 (MD5) Previous issue date: 2017-07-24 / O principal objetivo deste trabalho ? apresentar uma proposta de interven??o no material did?tico da disciplina de L?gica de Programa??o dos cursos t?cnicos, ofertados na modalidade a dist?ncia, do Instituto Metr?pole Digital da Universidade Federal do Rio Grande do Norte. Essa interven??o foi proposta como resultado de uma pesquisa mista-explorat?ria online com centenas de alunos dos referidos cursos ofertados. Para a implementa??o da proposta, realizou-se an?lise de frequ?ncia descritiva sobre dados quantitativos acerca do desempenho acad?mico de 2.500 discentes dos primeiros semestres letivos dos anos de 2015 e 2016. Foram aplicados question?rios online com mais de 600 alunos para identificar o perfil desses estudantes. Tamb?m realizaram-se entrevistas semiestruturadas com efetivo de 37 alunos, com crit?rios de nota e idade para a defini??o dos grupos de entrevista. Com base nos dados obtidos e analisados na pesquisa, implementou-se uma proposta de interven??o que consiste na inser??o de um recurso no material did?tico utilizado na disciplina de L?gica de Programa??o para o referido curso. Essa interven??o adiciona o recurso que permite a realiza??o, pelo aluno, de exerc?cios de programa??o utilizando uma linguagem de programa??o de alto n?vel aliada ao recurso de feedback automatizado. / The main objective of this work is to present a proposal of intervention in the didactic material of the discipline of Logic of Programming of the technical courses offered at the Digital Metropolis Institute of the Federal University of Rio Grande do Norte. This intervention was proposed as a result of a mixed-exploratory research with hundreds of students of the our courses. For the implementation of the proposal, a descriptive frequency analysis was performed on quantitative data about the academic performance of 2,500 students from the first semesters of the years 2015 and 2016. Online questionnaires were applied with more than 600 students to identify the profile of these students. We also conducted semi-structured interviews with 37 students, with score and age criteria to define the groups interview. Based on the data obtained and analyzed in the research, a proposal of intervention was implemented by inserting a resource in the didactic material used in the Logic of Programming course. This intervention adds the feature that allows the student to perform programming exercises using a high-level programming language coupled with the automated feedback feature.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:49Z No. of bitstreams: 1 ZailtonSachasAmorimCalheiros_DISSERT.pdf: 970322 bytes, checksum: b3f4c21bcb05d3c25bba593777a5b94a (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T21:20:44Z (GMT) No. of bitstreams: 1 ZailtonSachasAmorimCalheiros_DISSERT.pdf: 970322 bytes, checksum: b3f4c21bcb05d3c25bba593777a5b94a (MD5) / Made available in DSpace on 2017-11-07T21:20:44Z (GMT). No. of bitstreams: 1 ZailtonSachasAmorimCalheiros_DISSERT.pdf: 970322 bytes, checksum: b3f4c21bcb05d3c25bba593777a5b94a (MD5) Previous issue date: 2017-07-31 / Este trabalho apresenta um modelo de compartilhamento de assentos veicular de modo a reduzir os custos de viagem de motoristas e passageiros, contribuindo de maneira significativa ao meio ambiente e ? sociedade. O problema tamb?m ? descrito atrav?s de um modelo de programa??o linear e s?o discutidas algumas variantes de um subproblema importante para resolu??o do modelo proposto. Al?m disso, algumas abordagens computacionais s?o implementadas, compostas de algoritmos evolucion?rios (gen?tico e mem?tico) e construtivos (formigas e GRASP). Al?m da adapta??o de algoritmos j? existes para o problema do caixeiro viajante tradicional como o algoritmo de Lin-Kernighan. Ap?s a realiza??o de experimentos, o algoritmo baseado em formiga revela-se promissor para inst?ncias assim?tricas enquanto que o algoritmo de Lin-Kernighan leva vantagem pela sua robustez atrav?s da implementa??o de Helsgaun que desempenha bons resultados para inst?ncias sim?tricas. / This thesis presents a vehicle seat sharing model in order to reduce travel costs for drivers and passengers, contributing significantly to the environment and society. The problem is also described by a linear programming model and it is discussed in some variants of an important subproblem for solving the main problem. Besides, some computational approaches are implemented, composed by evolutionary (genetic and memetic) e constructive (ant optimization) algorithms. In addition to the adaptation of already existing algorithms for the travaling salesman problem as the Lin-Kernighan algorithm. After performing experiments, ant-based algorithms prove itself promising for asymmetric instances while the Lin-Kernighan algorithm takes advantage of its robustness through the implementation of Helsgaun and has a good performance for symmetric instances.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:49Z No. of bitstreams: 1 FabioFernandesPenha_DISSERT.pdf: 4488288 bytes, checksum: ce0cffc3a8dfa247b84cbd463115a11f (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T21:46:59Z (GMT) No. of bitstreams: 1 FabioFernandesPenha_DISSERT.pdf: 4488288 bytes, checksum: ce0cffc3a8dfa247b84cbd463115a11f (MD5) / Made available in DSpace on 2017-11-07T21:46:59Z (GMT). No. of bitstreams: 1 FabioFernandesPenha_DISSERT.pdf: 4488288 bytes, checksum: ce0cffc3a8dfa247b84cbd463115a11f (MD5) Previous issue date: 2017-07-28 / A sociedade moderna, progressivamente, proporciona ambientes sociot?cnicos com sistemas complexos. Esses sistemas s?o complexos por conta do grande n?mero de partes que interagem de modo n?o simples, dada as propriedades dessas partes e das leis que regem essas intera??es. Al?m dessa circunst?ncia, trabalhos da Engenharia de Software refor?am que o universo das informa??es necess?rias para realizar uma modelagem ? mais amplo, e envolve mais dimens?es das j? consolidadas: est?tica e din?mica. Assim, surge o framework iStar com uma ontologia delineada para capturar e representar informa??es intencionais e sociais do ambiente analisado em dois modelos gr?ficos: Depend?ncia Estrat?gica (SD - Strategic Dependency ) e Racioc?nio Estrat?gico (SR - Strategic Rationale ). Entretanto, esse mesmo framework n?o oferece alternativas para melhorar a compreens?o dos seus modelos gr?ficos, quando esses representam um grande n?mero de partes desses ambientes, ou seja, sistemas complexos. Diante disso, o objetivo desta disserta??o foi oferecer uma alternativa ao framework iStar para lidar com a complexidade proporcionada pelos sistemas complexos, desta forma, influenciar positivamente a compreens?o e o aprendizado dos modelos iStar. Com esse fim, foi desenvolvida uma nota??o textual para compreender as informa??es sociais atrav?s de uma estrutura interdependente. Na avalia- ??o desenvolvida, observou-se a relev?ncia dessa nota??o textual para os modelos gr?ficos da seguinte forma: (i) uma alternativa complementar para leitura dos modelos gr?ficos, como tamb?m, (ii) a import?ncia da constru??o desses modelos a partir de composi??es de estruturas interdependentes. / A modern society, progressively, provides increasingly sociotechnical environments through of complex systems. This complexity is to due to the large number of parties interacting in a non-simple way, given the properties of these parts and the laws governing these interactions. In addition to this circumstance, the Software Engineering reinforces that the universe of information needed to perform a broader modeling, and involves more dimensions of already consolidated: static and dynamic. Thus, the iStar framework emerges with an ontology capable of capturing and represent intentional and social information of the environment analyzed in two graphic models: Strategic Dependency (SD) and Strategic Reasoning (SR). However, this same framework does not offer alternatives to improve the understanding of its graphic models, when these represent a large number of parts of these environments. Therefore, the objective of this dissertation was to offer an alternative to the iStar framework to deal with the complexity provided by the complex systems, in order to positively influence the understanding and learning of the iStar models. To this end, a textual notation has been developed to understand social information through an interdependent structure. In the developed evaluation, it was observed the relevance of this textual notation for the graphic models as follows: (i) a complementary alternative for reading of the graphic models, as well as (ii) the importance of building these models from interdependent structures.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:50Z No. of bitstreams: 1 HugoHenriqueDeOliveiraMesquita_DISSERT.pdf: 9863263 bytes, checksum: c1ac15343d1894bd89eec8538186f6de (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T21:58:05Z (GMT) No. of bitstreams: 1 HugoHenriqueDeOliveiraMesquita_DISSERT.pdf: 9863263 bytes, checksum: c1ac15343d1894bd89eec8538186f6de (MD5) / Made available in DSpace on 2017-11-07T21:58:05Z (GMT). No. of bitstreams: 1 HugoHenriqueDeOliveiraMesquita_DISSERT.pdf: 9863263 bytes, checksum: c1ac15343d1894bd89eec8538186f6de (MD5) Previous issue date: 2017-07-28 / Os jogos educativos digitais s?o apontados como uma boa ferramenta quando utilizados em sala de aula, pois insere os alunos em um ambiente l?dico de aprendizagem, de maneira que, proporciona o desenvolvimento de diversas habilidades. No entanto, nem sempre ? poss?vel para o professor conseguir jogos que se adequam ao perfil educacional que deseja, tornando muitas vezes invi?vel a sua utiliza??o no contexto escolar. Com base neste contexto, este trabalho apresenta o design e implementa??o de uma plataforma que visa proporcionar aos professores e alunos a possibilidade de criar jogos de uma maneira simples e intuitiva, e que permita aos professores adequar o conte?do dos jogos aos seus objetivos pedag?gicos. Os resultados desta pesquisa contribuem para as inova??es futuras, nos campos te?rico e pr?tico, na defini??o de uma abordagem baseada em componentes e desenvolvimento de uma plataforma ambos promovendo o desenvolvimento de jogos digitais educativos com diferentes objetivos pedag?gicos. Diante dos resultados apresentados, considera-se que a plataforma proposta em conjunto com a sua abordagem motivadora, apresentou resultados potencialmente eficazes. / The digital educational games are pointed out as a good tool when used in the classroom, because it inserts the students in a playful learning environment, in a way that, it provides the development of diverse abilities. However, it is not always possible for the teacher to achieve games that fit the educational profile that he or she wishes, making it often unfeasible for use in the school context. Based on this context, this work presents the design and implementation of a platform that aims to provide teachers and students with the possibility of creating games in a simple and intuitive way, and that allows teachers to adapt the content of the games to their pedagogical objectives. The results of this research contribute to future innovations in the theoretical and practical fields, in the definition of a component-based approach and the development of a platform both promoting the development of digital educational games with different pedagogical objectives. In view of the presented results, it is considered that the platform proposed together with its motivational approach, presented potentially effective results.

Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-11-01T21:17:50Z No. of bitstreams: 1 JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-11-07T22:09:47Z (GMT) No. of bitstreams: 1 JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5) / Made available in DSpace on 2017-11-07T22:09:47Z (GMT). No. of bitstreams: 1 JeanGleisonDeSantanaSilva_DISSERT.pdf: 1141115 bytes, checksum: 891de7a8a9407e8af54f241f1a174785 (MD5) Previous issue date: 2017-07-31 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior (CAPES) / O Problema do Caixeiro Viajante com Passageiros e Quota pertence ? classe de Problemas do Caixeiro Viajante com Quota. Neste problema, considera-se uma vantagem econ?mica quando o caixeiro, viajando em um ve?culo privado, embarca passageiros que passam a dividir as despesas da viagem com ele. O modelo pode representar situa??es reais onde o motorista tem uma rota de visita de cidade predefinida, na qual a cada cidade est? associado um b?nus, sendo demandada a coleta de um valor m?nimo desses b?nus, na fun??o objetivo da variante investigada leva-se em conta a possibilidade da redu??o dos custos do caixeiro embarcando pessoas em seu ve?culo. Um modelo matem?tico, seis algoritmos evolucion?rios, um GRASP e um heur?stico s?o apresentados para o problema. O comportamento dos algoritmos propostos ? analisado em um experimento computacional com 48 inst?ncias. / The Traveling Salesman Problem with Ridesharing and Quota belongs to the class of Quota Traveling Salesman problems. In this problem, it is considered the economic advantage achieved when the salesman, traveling in a private vehicle, gives ride to passengers who share travel expenses with him. The model can represent real situations where a driver programs a route to visit cities, each of which associated with a bonus, with the requirement of collecting a minimum sum of bonuses and taking into account the possibility of reducing costs due to people embarked in his vehicle. A math model, six evolutionary algorithms, a GRASP and one heuristic are presented for the problem addressed. The behavior of the proposed algorithms is analyzed on a computational experiment with 48 instances.