<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Coleção:</title>
  <link rel="alternate" href="http://repositorio.ufc.br/handle/riufc/24012" />
  <subtitle />
  <id>http://repositorio.ufc.br/handle/riufc/24012</id>
  <updated>2026-06-12T02:43:52Z</updated>
  <dc:date>2026-06-12T02:43:52Z</dc:date>
  <entry>
    <title>Um framework para apoiar especialistas no problema de escalonamento de exames hospitalares</title>
    <link rel="alternate" href="http://repositorio.ufc.br/handle/riufc/86723" />
    <author>
      <name>Anastácio, Francisco Levi Souza</name>
    </author>
    <author>
      <name>Queiroz, Mayrton Dias de</name>
    </author>
    <id>http://repositorio.ufc.br/handle/riufc/86723</id>
    <updated>2026-06-11T18:00:15Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Título: Um framework para apoiar especialistas no problema de escalonamento de exames hospitalares
Autor(es): Anastácio, Francisco Levi Souza; Queiroz, Mayrton Dias de
Abstract: Efficient management of patient flow in hospital settings, especially in the scheduling of diagnostic tests, represents a critical challenge given the high demand and limited resources. The Hospital Test Scheduling Problem consists of determining the processing sequence of tests across multiple stations, considering clinical priorities and arrival times. The objective of this work is to identify an alternative capable of scheduling hospital tests using heuristic algorithms. The methodology included a systematic literature review for theoretical grounding, followed by the implementation of three scheduling algorithms: Arrival Order Priority (AOP), based on arrival order; Minimum Processing Time Priority (MPTP), based on the shortest processing time; and Roulette Selection Strategy (RSS), of a probabilistic nature. To analyze the generated solutions, a framework capable of dynamically&#xD;
reconstructing the processing flow from the produced data was developed. The experiments were conducted in 150 distinct scenarios, varying the number of tests and processing stations. The results indicated that AOP presented the best average performance in terms of total processing time in all scenarios analyzed, while RSS obtained the longest average times, although it expanded the exploration of the solution space. It is concluded that the scheduling policy directly impacts operational performance and that the proposed framework contributes to the analysis, validation, and integration of decision support strategies in hospital environments.
Tipo: TCC</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Um Framework para apoiar especialistas no problema de recuperação de contêineres em terminais portuários</title>
    <link rel="alternate" href="http://repositorio.ufc.br/handle/riufc/85934" />
    <author>
      <name>Souza, Rildian Beserra Maia de</name>
    </author>
    <id>http://repositorio.ufc.br/handle/riufc/85934</id>
    <updated>2026-04-22T14:46:44Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Título: Um Framework para apoiar especialistas no problema de recuperação de contêineres em terminais portuários
Autor(es): Souza, Rildian Beserra Maia de
Abstract: With the use of containers in port terminals, the challenge arises of handling&#xD;
them in order to obtain a shorter time for operations. Among the problems encountered in this context, the Container Recovery Problem stands out, which seeks to determine a sequence of operations with containers performed in a yard bay using cranes. Given the number of optimization algorithms found in the literature, a strategy that allows the construction of solutions is necessary. The objective of this work is to identify an alternative capable of assisting specialists in building solutions. Through a literature review, it was possible to observe the need for a generic and easily integrated framework. To verify the framework's behavior, two algorithms were integrated: PRC_GREEDY and&#xD;
PRC_CONSTRUCTIVE. The results showed the solutions found by the technique and the time spent executing the instances adopted from the literature. Through the framework, it was possible to visualize and analyze the generated solutions, which allowed us to verify the impact of the solutions applied to the problem.
Tipo: TCC</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Conformidade do Portal gov.br à WCAG 2.2: uma análise comparativa com WAVE e Accessibility Insights for Web</title>
    <link rel="alternate" href="http://repositorio.ufc.br/handle/riufc/85289" />
    <author>
      <name>Freitas, Leyverson de Oliveira</name>
    </author>
    <id>http://repositorio.ufc.br/handle/riufc/85289</id>
    <updated>2026-03-10T16:13:41Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Título: Conformidade do Portal gov.br à WCAG 2.2: uma análise comparativa com WAVE e Accessibility Insights for Web
Autor(es): Freitas, Leyverson de Oliveira
Abstract: Web accessibility aims to ensure that people with different types of disabilities can perceive,&#xD;
understand, navigate, and interact with digital content and services in an autonomous and&#xD;
effective way. This study aims to evaluate the accessibility of the GOV.BR portal based on the&#xD;
Web Content Accessibility Guidelines (WCAG 2.2), using automated evaluation tools. The&#xD;
research seeks to identify barriers that compromise the browsing experience of users with&#xD;
disabilities and to propose recommendations that contribute to improving the portal. To achieve&#xD;
this objective, five representative pages of the website were analyzed using the tools WAVE&#xD;
Web Accessibility Evaluation Tool and Accessibility Insights for Web. The analyses revealed&#xD;
issues such as low contrast between text and background, links and buttons without adequate&#xD;
descriptions, form fields without accessible labels, incorrect semantic structure, and absence of&#xD;
alternative text in images. Based on these results, recommendations were developed to address&#xD;
these nonconformities, aiming to increase the portal’s level of compliance with WCAG guidelines&#xD;
and to promote a more inclusive experience for all users. The study reinforces the importance of&#xD;
digital accessibility as a continuous commitment to inclusion and equal access to information.
Tipo: TCC</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Implementação e análise de algoritmos de caminho mínimo para cálculo de matrizes de distância</title>
    <link rel="alternate" href="http://repositorio.ufc.br/handle/riufc/85088" />
    <author>
      <name>Lima, Henrique Lopes</name>
    </author>
    <id>http://repositorio.ufc.br/handle/riufc/85088</id>
    <updated>2026-03-10T16:12:05Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Título: Implementação e análise de algoritmos de caminho mínimo para cálculo de matrizes de distância
Autor(es): Lima, Henrique Lopes
Abstract: This work presents the theoretical foundation and methodology for implementing the Uniform Cost Search algorithm for computing shortest paths in directed, weighted graphs with nonnegative weights. The principles of the algorithm, its pseudocode implementation, and a methodology for performance evaluation are discussed, focusing on parallel implementations in Go and C++. The analysis covers time complexity, memory usage, and suitability for the problem, providing a robust foundation for practical and experimental studies on large-scale graphs.
Tipo: TCC</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

