4 resultados para Avaliação heurística
em Universidade Federal do Rio Grande do Norte(UFRN)
Resumo:
Nowadays the Distance Learning (DL) is in its fifth generation and New Information and Communication Technologies (NICT) mediate it. In this technological context it is then called Distance e-Learning (DeL). DeL has also in the e-books a potential interactive tool to the collaborative learning. So, this study was accomplished with the purpose of analyzing the e-books developed by SEDIS – Secretaria de Educação a Distância (Department of Distance Learning). This study was performed in two phases: Firstly it was done an exploratory study to check out the reading and the handling of digital e-learning material available to the student-users. These e-books are obtainable on SEDIS Moodle platform. Secondly, it was performed some analysis of an e-book sample by means of the heuristic evaluation. This research aims both to identify potential problems and give some suggestions to solve them. At last it is presented a final report with diagnosis and suggestions for a more applicable design in order to optimize the e-book by means of the distance e-learning usability guidelines
Resumo:
This study aims to analyze the communication graphics of layouts of hypermedia interfaces oriented to Distance Education via the Internet. This proposal is justified by widening the offer of courses that modality and the consequent application of items of hypermedia for teaching-learning. The method of analysis involved the search nethnographic, addressed to the cycle student intermediary of the Training Program Continuing Medias in Education, and the evaluation heuristic of the interfaces of Virtual Learning Environment "E-Proinfo" and of the modules of the Cycle. This evaluation we observed the implementation of the attributes of usability and the degree of interactivity of each interface. The results revealed an inefficient implementation of the attributes of usability, which meant a consequent reduction of the levels of interactivity. As proposing the present Design Virtual Learning, a model of hypermedia layout, designed to generate usability for Virtual learning environments and extend the acquisition of literancy for students and tutors. This proposal design not hypermedia aims the demarcation of models pre-conceived, but the proposal of layout in which each element of hypermedia is applied with a view to generate a seaworthiness intuitive, more agile and efficient, in these ambients
Resumo:
Baseado na metodologia de design participativo, este artigo relata o processo de pesquisa e desenvolvimento de uma versão mobile de um sistema já existente para desktop e amplamente utilizado para o compartilhamento de informações acadêmicas em uma universidade federal do Brasil. A pesquisa foi realizada em duas etapas. Na ‘Etapa I’ foram realizados estudos baseados em etnografia envolvendo docentes e discentes: Grupo de Foco, Análise Contextual, Avaliação Heurística Participativa e Avaliação Cooperativa. Por meio dos resultados foi possível identificar funcionalidades e requisitos desejáveis, problemas de usabilidade de uma versão mobile já em processo inicial de desenvolvimento, bem como e elaboração de uma nova interface gráfica. Na ‘Etapa II’ foram avaliados modelos de interação por meio de protótipos especificamente projetados para testes no mecanismo de lançamento de frequência do sistema mobile que, em seguida, foram avaliados através de testes de usabilidade e questionário de satisfação do usuário.
Resumo:
The problems of combinatory optimization have involved a large number of researchers in search of approximative solutions for them, since it is generally accepted that they are unsolvable in polynomial time. Initially, these solutions were focused on heuristics. Currently, metaheuristics are used more for this task, especially those based on evolutionary algorithms. The two main contributions of this work are: the creation of what is called an -Operon- heuristic, for the construction of the information chains necessary for the implementation of transgenetic (evolutionary) algorithms, mainly using statistical methodology - the Cluster Analysis and the Principal Component Analysis; and the utilization of statistical analyses that are adequate for the evaluation of the performance of the algorithms that are developed to solve these problems. The aim of the Operon is to construct good quality dynamic information chains to promote an -intelligent- search in the space of solutions. The Traveling Salesman Problem (TSP) is intended for applications based on a transgenetic algorithmic known as ProtoG. A strategy is also proposed for the renovation of part of the chromosome population indicated by adopting a minimum limit in the coefficient of variation of the adequation function of the individuals, with calculations based on the population. Statistical methodology is used for the evaluation of the performance of four algorithms, as follows: the proposed ProtoG, two memetic algorithms and a Simulated Annealing algorithm. Three performance analyses of these algorithms are proposed. The first is accomplished through the Logistic Regression, based on the probability of finding an optimal solution for a TSP instance by the algorithm being tested. The second is accomplished through Survival Analysis, based on a probability of the time observed for its execution until an optimal solution is achieved. The third is accomplished by means of a non-parametric Analysis of Variance, considering the Percent Error of the Solution (PES) obtained by the percentage in which the solution found exceeds the best solution available in the literature. Six experiments have been conducted applied to sixty-one instances of Euclidean TSP with sizes of up to 1,655 cities. The first two experiments deal with the adjustments of four parameters used in the ProtoG algorithm in an attempt to improve its performance. The last four have been undertaken to evaluate the performance of the ProtoG in comparison to the three algorithms adopted. For these sixty-one instances, it has been concluded on the grounds of statistical tests that there is evidence that the ProtoG performs better than these three algorithms in fifty instances. In addition, for the thirty-six instances considered in the last three trials in which the performance of the algorithms was evaluated through PES, it was observed that the PES average obtained with the ProtoG was less than 1% in almost half of these instances, having reached the greatest average for one instance of 1,173 cities, with an PES average equal to 3.52%. Therefore, the ProtoG can be considered a competitive algorithm for solving the TSP, since it is not rare in the literature find PESs averages greater than 10% to be reported for instances of this size.